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

Theorem cardidm 9885
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 9879 . . . . . . . 8 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
21ensymd 8956 . . . . . . 7 (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3 entr 8957 . . . . . . . 8 ((𝑦𝐴𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴))
43expcom 413 . . . . . . 7 (𝐴 ≈ (card‘𝐴) → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
52, 4syl 17 . . . . . 6 (𝐴 ∈ dom card → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
6 entr 8957 . . . . . . . 8 ((𝑦 ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → 𝑦𝐴)
76expcom 413 . . . . . . 7 ((card‘𝐴) ≈ 𝐴 → (𝑦 ≈ (card‘𝐴) → 𝑦𝐴))
81, 7syl 17 . . . . . 6 (𝐴 ∈ dom card → (𝑦 ≈ (card‘𝐴) → 𝑦𝐴))
95, 8impbid 212 . . . . 5 (𝐴 ∈ dom card → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
109rabbidv 3408 . . . 4 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1110inteqd 4909 . . 3 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
12 cardval3 9878 . . 3 (𝐴 ∈ dom card → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
13 cardon 9870 . . . 4 (card‘𝐴) ∈ On
14 oncardval 9881 . . . 4 ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1513, 14mp1i 13 . . 3 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1611, 12, 153eqtr4rd 2783 . 2 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
17 card0 9884 . . 3 (card‘∅) = ∅
18 ndmfv 6876 . . . 4 𝐴 ∈ dom card → (card‘𝐴) = ∅)
1918fveq2d 6848 . . 3 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅))
2017, 19, 183eqtr4a 2798 . 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 1542  wcel 2114  {crab 3401  c0 4287   cint 4904   class class class wbr 5100  dom cdm 5634  Oncon0 6327  cfv 6502  cen 8894  cardccrd 9861
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ord 6330  df-on 6331  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-er 8647  df-en 8898  df-card 9865
This theorem is referenced by:  oncard  9886  cardlim  9898  cardiun  9908  alephnbtwn2  9996  infenaleph  10015  dfac12k  10072  pwsdompw  10127  cardcf  10176  cfeq0  10180  cfflb  10183  alephval2  10497  cfpwsdom  10509  gch2  10600  tskcard  10706  hashcard  14292  iscard4  43918
  Copyright terms: Public domain W3C validator