MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cardidm Structured version   Visualization version   GIF version

Theorem cardidm 9912
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.
StepHypRef Expression
1 cardid2 9906 . . . . . . . 8 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
21ensymd 8976 . . . . . . 7 (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3 entr 8977 . . . . . . . 8 ((𝑦𝐴𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴))
43expcom 413 . . . . . . 7 (𝐴 ≈ (card‘𝐴) → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
52, 4syl 17 . . . . . 6 (𝐴 ∈ dom card → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
6 entr 8977 . . . . . . . 8 ((𝑦 ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → 𝑦𝐴)
76expcom 413 . . . . . . 7 ((card‘𝐴) ≈ 𝐴 → (𝑦 ≈ (card‘𝐴) → 𝑦𝐴))
81, 7syl 17 . . . . . 6 (𝐴 ∈ dom card → (𝑦 ≈ (card‘𝐴) → 𝑦𝐴))
95, 8impbid 212 . . . . 5 (𝐴 ∈ dom card → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
109rabbidv 3413 . . . 4 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1110inteqd 4915 . . 3 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
12 cardval3 9905 . . 3 (𝐴 ∈ dom card → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
13 cardon 9897 . . . 4 (card‘𝐴) ∈ On
14 oncardval 9908 . . . 4 ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1513, 14mp1i 13 . . 3 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1611, 12, 153eqtr4rd 2775 . 2 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
17 card0 9911 . . 3 (card‘∅) = ∅
18 ndmfv 6893 . . . 4 𝐴 ∈ dom card → (card‘𝐴) = ∅)
1918fveq2d 6862 . . 3 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅))
2017, 19, 183eqtr4a 2790 . 2 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
2116, 20pm2.61i 182 1 (card‘(card‘𝐴)) = (card‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1540  wcel 2109  {crab 3405  c0 4296   cint 4910   class class class wbr 5107  dom cdm 5638  Oncon0 6332  cfv 6511  cen 8915  cardccrd 9888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ord 6335  df-on 6336  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-er 8671  df-en 8919  df-card 9892
This theorem is referenced by:  oncard  9913  cardlim  9925  cardiun  9935  alephnbtwn2  10025  infenaleph  10044  dfac12k  10101  pwsdompw  10156  cardcf  10205  cfeq0  10209  cfflb  10212  alephval2  10525  cfpwsdom  10537  gch2  10628  tskcard  10734  hashcard  14320  iscard4  43522
  Copyright terms: Public domain W3C validator