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

Theorem cardval3 10070
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 3475 . 2 (𝐴 ∈ dom card → 𝐴 ∈ V)
2 isnum2 10063 . . . 4 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
3 rabn0 4342 . . . 4 ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
4 intex 5312 . . . 4 ({𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V)
52, 3, 43bitr2i 302 . . 3 (𝐴 ∈ dom card ↔ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V)
65biimpi 219 . 2 (𝐴 ∈ dom card → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ∈ V)
7 breq2 5112 . . . . 5 (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴))
87rabbidv 3423 . . . 4 (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
98inteqd 4917 . . 3 (𝑦 = 𝐴 → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦} = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
10 df-card 10057 . . 3 card = (𝑦 ∈ V ↦ ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝑦})
119, 10fvmptg 7022 . 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 1570   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090  {crab 3416  Vcvv 3454  ∅c0 4281  ∩ cint 4912   class class class wbr 5108  dom cdm 5658  Oncon0 6388  ‘cfv 6566   ≈ cen 9008  cardccrd 10053
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-en 9012  df-card 10057
This theorem is used by:  cardid2  10071  oncardval  10073  cardidm  10077  cardne  10083  cardval  10669
  Copyright terms: Public domain W3C validator