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

Theorem r1tr 3498
Description: The cumulative hierarchy of sets is transitive. Lemma 7T of [Enderton] p. 202.
Assertion
Ref Expression
r1tr |- Tr (R1` A)

Proof of Theorem r1tr
StepHypRef Expression
1 fveq2 2832 . . . 4 |- (x = (/) -> (R1` x) = (R1` (/)))
2 treq 2047 . . . 4 |- ((R1` x) = (R1` (/)) -> (Tr (R1` x) <-> Tr (R1` (/))))
31, 2syl 12 . . 3 |- (x = (/) -> (Tr (R1` x) <-> Tr (R1` (/))))
4 fveq2 2832 . . . 4 |- (x = y -> (R1` x) = (R1` y))
5 treq 2047 . . . 4 |- ((R1` x) = (R1` y) -> (Tr (R1` x) <-> Tr (R1` y)))
64, 5syl 12 . . 3 |- (x = y -> (Tr (R1` x) <-> Tr (R1` y)))
7 fveq2 2832 . . . 4 |- (x = suc y -> (R1` x) = (R1` suc y))
8 treq 2047 . . . 4 |- ((R1` x) = (R1` suc y) -> (Tr (R1` x) <-> Tr (R1` suc y)))
97, 8syl 12 . . 3 |- (x = suc y -> (Tr (R1` x) <-> Tr (R1` suc y)))
10 fveq2 2832 . . . 4 |- (x = A -> (R1` x) = (R1` A))
11 treq 2047 . . . 4 |- ((R1` x) = (R1` A) -> (Tr (R1` x) <-> Tr (R1` A)))
1210, 11syl 12 . . 3 |- (x = A -> (Tr (R1` x) <-> Tr (R1` A)))
13 tr0 2052 . . . 4 |- Tr (/)
14 r10 3495 . . . . 5 |- (R1` (/)) = (/)
15 treq 2047 . . . . 5 |- ((R1` (/)) = (/) -> (Tr (R1` (/)) <-> Tr (/)))
1614, 15ax-mp 6 . . . 4 |- (Tr (R1` (/)) <-> Tr (/))
1713, 16mpbir 165 . . 3 |- Tr (R1` (/))
18 r1suc 3496 . . . . . . . . . 10 |- (y e. On -> (R1` suc y) = P~(R1` y))
1918eleq2d 1156 . . . . . . . . 9 |- (y e. On -> (x e. (R1` suc y) <-> x e. P~(R1` y)))
20 visset 1350 . . . . . . . . . 10 |- x e. V
2120elpw 1801 . . . . . . . . 9 |- (x e. P~(R1` y) <-> x (_ (R1` y))
2219, 21syl6bb 414 . . . . . . . 8 |- (y e. On -> (x e. (R1` suc y) <-> x (_ (R1` y)))
2322adantr 306 . . . . . . 7 |- ((y e. On /\ Tr (R1` y)) -> (x e. (R1` suc y) <-> x (_ (R1` y)))
24 ssel 1502 . . . . . . . . . 10 |- (x (_ (R1` y) -> (z e. x -> z e. (R1` y)))
25 dftr4 2046 . . . . . . . . . . . 12 |- (Tr (R1` y) <-> (R1` y) (_ P~(R1` y))
26 ssel 1502 . . . . . . . . . . . 12 |- ((R1` y) (_ P~(R1` y) -> (z e. (R1` y) -> z e. P~(R1` y)))
2725, 26sylbi 174 . . . . . . . . . . 11 |- (Tr (R1` y) -> (z e. (R1` y) -> z e. P~(R1` y)))
2818eleq2d 1156 . . . . . . . . . . . 12 |- (y e. On -> (z e. (R1` suc y) <-> z e. P~(R1` y)))
2928biimprd 136 . . . . . . . . . . 11 |- (y e. On -> (z e. P~(R1` y) -> z e. (R1` suc y)))
3027, 29sylan9r 360 . . . . . . . . . 10 |- ((y e. On /\ Tr (R1` y)) -> (z e. (R1` y) -> z e. (R1` suc y)))
3124, 30sylan9r 360 . . . . . . . . 9 |- (((y e. On /\ Tr (R1` y)) /\ x (_ (R1` y)) -> (z e. x -> z e. (R1` suc y)))
3231ssrdv 1509 . . . . . . . 8 |- (((y e. On /\ Tr (R1` y)) /\ x (_ (R1` y)) -> x (_ (R1` suc y))
3332exp 291 . . . . . . 7 |- ((y e. On /\ Tr (R1` y)) -> (x (_ (R1` y) -> x (_ (R1` suc y)))
3423, 33sylbid 178 . . . . . 6 |- ((y e. On /\ Tr (R1` y)) -> (x e. (R1` suc y) -> x (_ (R1` suc y)))
3534r19.21aiv 1259 . . . . 5 |- ((y e. On /\ Tr (R1` y)) -> A.x e. (R1` suc y)x (_ (R1` suc y))
36 dftr3 2045 . . . . 5 |- (Tr (R1` suc y) <-> A.x e. (R1` suc y)x (_ (R1` suc y))
3735, 36sylibr 175 . . . 4 |- ((y e. On /\ Tr (R1` y)) -> Tr (R1` suc y))
3837exp 291 . . 3 |- (y e. On -> (Tr (R1` y) -> Tr (R1` suc y)))
39 r1lim 3497 . . . . . . . . . . 11 |- ((x e. V /\ Lim x) -> (R1` x) = U.y e. x (R1` y))
4020, 39mpan 518 . . . . . . . . . 10 |- (Lim x -> (R1` x) = U.y e. x (R1` y))
4140eleq2d 1156 . . . . . . . . 9 |- (Lim x -> (z e. (R1` x) <-> z e. U.y e. x (R1` y)))
42 eliun 1998 . . . . . . . . . 10 |- (z e. U.y e. x (R1` y) <-> E.y e. x z e. (R1` y))
4342biimp 133 . . . . . . . . 9 |- (z e. U.y e. x (R1` y) -> E.y e. x z e. (R1` y))
4441, 43syl6bi 187 . . . . . . . 8 |- (Lim x -> (z e. (R1` x) -> E.y e. x z e. (R1` y)))
45 hbra1 1237 . . . . . . . . 9 |- (A.y e. x Tr (R1` y) -> A.yA.y e. x Tr (R1` y))
46 ra4 1243 . . . . . . . . . 10 |- (A.y e. x Tr (R1` y) -> (y e. x -> Tr (R1` y)))
47 trss 2050 . . . . . . . . . 10 |- (Tr (R1` y) -> (z e. (R1` y) -> z (_ (R1` y)))
4846, 47syl6 23 . . . . . . . . 9 |- (A.y e. x Tr (R1` y) -> (y e. x -> (z e. (R1` y) -> z (_ (R1` y))))
4945, 48r19.22d 1276 . . . . . . . 8 |- (A.y e. x Tr (R1` y) -> (E.y e. x z e. (R1` y) -> E.y e. x z (_ (R1` y)))
5044, 49sylan9 359 . . . . . . 7 |- ((Lim x /\ A.y e. x Tr (R1` y)) -> (z e. (R1` x) -> E.y e. x z (_ (R1` y)))
5140sseq2d 1528 . . . . . . . . 9 |- (Lim x -> (z (_ (R1` x) <-> z (_ U.y e. x (R1` y)))
52 ssiun 2018 . . . . . . . . 9 |- (E.y e. x z (_ (R1` y) -> z (_ U.y e. x (R1` y))
5351, 52syl5bir 184 . . . . . . . 8 |- (Lim x -> (E.y e. x z (_ (R1` y) -> z (_ (R1` x)))
5453adantr 306 . . . . . . 7 |- ((Lim x /\ A.y e. x Tr (R1` y)) -> (E.y e. x z (_ (R1` y) -> z (_ (R1` x)))
5550, 54syld 27 . . . . . 6 |- ((Lim x /\ A.y e. x Tr (R1` y)) -> (z e. (R1` x) -> z (_ (R1` x)))
5655r19.21aiv 1259 . . . . 5 |- ((Lim x /\ A.y e. x Tr (R1` y)) -> A.z e. (R1` x)z (_ (R1` x))
57 dftr3 2045 . . . . 5 |- (Tr (R1` x) <-> A.z e. (R1` x)z (_ (R1` x))
5856, 57sylibr 175 . . . 4 |- ((Lim x /\ A.y e. x Tr (R1` y)) -> Tr (R1` x))
5958exp 291 . . 3 |- (Lim x -> (A.y e. x Tr (R1` y) -> Tr (R1` x)))
603, 6, 9, 12, 17, 38, 59tfinds 2401 . 2 |- (A e. On -> Tr (R1` A))
61 r1fnon 3494 . . . . . . . 8 |- R1 Fn On
62 fndm 2723 . . . . . . . 8 |- (R1 Fn On -> dom R1 = On)
6361, 62ax-mp 6 . . . . . . 7 |- dom R1 = On
6463eleq2i 1153 . . . . . 6 |- (A e. dom R1 <-> A e. On)
6564negbii 162 . . . . 5 |- (-. A e. dom R1 <-> -. A e. On)
66 ndmfv 2848 . . . . 5 |- (-. A e. dom R1 -> (R1` A) = (/))
6765, 66sylbir 176 . . . 4 |- (-. A e. On -> (R1` A) = (/))
68 treq 2047 . . . 4 |- ((R1` A) = (/) -> (Tr (R1` A) <-> Tr (/)))
6967, 68syl 12 . . 3 |- (-. A e. On -> (Tr (R1` A) <-> Tr (/)))
7013, 69mpbiri 169 . 2 |- (-. A e. On -> Tr (R1` A))
7160, 70pm2.61i 110 1 |- Tr (R1` A)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127   /\ wa 196   = weq 797   e. wel 803   = wceq 1091   e. wcel 1092  A.wral 1201  E.wrex 1202  Vcvv 1348   (_ wss 1487  (/)c0 1707  P~cpw 1798  U.ciun 1994  Tr wtr 2041  Oncon0 2199  Lim wlim 2200  suc csuc 2201  dom cdm 2410   Fn wfn 2417  ` cfv 2422  R1cr1 3485
This theorem is referenced by:  r1ord 3499  r1ord2 3500
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-fv 2438  df-rdg 2970  df-r1 3487
metamath.org