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 6316 | . . 3 ⊢ ∅ ∈ On | |
2 | cardonle 9699 | . . 3 ⊢ (∅ ∈ On → (card‘∅) ⊆ ∅) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ (card‘∅) ⊆ ∅ |
4 | ss0b 4336 | . 2 ⊢ ((card‘∅) ⊆ ∅ ↔ (card‘∅) = ∅) | |
5 | 3, 4 | mpbi 229 | 1 ⊢ (card‘∅) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ∈ wcel 2109 ⊆ wss 3891 ∅c0 4261 Oncon0 6263 ‘cfv 6430 cardccrd 9677 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-ral 3070 df-rex 3071 df-rab 3074 df-v 3432 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4845 df-int 4885 df-br 5079 df-opab 5141 df-mpt 5162 df-tr 5196 df-id 5488 df-eprel 5494 df-po 5502 df-so 5503 df-fr 5543 df-we 5545 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-ord 6266 df-on 6267 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-en 8708 df-card 9681 |
This theorem is referenced by: cardidm 9701 cardnueq0 9706 alephcard 9810 ackbij2lem2 9980 cf0 9991 cardcf 9992 cardeq0 10292 |
Copyright terms: Public domain | W3C validator |