| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r1elwf | Structured version Visualization version GIF version | ||
| Description: Any member of the cumulative hierarchy is well-founded. (Contributed by Mario Carneiro, 28-May-2013.) (Revised by Mario Carneiro, 16-Nov-2014.) |
| Ref | Expression |
|---|---|
| r1elwf | ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r1funlim 9695 | . . . . . 6 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
| 2 | 1 | simpri 485 | . . . . 5 ⊢ Lim dom 𝑅1 |
| 3 | limord 6381 | . . . . 5 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
| 4 | ordsson 7739 | . . . . 5 ⊢ (Ord dom 𝑅1 → dom 𝑅1 ⊆ On) | |
| 5 | 2, 3, 4 | mp2b 10 | . . . 4 ⊢ dom 𝑅1 ⊆ On |
| 6 | elfvdm 6877 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1) | |
| 7 | 5, 6 | sselid 3941 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On) |
| 8 | r1tr 9705 | . . . . . 6 ⊢ Tr (𝑅1‘𝐵) | |
| 9 | trss 5220 | . . . . . 6 ⊢ (Tr (𝑅1‘𝐵) → (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵))) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵)) |
| 11 | elpwg 4562 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝐴 ∈ 𝒫 (𝑅1‘𝐵) ↔ 𝐴 ⊆ (𝑅1‘𝐵))) | |
| 12 | 10, 11 | mpbird 257 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ 𝒫 (𝑅1‘𝐵)) |
| 13 | r1sucg 9698 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) | |
| 14 | 6, 13 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) |
| 15 | 12, 14 | eleqtrrd 2831 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ (𝑅1‘suc 𝐵)) |
| 16 | suceq 6388 | . . . . . 6 ⊢ (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵) | |
| 17 | 16 | fveq2d 6844 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑅1‘suc 𝑥) = (𝑅1‘suc 𝐵)) |
| 18 | 17 | eleq2d 2814 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc 𝐵))) |
| 19 | 18 | rspcev 3585 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝐵)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
| 20 | 7, 15, 19 | syl2anc 584 | . 2 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
| 21 | rankwflemb 9722 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) | |
| 22 | 20, 21 | sylibr 234 | 1 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 ⊆ wss 3911 𝒫 cpw 4559 ∪ cuni 4867 Tr wtr 5209 dom cdm 5631 “ cima 5634 Ord word 6319 Oncon0 6320 Lim wlim 6321 suc csuc 6322 Fun wfun 6493 ‘cfv 6499 𝑅1cr1 9691 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-ov 7372 df-om 7823 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-r1 9693 |
| This theorem is referenced by: rankr1ai 9727 pwwf 9736 sswf 9737 unwf 9739 uniwf 9748 rankonidlem 9757 r1pw 9774 r1pwcl 9776 rankr1id 9791 tcrank 9813 dfac12lem2 10074 r1limwun 10665 r1wunlim 10666 inatsk 10707 |
| Copyright terms: Public domain | W3C validator |