| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > card0 | Structured version Visualization version GIF version | ||
| Description: The cardinality of the empty set is the empty set. (Contributed by NM, 25-Oct-2003.) |
| Ref | Expression |
|---|---|
| card0 | ⊢ (card‘∅) = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0elon 6419 | . . 3 ⊢ ∅ ∈ On | |
| 2 | cardonle 9980 | . . 3 ⊢ (∅ ∈ On → (card‘∅) ⊆ ∅) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ (card‘∅) ⊆ ∅ |
| 4 | ss0b 4383 | . 2 ⊢ ((card‘∅) ⊆ ∅ ↔ (card‘∅) = ∅) | |
| 5 | 3, 4 | mpbi 230 | 1 ⊢ (card‘∅) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1539 ∈ wcel 2107 ⊆ wss 3933 ∅c0 4315 Oncon0 6365 ‘cfv 6542 cardccrd 9958 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5278 ax-nul 5288 ax-pow 5347 ax-pr 5414 ax-un 7738 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3421 df-v 3466 df-dif 3936 df-un 3938 df-in 3940 df-ss 3950 df-pss 3953 df-nul 4316 df-if 4508 df-pw 4584 df-sn 4609 df-pr 4611 df-op 4615 df-uni 4890 df-int 4929 df-br 5126 df-opab 5188 df-mpt 5208 df-tr 5242 df-id 5560 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-ord 6368 df-on 6369 df-iota 6495 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-en 8969 df-card 9962 |
| This theorem is referenced by: cardidm 9982 cardnueq0 9987 alephcard 10093 ackbij2lem2 10262 cf0 10274 cardcf 10275 cardeq0 10575 |
| Copyright terms: Public domain | W3C validator |