| 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 9745 | . . . . . 6 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
| 2 | 1 | simpri 491 | . . . . 5 ⊢ Lim dom 𝑅1 |
| 3 | limord 6426 | . . . . 5 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
| 4 | ordsson 7788 | . . . . 5 ⊢ (Ord dom 𝑅1 → dom 𝑅1 ⊆ On) | |
| 5 | 2, 3, 4 | mp2b 10 | . . . 4 ⊢ dom 𝑅1 ⊆ On |
| 6 | elfvdm 6919 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1) | |
| 7 | 5, 6 | sselid 3936 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On) |
| 8 | r1tr 9755 | . . . . . 6 ⊢ Tr (𝑅1‘𝐵) | |
| 9 | trss 5230 | . . . . . 6 ⊢ (Tr (𝑅1‘𝐵) → (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵))) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵)) |
| 11 | elpwg 4567 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝐴 ∈ 𝒫 (𝑅1‘𝐵) ↔ 𝐴 ⊆ (𝑅1‘𝐵))) | |
| 12 | 10, 11 | mpbird 260 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ 𝒫 (𝑅1‘𝐵)) |
| 13 | r1sucg 9748 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) | |
| 14 | 6, 13 | syl 18 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) |
| 15 | 12, 14 | eleqtrrd 2868 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ (𝑅1‘suc 𝐵)) |
| 16 | suceq 6433 | . . . . . 6 ⊢ (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵) | |
| 17 | 16 | fveq2d 6889 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑅1‘suc 𝑥) = (𝑅1‘suc 𝐵)) |
| 18 | 17 | eleq2d 2851 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc 𝐵))) |
| 19 | 18 | rspcev 3583 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝐵)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
| 20 | 7, 15, 19 | syl2anc 596 | . 2 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
| 21 | rankwflemb 9772 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) | |
| 22 | 20, 21 | sylibr 237 | 1 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 ⊆ wss 3906 𝒫 cpw 4564 ∪ cuni 4874 Tr wtr 5220 dom cdm 5663 “ cima 5666 Ord word 6363 Oncon0 6364 Lim wlim 6365 suc csuc 6366 Fun wfun 6534 ‘cfv 6540 𝑅1cr1 9741 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-r1 9743 |
| This theorem is used by: rankr1ai 9777 pwwf 9786 sswf 9787 unwf 9789 uniwf 9798 rankonidlem 9807 r1pw 9824 r1pwcl 9826 rankr1id 9841 tcrank 9863 dfac12lem2 10144 r1limwun 10736 r1wunlim 10737 inatsk 10778 r1wf 35547 r1elcl 35549 ttcwf 37092 |
| Copyright terms: Public domain | W3C validator |