HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem zorn2lem3 4800
Description: Lemma for zorn2 4806.
Hypotheses
Ref Expression
zorn2lem.1 |- A e. V
zorn2lem.2 |- B = {f | E.h e. On (f Fn h /\ A.t e. h (f` t) = (G` (f |` t)))}
zorn2lem.3 |- F = U.B
zorn2lem.4 |- C = {z e. A | A.g e. ran f gRz}
zorn2lem.5 |- D = {z e. A | A.g e. (F"x)gRz}
zorn2lem.6 |- G = {<.f, t>. | t = U.{v e. C | A.u e. C -. uwv}}
Assertion
Ref Expression
zorn2lem3 |- ((R Po A /\ (x e. On /\ (w We A /\ D =/= (/)))) -> (y e. x -> -. (F` x) = (F` y)))
Distinct variable groups:   x,y,w,h,t,z,f,g,u,v,A   B,h,t,f   x,F,y,z,v,u,f,g,h,t   h,G,t,f   t,C   y,D,u,v,f,t   x,R,y,z,w,g,u,v,f,t

Proof of Theorem zorn2lem3
StepHypRef Expression
1 zorn2lem.1 . . . 4 |- A e. V
2 zorn2lem.2 . . . 4 |- B = {f | E.h e. On (f Fn h /\ A.t e. h (f` t) = (G` (f |` t)))}
3 zorn2lem.3 . . . 4 |- F = U.B
4 zorn2lem.4 . . . 4 |- C = {z e. A | A.g e. ran f gRz}
5 zorn2lem.5 . . . 4 |- D = {z e. A | A.g e. (F"x)gRz}
6 zorn2lem.6 . . . 4 |- G = {<.f, t>. | t = U.{v e. C | A.u e. C -. uwv}}
71, 2, 3, 4, 5, 6zorn2lem2 4799 . . 3 |- ((x e. On /\ (w We A /\ D =/= (/))) -> (y e. x -> (F` y)R(F` x)))
87adantl 390 . 2 |- ((R Po A /\ (x e. On /\ (w We A /\ D =/= (/)))) -> (y e. x -> (F` y)R(F` x)))
9 breq1 2627 . . . . . 6 |- ((F` x) = (F` y) -> ((F` x)R(F` x) <-> (F` y)R(F` x)))
109biimprcd 156 . . . . 5 |- ((F` y)R(F` x) -> ((F` x) = (F` y) -> (F` x)R(F` x)))
11 poirr 2851 . . . . 5 |- ((R Po A /\ (F` x) e. A) -> -. (F` x)R(F` x))
1210, 11nsyli 121 . . . 4 |- ((F` y)R(F` x) -> ((R Po A /\ (F` x) e. A) -> -. (F` x) = (F` y)))
1312com12 11 . . 3 |- ((R Po A /\ (F` x) e. A) -> ((F` y)R(F` x) -> -. (F` x) = (F` y)))
141, 2, 3, 4, 5, 6zorn2lem1 4798 . . . 4 |- ((x e. On /\ (w We A /\ D =/= (/))) -> (F` x) e. D)
15 ssrab2 2134 . . . . . 6 |- {z e. A | A.g e. (F"x)gRz} (_ A
165, 15eqsstr 2094 . . . . 5 |- D (_ A
1716sseli 2068 . . . 4 |- ((F` x) e. D -> (F` x) e. A)
1814, 17syl 10 . . 3 |- ((x e. On /\ (w We A /\ D =/= (/))) -> (F` x) e. A)
1913, 18sylan2 453 . 2 |- ((R Po A /\ (x e. On /\ (w We A /\ D =/= (/)))) -> ((F` y)R(F` x) -> -. (F` x) = (F` y)))
208, 19syld 27 1 |- ((R Po A /\ (x e. On /\ (w We A /\ D =/= (/)))) -> (y e. x -> -. (F` x) = (F` y)))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   /\ wa 223   = wceq 958   e. wcel 960  {cab 1466   =/= wne 1588  A.wral 1648  E.wrex 1649  {crab 1651  Vcvv 1814  (/)c0 2283  U.cuni 2507   class class class wbr 2624  {copab 2671   Po wpo 2844   We wwe 2922  Oncon0 2954  ran crn 3177   |` cres 3178  "cima 3179   Fn wfn 3183  ` cfv 3188
This theorem is referenced by:  zorn2lem4 4801
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-rep 2698  ax-sep 2708  ax-nul 2715  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 778  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-reu 1654  df-rab 1655  df-v 1815  df-sbc 1945  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-tp 2419  df-op 2420  df-uni 2508  df-iun 2572  df-br 2625  df-opab 2672  df-tr 2686  df-eprel 2838  df-id 2841  df-po 2846  df-so 2856  df-fr 2923  df-we 2940  df-ord 2957  df-on 2958  df-suc 2960  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fn 3199  df-fv 3204
Copyright terms: Public domain