| 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 6881 | . . 3 ⊢ (𝐴 = ∅ → (rank‘𝐴) = (rank‘∅)) | |
| 2 | r1funlim 9737 | . . . . . . 7 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
| 3 | 2 | simpri 490 | . . . . . 6 ⊢ Lim dom 𝑅1 |
| 4 | limomss 7866 | . . . . . 6 ⊢ (Lim dom 𝑅1 → ω ⊆ dom 𝑅1) | |
| 5 | 3, 4 | ax-mp 5 | . . . . 5 ⊢ ω ⊆ dom 𝑅1 |
| 6 | peano1 7884 | . . . . 5 ⊢ ∅ ∈ ω | |
| 7 | 5, 6 | sselii 3933 | . . . 4 ⊢ ∅ ∈ dom 𝑅1 |
| 8 | rankonid 9800 | . . . 4 ⊢ (∅ ∈ dom 𝑅1 ↔ (rank‘∅) = ∅) | |
| 9 | 7, 8 | mpbi 233 | . . 3 ⊢ (rank‘∅) = ∅ |
| 10 | 1, 9 | eqtrdi 2812 | . 2 ⊢ (𝐴 = ∅ → (rank‘𝐴) = ∅) |
| 11 | eqimss 3994 | . . . . . . 7 ⊢ ((rank‘𝐴) = ∅ → (rank‘𝐴) ⊆ ∅) | |
| 12 | 11 | adantl 486 | . . . . . 6 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → (rank‘𝐴) ⊆ ∅) |
| 13 | simpl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 ∈ ∪ (𝑅1 “ On)) | |
| 14 | rankr1bg 9774 | . . . . . . 7 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ ∅ ∈ dom 𝑅1) → (𝐴 ⊆ (𝑅1‘∅) ↔ (rank‘𝐴) ⊆ ∅)) | |
| 15 | 13, 7, 14 | sylancl 597 | . . . . . 6 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → (𝐴 ⊆ (𝑅1‘∅) ↔ (rank‘𝐴) ⊆ ∅)) |
| 16 | 12, 15 | mpbird 260 | . . . . 5 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 ⊆ (𝑅1‘∅)) |
| 17 | r10 9739 | . . . . 5 ⊢ (𝑅1‘∅) = ∅ | |
| 18 | 16, 17 | sseqtrdi 3976 | . . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 ⊆ ∅) |
| 19 | ss0 4358 | . . . 4 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅) | |
| 20 | 18, 19 | syl 18 | . . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = ∅) → 𝐴 = ∅) |
| 21 | 20 | ex 417 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → ((rank‘𝐴) = ∅ → 𝐴 = ∅)) |
| 22 | 10, 21 | impbid2 229 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (𝐴 = ∅ ↔ (rank‘𝐴) = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2141 ⊆ wss 3904 ∅c0 4285 ∪ cuni 4871 dom cdm 5661 “ cima 5664 Oncon0 6360 Lim wlim 6361 Fun wfun 6530 ‘cfv 6536 ωcom 7861 𝑅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: rankeq0 9832 |
| Copyright terms: Public domain | W3C validator |