| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rankeq0b | Structured version Visualization version GIF version | ||
| Description: A set is empty iff its rank is empty. (Contributed by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| rankeq0b | ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝐴 = ∅ ↔ (rank‘𝐴) = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6869 | . . 3 ⊢ (𝐴 = ∅ → (rank‘𝐴) = (rank‘∅)) | |
| 2 | r1funlim 9726 | . . . . . . 7 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
| 3 | 2 | simpri 489 | . . . . . 6 ⊢ Lim dom 𝑅1 |
| 4 | limomss 7853 | . . . . . 6 ⊢ (Lim dom 𝑅1 → ω ⊆ dom 𝑅1) | |
| 5 | 3, 4 | ax-mp 5 | . . . . 5 ⊢ ω ⊆ dom 𝑅1 |
| 6 | peano1 7871 | . . . . 5 ⊢ ∅ ∈ ω | |
| 7 | 5, 6 | sselii 3935 | . . . 4 ⊢ ∅ ∈ dom 𝑅1 |
| 8 | rankonid 9789 | . . . 4 ⊢ (∅ ∈ dom 𝑅1 ↔ (rank‘∅) = ∅) | |
| 9 | 7, 8 | mpbi 232 | . . 3 ⊢ (rank‘∅) = ∅ |
| 10 | 1, 9 | eqtrdi 2815 | . 2 ⊢ (𝐴 = ∅ → (rank‘𝐴) = ∅) |
| 11 | eqimss 3996 | . . . . . . 7 ⊢ ((rank‘𝐴) = ∅ → (rank‘𝐴) ⊆ ∅) | |
| 12 | 11 | adantl 485 | . . . . . 6 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → (rank‘𝐴) ⊆ ∅) |
| 13 | simpl 486 | . . . . . . 7 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 ∈ ∪ (𝑅1 “ On)) | |
| 14 | rankr1bg 9763 | . . . . . . 7 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ ∅ ∈ dom 𝑅1) → (𝐴 ⊆ (𝑅1‘∅) ↔ (rank‘𝐴) ⊆ ∅)) | |
| 15 | 13, 7, 14 | sylancl 595 | . . . . . 6 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → (𝐴 ⊆ (𝑅1‘∅) ↔ (rank‘𝐴) ⊆ ∅)) |
| 16 | 12, 15 | mpbird 259 | . . . . 5 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 ⊆ (𝑅1‘∅)) |
| 17 | r10 9728 | . . . . 5 ⊢ (𝑅1‘∅) = ∅ | |
| 18 | 16, 17 | sseqtrdi 3978 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 ⊆ ∅) |
| 19 | ss0 4358 | . . . 4 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅) | |
| 20 | 18, 19 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 = ∅) |
| 21 | 20 | ex 416 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → ((rank‘𝐴) = ∅ → 𝐴 = ∅)) |
| 22 | 10, 21 | impbid2 228 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝐴 = ∅ ↔ (rank‘𝐴) = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 ∈ wcel 2144 ⊆ wss 3906 ∅c0 4287 ∪ cuni 4867 dom cdm 5649 “ cima 5652 Oncon0 6348 Lim wlim 6349 Fun wfun 6517 ‘cfv 6523 ωcom 7848 𝑅1cr1 9722 rankcrnk 9723 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-ov 7401 df-om 7849 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-r1 9724 df-rank 9725 |
| This theorem is referenced by: rankeq0 9821 |
| Copyright terms: Public domain | W3C validator |