![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cardidm | Structured version Visualization version GIF version |
Description: The cardinality function is idempotent. Proposition 10.11 of [TakeutiZaring] p. 85. (Contributed by Mario Carneiro, 7-Jan-2013.) |
Ref | Expression |
---|---|
cardidm | ⊢ (card‘(card‘𝐴)) = (card‘𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cardid2 10022 | . . . . . . . 8 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴) | |
2 | 1 | ensymd 9065 | . . . . . . 7 ⊢ (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴)) |
3 | entr 9066 | . . . . . . . 8 ⊢ ((𝑦 ≈ 𝐴 ∧ 𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴)) | |
4 | 3 | expcom 413 | . . . . . . 7 ⊢ (𝐴 ≈ (card‘𝐴) → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴))) |
5 | 2, 4 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴))) |
6 | entr 9066 | . . . . . . . 8 ⊢ ((𝑦 ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → 𝑦 ≈ 𝐴) | |
7 | 6 | expcom 413 | . . . . . . 7 ⊢ ((card‘𝐴) ≈ 𝐴 → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴)) |
8 | 1, 7 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴)) |
9 | 5, 8 | impbid 212 | . . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 ↔ 𝑦 ≈ (card‘𝐴))) |
10 | 9 | rabbidv 3451 | . . . 4 ⊢ (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) |
11 | 10 | inteqd 4975 | . . 3 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) |
12 | cardval3 10021 | . . 3 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴}) | |
13 | cardon 10013 | . . . 4 ⊢ (card‘𝐴) ∈ On | |
14 | oncardval 10024 | . . . 4 ⊢ ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) | |
15 | 13, 14 | mp1i 13 | . . 3 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) |
16 | 11, 12, 15 | 3eqtr4rd 2791 | . 2 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴)) |
17 | card0 10027 | . . 3 ⊢ (card‘∅) = ∅ | |
18 | ndmfv 6955 | . . . 4 ⊢ (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅) | |
19 | 18 | fveq2d 6924 | . . 3 ⊢ (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅)) |
20 | 17, 19, 18 | 3eqtr4a 2806 | . 2 ⊢ (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴)) |
21 | 16, 20 | pm2.61i 182 | 1 ⊢ (card‘(card‘𝐴)) = (card‘𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1537 ∈ wcel 2108 {crab 3443 ∅c0 4352 ∩ cint 4970 class class class wbr 5166 dom cdm 5700 Oncon0 6395 ‘cfv 6573 ≈ cen 9000 cardccrd 10004 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-ord 6398 df-on 6399 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-er 8763 df-en 9004 df-card 10008 |
This theorem is referenced by: oncard 10029 cardlim 10041 cardiun 10051 alephnbtwn2 10141 infenaleph 10160 dfac12k 10217 pwsdompw 10272 cardcf 10321 cfeq0 10325 cfflb 10328 alephval2 10641 cfpwsdom 10653 gch2 10744 tskcard 10850 hashcard 14404 iscard4 43495 |
Copyright terms: Public domain | W3C validator |