| 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 3939 | . . . 4 ⊢ (𝑅1‘𝐴) ⊆ (𝑅1‘𝐴) | |
| 2 | fvex 6842 | . . . . . . . 8 ⊢ (𝑅1‘𝐴) ∈ V | |
| 3 | 2 | pwid 4553 | . . . . . . 7 ⊢ (𝑅1‘𝐴) ∈ 𝒫 (𝑅1‘𝐴) |
| 4 | r1sucg 9682 | . . . . . . 7 ⊢ (𝐴 ∈ dom 𝑅1 → (𝑅1‘suc 𝐴) = 𝒫 (𝑅1‘𝐴)) | |
| 5 | 3, 4 | eleqtrrid 2842 | . . . . . 6 ⊢ (𝐴 ∈ dom 𝑅1 → (𝑅1‘𝐴) ∈ (𝑅1‘suc 𝐴)) |
| 6 | r1elwf 9709 | . . . . . 6 ⊢ ((𝑅1‘𝐴) ∈ (𝑅1‘suc 𝐴) → (𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On)) | |
| 7 | 5, 6 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 → (𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On)) |
| 8 | rankr1bg 9716 | . . . . 5 ⊢ (((𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ dom 𝑅1) → ((𝑅1‘𝐴) ⊆ (𝑅1‘𝐴) ↔ (rank‘(𝑅1‘𝐴)) ⊆ 𝐴)) | |
| 9 | 7, 8 | mpancom 689 | . . . 4 ⊢ (𝐴 ∈ dom 𝑅1 → ((𝑅1‘𝐴) ⊆ (𝑅1‘𝐴) ↔ (rank‘(𝑅1‘𝐴)) ⊆ 𝐴)) |
| 10 | 1, 9 | mpbii 233 | . . 3 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘(𝑅1‘𝐴)) ⊆ 𝐴) |
| 11 | rankonid 9742 | . . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 ↔ (rank‘𝐴) = 𝐴) | |
| 12 | 11 | biimpi 216 | . . . 4 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘𝐴) = 𝐴) |
| 13 | onssr1 9744 | . . . . 5 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ⊆ (𝑅1‘𝐴)) | |
| 14 | rankssb 9761 | . . . . 5 ⊢ ((𝑅1‘𝐴) ∈ ∪ (𝑅1 “ On) → (𝐴 ⊆ (𝑅1‘𝐴) → (rank‘𝐴) ⊆ (rank‘(𝑅1‘𝐴)))) | |
| 15 | 7, 13, 14 | sylc 65 | . . . 4 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘𝐴) ⊆ (rank‘(𝑅1‘𝐴))) |
| 16 | 12, 15 | eqsstrrd 3952 | . . 3 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ⊆ (rank‘(𝑅1‘𝐴))) |
| 17 | 10, 16 | eqssd 3934 | . 2 ⊢ (𝐴 ∈ dom 𝑅1 → (rank‘(𝑅1‘𝐴)) = 𝐴) |
| 18 | id 22 | . . 3 ⊢ ((rank‘(𝑅1‘𝐴)) = 𝐴 → (rank‘(𝑅1‘𝐴)) = 𝐴) | |
| 19 | rankdmr1 9714 | . . 3 ⊢ (rank‘(𝑅1‘𝐴)) ∈ dom 𝑅1 | |
| 20 | 18, 19 | eqeltrrdi 2844 | . 2 ⊢ ((rank‘(𝑅1‘𝐴)) = 𝐴 → 𝐴 ∈ dom 𝑅1) |
| 21 | 17, 20 | impbii 209 | 1 ⊢ (𝐴 ∈ dom 𝑅1 ↔ (rank‘(𝑅1‘𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1542 ∈ wcel 2114 ⊆ wss 3885 𝒫 cpw 4531 ∪ cuni 4840 dom cdm 5620 “ cima 5623 Oncon0 6312 suc csuc 6314 ‘cfv 6487 𝑅1cr1 9675 rankcrnk 9676 |
| 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 2184 ax-ext 2707 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-ral 3050 df-rex 3060 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-ov 7359 df-om 7807 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-r1 9677 df-rank 9678 |
| This theorem is referenced by: rankuni 9776 |
| Copyright terms: Public domain | W3C validator |