| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankr1id | Structured version Visualization version GIF version | ||
| Description: The rank of the hierarchy of an ordinal number is itself. (Contributed by NM, 14-Oct-2003.) (Revised by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| rankr1id | ⊢ (𝐴 ∈ dom 𝑅1 ↔ (rank‘(𝑅1‘𝐴)) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssid 3958 | . . . 4 ⊢ (𝑅1‘𝐴) ⊆ (𝑅1‘𝐴) | |
| 2 | fvex 6894 | . . . . . . . 8 ⊢ (𝑅1‘𝐴) ∈ V | |
| 3 | 2 | pwid 4584 | . . . . . . 7 ⊢ (𝑅1‘𝐴) ∈ 𝒫 (𝑅1‘𝐴) |
| 4 | r1sucg 9740 | . . . . . . 7 ⊢ (𝐴 ∈ dom 𝑅1 → (𝑅1‘suc 𝐴) = 𝒫 (𝑅1‘𝐴)) | |
| 5 | 3, 4 | eleqtrrid 2868 | . . . . . 6 ⊢ (𝐴 ∈ dom 𝑅1 → (𝑅1‘𝐴) ∈ (𝑅1‘suc 𝐴)) |
| 6 | r1elwf 9767 | . . . . . 6 ⊢ ((𝑅1‘𝐴) ∈ (𝑅1‘suc 𝐴) → (𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On)) | |
| 7 | 5, 6 | syl 18 | . . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 → (𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On)) |
| 8 | rankr1bg 9774 | . . . . 5 ⊢ (((𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ dom 𝑅1) → ((𝑅1‘𝐴) ⊆ (𝑅1‘𝐴) ↔ (rank‘(𝑅1‘𝐴)) ⊆ 𝐴)) | |
| 9 | 7, 8 | mpancom 700 | . . . 4 ⊢ (𝐴 ∈ dom 𝑅1 → ((𝑅1‘𝐴) ⊆ (𝑅1‘𝐴) ↔ (rank‘(𝑅1‘𝐴)) ⊆ 𝐴)) |
| 10 | 1, 9 | mpbii 236 | . . 3 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘(𝑅1‘𝐴)) ⊆ 𝐴) |
| 11 | rankonid 9800 | . . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 ↔ (rank‘𝐴) = 𝐴) | |
| 12 | 11 | biimpi 219 | . . . 4 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘𝐴) = 𝐴) |
| 13 | onssr1 9802 | . . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ⊆ (𝑅1‘𝐴)) | |
| 14 | rankssb 9819 | . . . . 5 ⊢ ((𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On) → (𝐴 ⊆ (𝑅1‘𝐴) → (rank‘𝐴) ⊆ (rank‘(𝑅1‘𝐴)))) | |
| 15 | 7, 13, 14 | sylc 66 | . . . 4 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘𝐴) ⊆ (rank‘(𝑅1‘𝐴))) |
| 16 | 12, 15 | eqsstrrd 3971 | . . 3 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ⊆ (rank‘(𝑅1‘𝐴))) |
| 17 | 10, 16 | eqssd 3953 | . 2 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘(𝑅1‘𝐴)) = 𝐴) |
| 18 | id 23 | . . 3 ⊢ ((rank‘(𝑅1‘𝐴)) = 𝐴 → (rank‘(𝑅1‘𝐴)) = 𝐴) | |
| 19 | rankdmr1 9772 | . . 3 ⊢ (rank‘(𝑅1‘𝐴)) ∈ dom 𝑅1 | |
| 20 | 18, 19 | eqeltrrdi 2870 | . 2 ⊢ ((rank‘(𝑅1‘𝐴)) = 𝐴 → 𝐴 ∈ dom 𝑅1) |
| 21 | 17, 20 | impbii 212 | 1 ⊢ (𝐴 ∈ dom 𝑅1 ↔ (rank‘(𝑅1‘𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 = wceq 1568 ∈ wcel 2141 ⊆ wss 3904 𝒫 cpw 4561 ∪ cuni 4871 dom cdm 5661 “ cima 5664 Oncon0 6360 suc csuc 6362 ‘cfv 6536 𝑅1cr1 9733 rankcrnk 9734 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-r1 9735 df-rank 9736 |
| This theorem is referenced by: rankuni 9834 |
| Copyright terms: Public domain | W3C validator |