| 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 6433 | . . 3 ⊢ ∅ ∈ On | |
| 2 | cardonle 10062 | . . 3 ⊢ (∅ ∈ On → (card‘∅) ⊆ ∅) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ (card‘∅) ⊆ ∅ |
| 4 | ss0b 4354 | . 2 ⊢ ((card‘∅) ⊆ ∅ ↔ (card‘∅) = ∅) | |
| 5 | 3, 4 | mpbi 233 | 1 ⊢ (card‘∅) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∅c0 4281 Oncon0 6377 ‘cfv 6555 cardccrd 10040 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6380 df-on 6381 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-en 8999 df-card 10044 |
| This theorem is used by: cardidm 10064 cardnueq0 10069 alephcard 10173 ackbij2lem2 10341 cf0 10352 cardcf 10353 cardeq0 10660 |
| Copyright terms: Public domain | W3C validator |