| 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 9690 | . . . . . 6 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
| 2 | 1 | simpri 485 | . . . . 5 ⊢ Lim dom 𝑅1 |
| 3 | limord 6384 | . . . . 5 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
| 4 | ordsson 7737 | . . . . 5 ⊢ (Ord dom 𝑅1 → dom 𝑅1 ⊆ On) | |
| 5 | 2, 3, 4 | mp2b 10 | . . . 4 ⊢ dom 𝑅1 ⊆ On |
| 6 | elfvdm 6874 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1) | |
| 7 | 5, 6 | sselid 3919 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On) |
| 8 | r1tr 9700 | . . . . . 6 ⊢ Tr (𝑅1‘𝐵) | |
| 9 | trss 5202 | . . . . . 6 ⊢ (Tr (𝑅1‘𝐵) → (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵))) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵)) |
| 11 | elpwg 4544 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝐴 ∈ 𝒫 (𝑅1‘𝐵) ↔ 𝐴 ⊆ (𝑅1‘𝐵))) | |
| 12 | 10, 11 | mpbird 257 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ 𝒫 (𝑅1‘𝐵)) |
| 13 | r1sucg 9693 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) | |
| 14 | 6, 13 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) |
| 15 | 12, 14 | eleqtrrd 2839 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ (𝑅1‘suc 𝐵)) |
| 16 | suceq 6391 | . . . . . 6 ⊢ (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵) | |
| 17 | 16 | fveq2d 6844 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑅1‘suc 𝑥) = (𝑅1‘suc 𝐵)) |
| 18 | 17 | eleq2d 2822 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc 𝐵))) |
| 19 | 18 | rspcev 3564 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝐵)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
| 20 | 7, 15, 19 | syl2anc 585 | . 2 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
| 21 | rankwflemb 9717 | . 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 1542 ∈ wcel 2114 ∃wrex 3061 ⊆ wss 3889 𝒫 cpw 4541 ∪ cuni 4850 Tr wtr 5192 dom cdm 5631 “ cima 5634 Ord word 6322 Oncon0 6323 Lim wlim 6324 suc csuc 6325 Fun wfun 6492 ‘cfv 6498 𝑅1cr1 9686 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 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 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-r1 9688 |
| This theorem is referenced by: rankr1ai 9722 pwwf 9731 sswf 9732 unwf 9734 uniwf 9743 rankonidlem 9752 r1pw 9769 r1pwcl 9771 rankr1id 9786 tcrank 9808 dfac12lem2 10067 r1limwun 10659 r1wunlim 10660 inatsk 10701 r1wf 35239 r1elcl 35241 ttcwf 36706 |
| Copyright terms: Public domain | W3C validator |