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

Theorem cardval3 9934
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 3476 . 2 (𝐴 ∈ dom card → 𝐴 ∈ V)
2 isnum2 9927 . . . 4 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥𝐴)
3 rabn0 4346 . . . 4 ({𝑥 ∈ On ∣ 𝑥𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥𝐴)
4 intex 5314 . . . 4 ({𝑥 ∈ On ∣ 𝑥𝐴} ≠ ∅ ↔ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
52, 3, 43bitr2i 302 . . 3 (𝐴 ∈ dom card ↔ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
65biimpi 219 . 2 (𝐴 ∈ dom card → {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V)
7 breq2 5113 . . . . 5 (𝑦 = 𝐴 → (𝑥𝑦𝑥𝐴))
87rabbidv 3423 . . . 4 (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥𝑦} = {𝑥 ∈ On ∣ 𝑥𝐴})
98inteqd 4917 . . 3 (𝑦 = 𝐴 {𝑥 ∈ On ∣ 𝑥𝑦} = {𝑥 ∈ On ∣ 𝑥𝐴})
10 df-card 9921 . . 3 card = (𝑦 ∈ V ↦ {𝑥 ∈ On ∣ 𝑥𝑦})
119, 10fvmptg 6987 . 2 ((𝐴 ∈ V ∧ {𝑥 ∈ On ∣ 𝑥𝐴} ∈ V) → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥𝐴})
121, 6, 11syl2anc 595 1 (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥𝐴})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  wne 2958  wrex 3089  {crab 3416  Vcvv 3455  c0 4286   cint 4912   class class class wbr 5109  dom cdm 5661  Oncon0 6360  cfv 6536  cen 8936  cardccrd 9917
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  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 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-en 8940  df-card 9921
This theorem is referenced by:  cardid2  9935  oncardval  9937  cardidm  9941  cardne  9947  cardval  10525
  Copyright terms: Public domain W3C validator