| 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 6374 | . . 3 ⊢ ∅ ∈ On | |
| 2 | cardonle 9876 | . . 3 ⊢ (∅ ∈ On → (card‘∅) ⊆ ∅) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ (card‘∅) ⊆ ∅ |
| 4 | ss0b 4342 | . 2 ⊢ ((card‘∅) ⊆ ∅ ↔ (card‘∅) = ∅) | |
| 5 | 3, 4 | mpbi 230 | 1 ⊢ (card‘∅) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 ⊆ wss 3890 ∅c0 4274 Oncon0 6319 ‘cfv 6494 cardccrd 9854 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-ord 6322 df-on 6323 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-en 8889 df-card 9858 |
| This theorem is referenced by: cardidm 9878 cardnueq0 9883 alephcard 9987 ackbij2lem2 10156 cf0 10168 cardcf 10169 cardeq0 10469 |
| Copyright terms: Public domain | W3C validator |