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 9642 | . . . . . . . 8 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴) | |
2 | 1 | ensymd 8746 | . . . . . . 7 ⊢ (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴)) |
3 | entr 8747 | . . . . . . . 8 ⊢ ((𝑦 ≈ 𝐴 ∧ 𝐴 ≈ (card‘𝐴)) → 𝑦 ≈ (card‘𝐴)) | |
4 | 3 | expcom 413 | . . . . . . 7 ⊢ (𝐴 ≈ (card‘𝐴) → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴))) |
5 | 2, 4 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 → 𝑦 ≈ (card‘𝐴))) |
6 | entr 8747 | . . . . . . . 8 ⊢ ((𝑦 ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → 𝑦 ≈ 𝐴) | |
7 | 6 | expcom 413 | . . . . . . 7 ⊢ ((card‘𝐴) ≈ 𝐴 → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴)) |
8 | 1, 7 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ (card‘𝐴) → 𝑦 ≈ 𝐴)) |
9 | 5, 8 | impbid 211 | . . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ≈ 𝐴 ↔ 𝑦 ≈ (card‘𝐴))) |
10 | 9 | rabbidv 3404 | . . . 4 ⊢ (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) |
11 | 10 | inteqd 4881 | . . 3 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) |
12 | cardval3 9641 | . . 3 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐴}) | |
13 | cardon 9633 | . . . 4 ⊢ (card‘𝐴) ∈ On | |
14 | oncardval 9644 | . . . 4 ⊢ ((card‘𝐴) ∈ On → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) | |
15 | 13, 14 | mp1i 13 | . . 3 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ (card‘𝐴)}) |
16 | 11, 12, 15 | 3eqtr4rd 2789 | . 2 ⊢ (𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘𝐴)) |
17 | card0 9647 | . . 3 ⊢ (card‘∅) = ∅ | |
18 | ndmfv 6786 | . . . 4 ⊢ (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅) | |
19 | 18 | fveq2d 6760 | . . 3 ⊢ (¬ 𝐴 ∈ dom card → (card‘(card‘𝐴)) = (card‘∅)) |
20 | 17, 19, 18 | 3eqtr4a 2805 | . 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 1539 ∈ wcel 2108 {crab 3067 ∅c0 4253 ∩ cint 4876 class class class wbr 5070 dom cdm 5580 Oncon0 6251 ‘cfv 6418 ≈ cen 8688 cardccrd 9624 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-ord 6254 df-on 6255 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-er 8456 df-en 8692 df-card 9628 |
This theorem is referenced by: oncard 9649 cardlim 9661 cardiun 9671 alephnbtwn2 9759 infenaleph 9778 dfac12k 9834 pwsdompw 9891 cardcf 9939 cfeq0 9943 cfflb 9946 alephval2 10259 cfpwsdom 10271 gch2 10362 tskcard 10468 hashcard 13998 iscard4 41038 |
Copyright terms: Public domain | W3C validator |