Theorem cardidm 10011

Description: The cardinality function is idempotent. Proposition 10.11 of [TakeutiZaring] p. 85. (Contributed by Mario Carneiro, 7-Jan-2013.)

Assertion

Ref	Expression
cardidm	⊢ (card‘(card‘𝐴)) = (card‘𝐴)

Proof of Theorem cardidm

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cardid2 10005	. . . . . . . 8 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
2	1	ensymd 9010	. . . . . . 7 ⊢ (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3		entr 9011	. . . . . . . 8 ⊢ ((𝑦 ≈ 𝐴 ∧ 𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴))
4	3	expcom 419	. . . . . . 7 ⊢ (𝐴 ≈ (card‘𝐴) → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴)))
5	2, 4	syl 18	. . . . . 6 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴)))
6		entr 9011	. . . . . . . 8 ⊢ ((𝑦 ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → 𝑦 ≈ 𝐴)
7	6	expcom 419	. . . . . . 7 ⊢ ((card‘𝐴) ≈ 𝐴 → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴))
8	1, 7	syl 18	. . . . . 6 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴))
9	5, 8	impbid 215	. . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 ↔ 𝑦 ≈ (card‘𝐴)))
10	9	rabbidv 3419	. . . 4 ⊢ (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
11	10	inteqd 4911	. . 3 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
12		cardval3 10004	. . 3 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴})
13		cardon 9996	. . . 4 ⊢ (card‘𝐴) ∈ On
14		oncardval 10007	. . . 4 ⊢ ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
15	13, 14	mp1i 14	. . 3 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
16	11, 12, 15	3eqtr4rd 2806	. 2 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
17		card0 10010	. . 3 ⊢ (card‘∅) = ∅
18		ndmfv 6905	. . . 4 ⊢ (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅)
19	18	fveq2d 6877	. . 3 ⊢ (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅))
20	17, 19, 18	3eqtr4a 2821	. 2 ⊢ (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
21	16, 20	pm2.61i 184	1 ⊢ (card‘(card‘𝐴)) = (card‘𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3412  ∅c0 4278  ∩ cint 4906   class class class wbr 5102  dom cdm 5647  Oncon0 6351  ‘cfv 6527   ≈ cen 8948  cardccrd 9987

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-on 6355  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-er 8695  df-en 8952  df-card 9991

This theorem is used by:  oncard  10012  cardlim  10024  cardiun  10034  alephnbtwn2  10122  infenaleph  10141  dfac12k  10197  pwsdompw  10252  cardcf  10300  cfeq0  10305  cfflb  10308  alephval2  10628  cfpwsdom  10640  gch2  10731  tskcard  10837  hashcard  14466  iscard4  44477