Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cardval3 | Structured version Visualization version GIF version |
Description: An alternate definition of the value of (card‘𝐴) that does not require AC to prove. (Contributed by Mario Carneiro, 7-Jan-2013.) (Revised by Mario Carneiro, 27-Apr-2015.) |
Ref | Expression |
---|---|
cardval3 | ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3450 | . 2 ⊢ (𝐴 ∈ dom card → 𝐴 ∈ V) | |
2 | isnum2 9703 | . . . 4 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) | |
3 | rabn0 4319 | . . . 4 ⊢ ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) | |
4 | intex 5261 | . . . 4 ⊢ ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) | |
5 | 2, 3, 4 | 3bitr2i 299 | . . 3 ⊢ (𝐴 ∈ dom card ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) |
6 | 5 | biimpi 215 | . 2 ⊢ (𝐴 ∈ dom card → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) |
7 | breq2 5078 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴)) | |
8 | 7 | rabbidv 3414 | . . . 4 ⊢ (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
9 | 8 | inteqd 4884 | . . 3 ⊢ (𝑦 = 𝐴 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
10 | df-card 9697 | . . 3 ⊢ card = (𝑦 ∈ V ↦ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦}) | |
11 | 9, 10 | fvmptg 6873 | . 2 ⊢ ((𝐴 ∈ V ∧ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
12 | 1, 6, 11 | syl2anc 584 | 1 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∃wrex 3065 {crab 3068 Vcvv 3432 ∅c0 4256 ∩ cint 4879 class class class wbr 5074 dom cdm 5589 Oncon0 6266 ‘cfv 6433 ≈ cen 8730 cardccrd 9693 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-ord 6269 df-on 6270 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-fv 6441 df-en 8734 df-card 9697 |
This theorem is referenced by: cardid2 9711 oncardval 9713 cardidm 9717 cardne 9723 cardval 10302 |
Copyright terms: Public domain | W3C validator |