| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankr1bg | Structured version Visualization version GIF version | ||
| Description: A relationship between rank and 𝑅1. See rankr1ag 9773 for the membership version. (Contributed by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| rankr1bg | ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ (𝑅1‘𝐵) ↔ (rank‘𝐴) ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r1funlim 9737 | . . . . 5 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
| 2 | 1 | simpri 490 | . . . 4 ⊢ Lim dom 𝑅1 |
| 3 | limsuc 7844 | . . . 4 ⊢ (Lim dom 𝑅1 → (𝐵 ∈ dom 𝑅1 ↔ suc 𝐵 ∈ dom 𝑅1)) | |
| 4 | 2, 3 | ax-mp 5 | . . 3 ⊢ (𝐵 ∈ dom 𝑅1 ↔ suc 𝐵 ∈ dom 𝑅1) |
| 5 | rankr1ag 9773 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ suc 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝐴) ∈ suc 𝐵)) | |
| 6 | 4, 5 | sylan2b 605 | . 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝐴) ∈ suc 𝐵)) |
| 7 | r1sucg 9740 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) | |
| 8 | 7 | adantl 486 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) |
| 9 | 8 | eleq2d 2847 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘suc 𝐵) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝐵))) |
| 10 | fvex 6894 | . . . 4 ⊢ (𝑅1‘𝐵) ∈ V | |
| 11 | 10 | elpw2 5304 | . . 3 ⊢ (𝐴 ∈ 𝒫 (𝑅1‘𝐵) ↔ 𝐴 ⊆ (𝑅1‘𝐵)) |
| 12 | 9, 11 | bitr2di 291 | . 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ (𝑅1‘𝐵) ↔ 𝐴 ∈ (𝑅1‘suc 𝐵))) |
| 13 | rankon 9766 | . . 3 ⊢ (rank‘𝐴) ∈ On | |
| 14 | limord 6422 | . . . . . 6 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
| 15 | 2, 14 | ax-mp 5 | . . . . 5 ⊢ Ord dom 𝑅1 |
| 16 | ordelon 6384 | . . . . 5 ⊢ ((Ord dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → 𝐵 ∈ On) | |
| 17 | 15, 16 | mpan 702 | . . . 4 ⊢ (𝐵 ∈ dom 𝑅1 → 𝐵 ∈ On) |
| 18 | 17 | adantl 486 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → 𝐵 ∈ On) |
| 19 | onsssuc 6453 | . . 3 ⊢ (((rank‘𝐴) ∈ On ∧ 𝐵 ∈ On) → ((rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ∈ suc 𝐵)) | |
| 20 | 13, 18, 19 | sylancr 598 | . 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → ((rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ∈ suc 𝐵)) |
| 21 | 6, 12, 20 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ (𝑅1‘𝐵) ↔ (rank‘𝐴) ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2141 ⊆ wss 3904 𝒫 cpw 4561 ∪ cuni 4871 dom cdm 5661 “ cima 5664 Ord word 6359 Oncon0 6360 Lim wlim 6361 suc csuc 6362 Fun wfun 6530 ‘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: r1rankidb 9775 rankval3b 9797 rankssb 9819 rankeq0b 9831 rankr1id 9833 rankr1b 9835 |
| Copyright terms: Public domain | W3C validator |