Theorem cardidm 10064

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 10058	. . . . . . . 8 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
2	1	ensymd 9057	. . . . . . 7 ⊢ (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3		entr 9058	. . . . . . . 8 ⊢ ((𝑦 ≈ 𝐴 ∧ 𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴))
4	3	expcom 419	. . . . . . 7 ⊢ (𝐴 ≈ (card‘𝐴) → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴)))
5	2, 4	syl 18	. . . . . 6 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴)))
6		entr 9058	. . . . . . . 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 3423	. . . 4 ⊢ (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
11	10	inteqd 4915	. . 3 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
12		cardval3 10057	. . 3 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴})
13		cardon 10049	. . . 4 ⊢ (card‘𝐴) ∈ On
14		oncardval 10060	. . . 4 ⊢ ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
15	13, 14	mp1i 14	. . 3 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
16	11, 12, 15	3eqtr4rd 2809	. 2 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
17		card0 10063	. . 3 ⊢ (card‘∅) = ∅
18		ndmfv 6937	. . . 4 ⊢ (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅)
19	18	fveq2d 6909	. . 3 ⊢ (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅))
20	17, 19, 18	3eqtr4a 2824	. 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 2147  {crab 3416  ∅c0 4281  ∩ cint 4910   class class class wbr 5106  dom cdm 5655  Oncon0 6377  ‘cfv 6555   ≈ cen 8995  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-er 8742  df-en 8999  df-card 10044

This theorem is used by:  oncard  10065  cardlim  10077  cardiun  10087  alephnbtwn2  10175  infenaleph  10194  dfac12k  10250  pwsdompw  10305  cardcf  10353  cfeq0  10358  cfflb  10361  alephval2  10681  cfpwsdom  10693  gch2  10784  tskcard  10890  hashcard  14523  iscard4  44724