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

Theorem cardidm 8785
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 8779 . . . . . . . 8 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
21ensymd 8007 . . . . . . 7 (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3 entr 8008 . . . . . . . 8 ((𝑦𝐴𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴))
43expcom 451 . . . . . . 7 (𝐴 ≈ (card‘𝐴) → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
52, 4syl 17 . . . . . 6 (𝐴 ∈ dom card → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
6 entr 8008 . . . . . . . 8 ((𝑦 ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → 𝑦𝐴)
76expcom 451 . . . . . . 7 ((card‘𝐴) ≈ 𝐴 → (𝑦 ≈ (card‘𝐴) → 𝑦𝐴))
81, 7syl 17 . . . . . 6 (𝐴 ∈ dom card → (𝑦 ≈ (card‘𝐴) → 𝑦𝐴))
95, 8impbid 202 . . . . 5 (𝐴 ∈ dom card → (𝑦𝐴𝑦 ≈ (card‘𝐴)))
109rabbidv 3189 . . . 4 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1110inteqd 4480 . . 3 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
12 cardval3 8778 . . 3 (𝐴 ∈ dom card → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
13 cardon 8770 . . . 4 (card‘𝐴) ∈ On
14 oncardval 8781 . . . 4 ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1513, 14mp1i 13 . . 3 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)})
1611, 12, 153eqtr4rd 2667 . 2 (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
17 card0 8784 . . 3 (card‘∅) = ∅
18 ndmfv 6218 . . . 4 𝐴 ∈ dom card → (card‘𝐴) = ∅)
1918fveq2d 6195 . . 3 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅))
2017, 19, 183eqtr4a 2682 . 2 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴))
2116, 20pm2.61i 176 1 (card‘(card‘𝐴)) = (card‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1483  wcel 1990  {crab 2916  c0 3915   cint 4475   class class class wbr 4653  dom cdm 5114  Oncon0 5723  cfv 5888  cen 7952  cardccrd 8761
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-er 7742  df-en 7956  df-card 8765
This theorem is referenced by:  oncard  8786  cardlim  8798  cardiun  8808  alephnbtwn2  8895  infenaleph  8914  dfac12k  8969  pwsdompw  9026  cardcf  9074  cfeq0  9078  cfflb  9081  alephval2  9394  cfpwsdom  9406  gch2  9497  tskcard  9603  hashcard  13146
  Copyright terms: Public domain W3C validator