Theorem cardnueq0 9393

Description: The empty set is the only numerable set with cardinality zero. (Contributed by Mario Carneiro, 7-Jan-2013.)

Assertion

Ref	Expression
cardnueq0	⊢ (𝐴 ∈ dom card → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))

Proof of Theorem cardnueq0

Step	Hyp	Ref	Expression
1		cardid2 9382	. . . 4 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
2	1	ensymd 8560	. . 3 ⊢ (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3		breq2 5070	. . . 4 ⊢ ((card‘𝐴) = ∅ → (𝐴 ≈ (card‘𝐴) ↔ 𝐴 ≈ ∅))
4		en0 8572	. . . 4 ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅)
5	3, 4	syl6bb 289	. . 3 ⊢ ((card‘𝐴) = ∅ → (𝐴 ≈ (card‘𝐴) ↔ 𝐴 = ∅))
6	2, 5	syl5ibcom 247	. 2 ⊢ (𝐴 ∈ dom card → ((card‘𝐴) = ∅ → 𝐴 = ∅))
7		fveq2 6670	. . 3 ⊢ (𝐴 = ∅ → (card‘𝐴) = (card‘∅))
8		card0 9387	. . 3 ⊢ (card‘∅) = ∅
9	7, 8	syl6eq 2872	. 2 ⊢ (𝐴 = ∅ → (card‘𝐴) = ∅)
10	6, 9	impbid1 227	1 ⊢ (𝐴 ∈ dom card → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1537   ∈ wcel 2114  ∅c0 4291   class class class wbr 5066  dom cdm 5555  ‘cfv 6355   ≈ cen 8506  cardccrd 9364

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-ord 6194  df-on 6195  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-er 8289  df-en 8510  df-card 9368

This theorem is referenced by:  carddomi2  9399  cfeq0  9678  cfsuc  9679  sdom2en01  9724