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

Theorem cardval3 10043
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.)
Assertion
Ref Expression
cardval3 (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
Distinct variable group:   𝑥,𝐴

Proof of Theorem cardval3
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elex 3474 . 2 (𝐴 ∈ dom card → 𝐴 ∈ V)
2 isnum2 10036 . . . 4 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
3 rabn0 4341 . . . 4 ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
4 intex 5308 . . . 4 ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V)
52, 3, 43bitr2i 302 . . 3 (𝐴 ∈ dom card ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V)
65biimpi 219 . 2 (𝐴 ∈ dom card → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V)
7 breq2 5109 . . . . 5 (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴))
87rabbidv 3422 . . . 4 (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
98inteqd 4914 . . 3 (𝑦 = 𝐴 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
10 df-card 10030 . . 3 card = (𝑦 ∈ V ↦ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦})
119, 10fvmptg 6999 . 2 ((𝐴 ∈ V ∧ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V) → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
121, 6, 11syl2anc 596 1 (𝐴 ∈ dom card → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146   ≠ wne 2958  ∃wrex 3089  {crab 3415  Vcvv 3453  ∅c0 4280  ∩ cint 4909   class class class wbr 5105  dom cdm 5654  Oncon0 6368  ‘cfv 6546   ≈ cen 8981  cardccrd 10026
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394
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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-int 4910  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ord 6371  df-on 6372  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fv 6554  df-en 8985  df-card 10030
This theorem is used by:  cardid2  10044  oncardval  10046  cardidm  10050  cardne  10056  cardval  10640
  Copyright terms: Public domain W3C validator