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

Theorem cardidm 10040
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 10034 . . . . . . . 8 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
21ensymd 9032 . . . . . . 7 (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3 entr 9033 . . . . . . . 8 ((𝑦 ≈ 𝐴 ∧ 𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴))
43expcom 419 . . . . . . 7 (𝐴 ≈ (card‘𝐴) → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴)))
52, 4syl 18 . . . . . 6 (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴)))
6 entr 9033 . . . . . . . 8 ((𝑦 ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → 𝑦 ≈ 𝐴)
76expcom 419 . . . . . . 7 ((card‘𝐴) ≈ 𝐴 → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴))
81, 7syl 18 . . . . . 6 (𝐴 ∈ dom card → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴))
95, 8impbid 215 . . . . 5 (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 ↔ 𝑦 ≈ (card‘𝐴)))
109rabbidv 3419 . . . 4 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1110inteqd 4911 . . 3 (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
12 cardval3 10033 . . 3 (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴})
13 cardon 10025 . . . 4 (card‘𝐴) ∈ On
14 oncardval 10036 . . . 4 ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1513, 14mp1i 14 . . 3 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1611, 12, 153eqtr4rd 2806 . 2 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
17 card0 10039 . . 3 (card‘∅) = ∅
18 ndmfv 6917 . . . 4 (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅)
1918fveq2d 6889 . . 3 (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅))
2017, 19, 183eqtr4a 2821 . 2 (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
2116, 20pm2.61i 184 1 (card‘(card‘𝐴)) = (card‘𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2144  {crab 3412  ∅c0 4278  ∩ cint 4906   class class class wbr 5102  dom cdm 5650  Oncon0 6362  ‘cfv 6538   ≈ cen 8970  cardccrd 10016
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  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 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-er 8717  df-en 8974  df-card 10020
This theorem is used by:  oncard  10041  cardlim  10053  cardiun  10063  alephnbtwn2  10151  infenaleph  10170  dfac12k  10226  pwsdompw  10281  cardcf  10329  cfeq0  10334  cfflb  10337  alephval2  10657  cfpwsdom  10669  gch2  10760  tskcard  10866  hashcard  14499  iscard4  44534
  Copyright terms: Public domain W3C validator