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

Theorem uniwf 8626
Description: A union is well-founded iff the base set is. (Contributed by Mario Carneiro, 8-Jun-2013.) (Revised by Mario Carneiro, 17-Nov-2014.)
Assertion
Ref Expression
uniwf (𝐴 (𝑅1 “ On) ↔ 𝐴 (𝑅1 “ On))

Proof of Theorem uniwf
StepHypRef Expression
1 r1tr 8583 . . . . . . . 8 Tr (𝑅1‘suc (rank‘𝐴))
2 rankidb 8607 . . . . . . . 8 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
3 trss 4721 . . . . . . . 8 (Tr (𝑅1‘suc (rank‘𝐴)) → (𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) → 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴))))
41, 2, 3mpsyl 68 . . . . . . 7 (𝐴 (𝑅1 “ On) → 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴)))
5 rankdmr1 8608 . . . . . . . 8 (rank‘𝐴) ∈ dom 𝑅1
6 r1sucg 8576 . . . . . . . 8 ((rank‘𝐴) ∈ dom 𝑅1 → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
75, 6ax-mp 5 . . . . . . 7 (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴))
84, 7syl6sseq 3630 . . . . . 6 (𝐴 (𝑅1 “ On) → 𝐴 ⊆ 𝒫 (𝑅1‘(rank‘𝐴)))
9 sspwuni 4577 . . . . . 6 (𝐴 ⊆ 𝒫 (𝑅1‘(rank‘𝐴)) ↔ 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
108, 9sylib 208 . . . . 5 (𝐴 (𝑅1 “ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
11 fvex 6158 . . . . . 6 (𝑅1‘(rank‘𝐴)) ∈ V
1211elpw2 4788 . . . . 5 ( 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) ↔ 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
1310, 12sylibr 224 . . . 4 (𝐴 (𝑅1 “ On) → 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)))
1413, 7syl6eleqr 2709 . . 3 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
15 r1elwf 8603 . . 3 ( 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) → 𝐴 (𝑅1 “ On))
1614, 15syl 17 . 2 (𝐴 (𝑅1 “ On) → 𝐴 (𝑅1 “ On))
17 pwwf 8614 . . 3 ( 𝐴 (𝑅1 “ On) ↔ 𝒫 𝐴 (𝑅1 “ On))
18 pwuni 4859 . . . 4 𝐴 ⊆ 𝒫 𝐴
19 sswf 8615 . . . 4 ((𝒫 𝐴 (𝑅1 “ On) ∧ 𝐴 ⊆ 𝒫 𝐴) → 𝐴 (𝑅1 “ On))
2018, 19mpan2 706 . . 3 (𝒫 𝐴 (𝑅1 “ On) → 𝐴 (𝑅1 “ On))
2117, 20sylbi 207 . 2 ( 𝐴 (𝑅1 “ On) → 𝐴 (𝑅1 “ On))
2216, 21impbii 199 1 (𝐴 (𝑅1 “ On) ↔ 𝐴 (𝑅1 “ On))
Colors of variables: wff setvar class
Syntax hints:  wb 196   = wceq 1480  wcel 1987  wss 3555  𝒫 cpw 4130   cuni 4402  Tr wtr 4712  dom cdm 5074  cima 5077  Oncon0 5682  suc csuc 5684  cfv 5847  𝑅1cr1 8569  rankcrnk 8570
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 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902
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 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-int 4441  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-om 7013  df-wrecs 7352  df-recs 7413  df-rdg 7451  df-r1 8571  df-rank 8572
This theorem is referenced by:  rankuni2b  8660  r1limwun  9502  wfgru  9582
  Copyright terms: Public domain W3C validator