| 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 9758 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 9722 | . . . . 5 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
| 2 | 1 | simpri 489 | . . . 4 ⊢ Lim dom 𝑅1 |
| 3 | limsuc 7829 | . . . 4 ⊢ (Lim dom 𝑅1 → (𝐵 ∈ dom 𝑅1 ↔ suc 𝐵 ∈ dom 𝑅1)) | |
| 4 | 2, 3 | ax-mp 5 | . . 3 ⊢ (𝐵 ∈ dom 𝑅1 ↔ suc 𝐵 ∈ dom 𝑅1) |
| 5 | rankr1ag 9758 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ suc 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝐴) ∈ suc 𝐵)) | |
| 6 | 4, 5 | sylan2b 603 | . 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝐴) ∈ suc 𝐵)) |
| 7 | r1sucg 9725 | . . . . 5 ⊢ (𝐵 ∈ dom 𝑅1 → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) | |
| 8 | 7 | adantl 485 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝑅1‘suc 𝐵) = 𝒫 (𝑅1‘𝐵)) |
| 9 | 8 | eleq2d 2849 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1‘suc 𝐵) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝐵))) |
| 10 | fvex 6880 | . . . 4 ⊢ (𝑅1‘𝐵) ∈ V | |
| 11 | 10 | elpw2 5291 | . . 3 ⊢ (𝐴 ∈ 𝒫 (𝑅1‘𝐵) ↔ 𝐴 ⊆ (𝑅1‘𝐵)) |
| 12 | 9, 11 | bitr2di 290 | . 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ (𝑅1‘𝐵) ↔ 𝐴 ∈ (𝑅1‘suc 𝐵))) |
| 13 | rankon 9751 | . . 3 ⊢ (rank‘𝐴) ∈ On | |
| 14 | limord 6407 | . . . . . 6 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1) | |
| 15 | 2, 14 | ax-mp 5 | . . . . 5 ⊢ Ord dom 𝑅1 |
| 16 | ordelon 6370 | . . . . 5 ⊢ ((Ord dom 𝑅1 ∧ 𝐵 ∈ dom 𝑅1) → 𝐵 ∈ On) | |
| 17 | 15, 16 | mpan 700 | . . . 4 ⊢ (𝐵 ∈ dom 𝑅1 → 𝐵 ∈ On) |
| 18 | 17 | adantl 485 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → 𝐵 ∈ On) |
| 19 | onsssuc 6438 | . . 3 ⊢ (((rank‘𝐴) ∈ On ∧ 𝐵 ∈ On) → ((rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ∈ suc 𝐵)) | |
| 20 | 13, 18, 19 | sylancr 596 | . 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → ((rank‘𝐴) ⊆ 𝐵 ↔ (rank‘𝐴) ∈ suc 𝐵)) |
| 21 | 6, 12, 20 | 3bitr4d 313 | 1 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ⊆ (𝑅1‘𝐵) ↔ (rank‘𝐴) ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1561 ∈ wcel 2143 ⊆ wss 3905 𝒫 cpw 4556 ∪ cuni 4866 dom cdm 5648 “ cima 5651 Ord word 6345 Oncon0 6346 Lim wlim 6347 suc csuc 6348 Fun wfun 6515 ‘cfv 6521 𝑅1cr1 9718 rankcrnk 9719 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-r1 9720 df-rank 9721 |
| This theorem is referenced by: r1rankidb 9760 rankval3b 9782 rankssb 9804 rankeq0b 9816 rankr1id 9818 rankr1b 9820 |
| Copyright terms: Public domain | W3C validator |