Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  r1tr Structured version   Visualization version   GIF version

Theorem r1tr 8599
 Description: The cumulative hierarchy of sets is transitive. Lemma 7T of [Enderton] p. 202. (Contributed by NM, 8-Sep-2003.) (Revised by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
r1tr Tr (𝑅1𝐴)

Proof of Theorem r1tr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 r1funlim 8589 . . . . . 6 (Fun 𝑅1 ∧ Lim dom 𝑅1)
21simpri 478 . . . . 5 Lim dom 𝑅1
3 limord 5753 . . . . 5 (Lim dom 𝑅1 → Ord dom 𝑅1)
4 ordsson 6951 . . . . 5 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
52, 3, 4mp2b 10 . . . 4 dom 𝑅1 ⊆ On
65sseli 3584 . . 3 (𝐴 ∈ dom 𝑅1𝐴 ∈ On)
7 fveq2 6158 . . . . . 6 (𝑥 = ∅ → (𝑅1𝑥) = (𝑅1‘∅))
8 r10 8591 . . . . . 6 (𝑅1‘∅) = ∅
97, 8syl6eq 2671 . . . . 5 (𝑥 = ∅ → (𝑅1𝑥) = ∅)
10 treq 4728 . . . . 5 ((𝑅1𝑥) = ∅ → (Tr (𝑅1𝑥) ↔ Tr ∅))
119, 10syl 17 . . . 4 (𝑥 = ∅ → (Tr (𝑅1𝑥) ↔ Tr ∅))
12 fveq2 6158 . . . . 5 (𝑥 = 𝑦 → (𝑅1𝑥) = (𝑅1𝑦))
13 treq 4728 . . . . 5 ((𝑅1𝑥) = (𝑅1𝑦) → (Tr (𝑅1𝑥) ↔ Tr (𝑅1𝑦)))
1412, 13syl 17 . . . 4 (𝑥 = 𝑦 → (Tr (𝑅1𝑥) ↔ Tr (𝑅1𝑦)))
15 fveq2 6158 . . . . 5 (𝑥 = suc 𝑦 → (𝑅1𝑥) = (𝑅1‘suc 𝑦))
16 treq 4728 . . . . 5 ((𝑅1𝑥) = (𝑅1‘suc 𝑦) → (Tr (𝑅1𝑥) ↔ Tr (𝑅1‘suc 𝑦)))
1715, 16syl 17 . . . 4 (𝑥 = suc 𝑦 → (Tr (𝑅1𝑥) ↔ Tr (𝑅1‘suc 𝑦)))
18 fveq2 6158 . . . . 5 (𝑥 = 𝐴 → (𝑅1𝑥) = (𝑅1𝐴))
19 treq 4728 . . . . 5 ((𝑅1𝑥) = (𝑅1𝐴) → (Tr (𝑅1𝑥) ↔ Tr (𝑅1𝐴)))
2018, 19syl 17 . . . 4 (𝑥 = 𝐴 → (Tr (𝑅1𝑥) ↔ Tr (𝑅1𝐴)))
21 tr0 4734 . . . 4 Tr ∅
22 limsuc 7011 . . . . . . . 8 (Lim dom 𝑅1 → (𝑦 ∈ dom 𝑅1 ↔ suc 𝑦 ∈ dom 𝑅1))
232, 22ax-mp 5 . . . . . . 7 (𝑦 ∈ dom 𝑅1 ↔ suc 𝑦 ∈ dom 𝑅1)
24 simpr 477 . . . . . . . . 9 ((𝑦 ∈ On ∧ Tr (𝑅1𝑦)) → Tr (𝑅1𝑦))
25 pwtr 4892 . . . . . . . . 9 (Tr (𝑅1𝑦) ↔ Tr 𝒫 (𝑅1𝑦))
2624, 25sylib 208 . . . . . . . 8 ((𝑦 ∈ On ∧ Tr (𝑅1𝑦)) → Tr 𝒫 (𝑅1𝑦))
27 r1sucg 8592 . . . . . . . . 9 (𝑦 ∈ dom 𝑅1 → (𝑅1‘suc 𝑦) = 𝒫 (𝑅1𝑦))
28 treq 4728 . . . . . . . . 9 ((𝑅1‘suc 𝑦) = 𝒫 (𝑅1𝑦) → (Tr (𝑅1‘suc 𝑦) ↔ Tr 𝒫 (𝑅1𝑦)))
2927, 28syl 17 . . . . . . . 8 (𝑦 ∈ dom 𝑅1 → (Tr (𝑅1‘suc 𝑦) ↔ Tr 𝒫 (𝑅1𝑦)))
3026, 29syl5ibrcom 237 . . . . . . 7 ((𝑦 ∈ On ∧ Tr (𝑅1𝑦)) → (𝑦 ∈ dom 𝑅1 → Tr (𝑅1‘suc 𝑦)))
3123, 30syl5bir 233 . . . . . 6 ((𝑦 ∈ On ∧ Tr (𝑅1𝑦)) → (suc 𝑦 ∈ dom 𝑅1 → Tr (𝑅1‘suc 𝑦)))
32 ndmfv 6185 . . . . . . . 8 (¬ suc 𝑦 ∈ dom 𝑅1 → (𝑅1‘suc 𝑦) = ∅)
33 treq 4728 . . . . . . . 8 ((𝑅1‘suc 𝑦) = ∅ → (Tr (𝑅1‘suc 𝑦) ↔ Tr ∅))
3432, 33syl 17 . . . . . . 7 (¬ suc 𝑦 ∈ dom 𝑅1 → (Tr (𝑅1‘suc 𝑦) ↔ Tr ∅))
3521, 34mpbiri 248 . . . . . 6 (¬ suc 𝑦 ∈ dom 𝑅1 → Tr (𝑅1‘suc 𝑦))
3631, 35pm2.61d1 171 . . . . 5 ((𝑦 ∈ On ∧ Tr (𝑅1𝑦)) → Tr (𝑅1‘suc 𝑦))
3736ex 450 . . . 4 (𝑦 ∈ On → (Tr (𝑅1𝑦) → Tr (𝑅1‘suc 𝑦)))
38 triun 4736 . . . . . . . 8 (∀𝑦𝑥 Tr (𝑅1𝑦) → Tr 𝑦𝑥 (𝑅1𝑦))
39 r1limg 8594 . . . . . . . . . 10 ((𝑥 ∈ dom 𝑅1 ∧ Lim 𝑥) → (𝑅1𝑥) = 𝑦𝑥 (𝑅1𝑦))
4039ancoms 469 . . . . . . . . 9 ((Lim 𝑥𝑥 ∈ dom 𝑅1) → (𝑅1𝑥) = 𝑦𝑥 (𝑅1𝑦))
41 treq 4728 . . . . . . . . 9 ((𝑅1𝑥) = 𝑦𝑥 (𝑅1𝑦) → (Tr (𝑅1𝑥) ↔ Tr 𝑦𝑥 (𝑅1𝑦)))
4240, 41syl 17 . . . . . . . 8 ((Lim 𝑥𝑥 ∈ dom 𝑅1) → (Tr (𝑅1𝑥) ↔ Tr 𝑦𝑥 (𝑅1𝑦)))
4338, 42syl5ibr 236 . . . . . . 7 ((Lim 𝑥𝑥 ∈ dom 𝑅1) → (∀𝑦𝑥 Tr (𝑅1𝑦) → Tr (𝑅1𝑥)))
4443impancom 456 . . . . . 6 ((Lim 𝑥 ∧ ∀𝑦𝑥 Tr (𝑅1𝑦)) → (𝑥 ∈ dom 𝑅1 → Tr (𝑅1𝑥)))
45 ndmfv 6185 . . . . . . . 8 𝑥 ∈ dom 𝑅1 → (𝑅1𝑥) = ∅)
4645, 10syl 17 . . . . . . 7 𝑥 ∈ dom 𝑅1 → (Tr (𝑅1𝑥) ↔ Tr ∅))
4721, 46mpbiri 248 . . . . . 6 𝑥 ∈ dom 𝑅1 → Tr (𝑅1𝑥))
4844, 47pm2.61d1 171 . . . . 5 ((Lim 𝑥 ∧ ∀𝑦𝑥 Tr (𝑅1𝑦)) → Tr (𝑅1𝑥))
4948ex 450 . . . 4 (Lim 𝑥 → (∀𝑦𝑥 Tr (𝑅1𝑦) → Tr (𝑅1𝑥)))
5011, 14, 17, 20, 21, 37, 49tfinds 7021 . . 3 (𝐴 ∈ On → Tr (𝑅1𝐴))
516, 50syl 17 . 2 (𝐴 ∈ dom 𝑅1 → Tr (𝑅1𝐴))
52 ndmfv 6185 . . . 4 𝐴 ∈ dom 𝑅1 → (𝑅1𝐴) = ∅)
53 treq 4728 . . . 4 ((𝑅1𝐴) = ∅ → (Tr (𝑅1𝐴) ↔ Tr ∅))
5452, 53syl 17 . . 3 𝐴 ∈ dom 𝑅1 → (Tr (𝑅1𝐴) ↔ Tr ∅))
5521, 54mpbiri 248 . 2 𝐴 ∈ dom 𝑅1 → Tr (𝑅1𝐴))
5651, 55pm2.61i 176 1 Tr (𝑅1𝐴)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 196   ∧ wa 384   = wceq 1480   ∈ wcel 1987  ∀wral 2908   ⊆ wss 3560  ∅c0 3897  𝒫 cpw 4136  ∪ ciun 4492  Tr wtr 4722  dom cdm 5084  Ord word 5691  Oncon0 5692  Lim wlim 5693  suc csuc 5694  Fun wfun 5851  ‘cfv 5857  𝑅1cr1 8585 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-tp 4160  df-op 4162  df-uni 4410  df-iun 4494  df-br 4624  df-opab 4684  df-mpt 4685  df-tr 4723  df-eprel 4995  df-id 4999  df-po 5005  df-so 5006  df-fr 5043  df-we 5045  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-pred 5649  df-ord 5695  df-on 5696  df-lim 5697  df-suc 5698  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-om 7028  df-wrecs 7367  df-recs 7428  df-rdg 7466  df-r1 8587 This theorem is referenced by:  r1tr2  8600  r1ordg  8601  r1ord3g  8602  r1ord2  8604  r1sssuc  8606  r1pwss  8607  r1val1  8609  rankwflemb  8616  r1elwf  8619  r1elssi  8628  uniwf  8642  tcrank  8707  ackbij2lem3  9023  r1limwun  9518  tskr1om2  9550
 Copyright terms: Public domain W3C validator