![]() |
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 9763 | . . . . . 6 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
2 | 1 | simpri 484 | . . . . 5 ⊢ Lim dom 𝑅1 |
3 | limord 6423 | . . . . 5 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
4 | ordsson 7772 | . . . . 5 ⊢ (Ord dom 𝑅1 → dom 𝑅1 ⊆ On) | |
5 | 2, 3, 4 | mp2b 10 | . . . 4 ⊢ dom 𝑅1 ⊆ On |
6 | elfvdm 6927 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1) | |
7 | 5, 6 | sselid 3979 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On) |
8 | r1tr 9773 | . . . . . 6 ⊢ Tr (𝑅1‘𝐵) | |
9 | trss 5275 | . . . . . 6 ⊢ (Tr (𝑅1‘𝐵) → (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵))) | |
10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ⊆ (𝑅1‘𝐵)) |
11 | elpwg 4604 | . . . . 5 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝐴 ∈ 𝒫 (𝑅1‘𝐵) ↔ 𝐴 ⊆ (𝑅1‘𝐵))) | |
12 | 10, 11 | mpbird 256 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ 𝒫 (𝑅1‘𝐵)) |
13 | r1sucg 9766 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) | |
14 | 6, 13 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) |
15 | 12, 14 | eleqtrrd 2834 | . . 3 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ (𝑅1‘suc 𝐵)) |
16 | suceq 6429 | . . . . . 6 ⊢ (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵) | |
17 | 16 | fveq2d 6894 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝑅1‘suc 𝑥) = (𝑅1‘suc 𝐵)) |
18 | 17 | eleq2d 2817 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc 𝐵))) |
19 | 18 | rspcev 3611 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝐵)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
20 | 7, 15, 19 | syl2anc 582 | . 2 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) |
21 | rankwflemb 9790 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)) | |
22 | 20, 21 | sylibr 233 | 1 ⊢ (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2104 ∃wrex 3068 ⊆ wss 3947 𝒫 cpw 4601 ∪ cuni 4907 Tr wtr 5264 dom cdm 5675 “ cima 5678 Ord word 6362 Oncon0 6363 Lim wlim 6364 suc csuc 6365 Fun wfun 6536 ‘cfv 6542 𝑅1cr1 9759 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7414 df-om 7858 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-r1 9761 |
This theorem is referenced by: rankr1ai 9795 pwwf 9804 sswf 9805 unwf 9807 uniwf 9816 rankonidlem 9825 r1pw 9842 r1pwcl 9844 rankr1id 9859 tcrank 9881 dfac12lem2 10141 r1limwun 10733 r1wunlim 10734 inatsk 10775 |
Copyright terms: Public domain | W3C validator |