Theorem cardval2 10072

Description: An alternate version of the value of the cardinal number of a set. Compare cardval 10630. This theorem could be used to give a simpler definition of card in place of df-card 10020. It apparently does not occur in the literature. (Contributed by NM, 7-Nov-2003.)

Assertion

Ref	Expression
cardval2	⊢ (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴})

Distinct variable group:   𝑥,𝐴

Proof of Theorem cardval2

Step	Hyp	Ref	Expression
1		cardon 10025	. . . . . 6 ⊢ (card‘𝐴) ∈ On
2	1	oneli 6478	. . . . 5 ⊢ (𝑥 ∈ (card‘𝐴) → 𝑥 ∈ On)
3	2	pm4.71ri 570	. . . 4 ⊢ (𝑥 ∈ (card‘𝐴) ↔ (𝑥 ∈ On ∧ 𝑥 ∈ (card‘𝐴)))
4		cardsdomel 10055	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝐴 ∈ dom card) → (𝑥 ≺ 𝐴 ↔ 𝑥 ∈ (card‘𝐴)))
5	4	ancoms 464	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝑥 ∈ On) → (𝑥 ≺ 𝐴 ↔ 𝑥 ∈ (card‘𝐴)))
6	5	pm5.32da 590	. . . 4 ⊢ (𝐴 ∈ dom card → ((𝑥 ∈ On ∧ 𝑥 ≺ 𝐴) ↔ (𝑥 ∈ On ∧ 𝑥 ∈ (card‘𝐴))))
7	3, 6	bitr4id 293	. . 3 ⊢ (𝐴 ∈ dom card → (𝑥 ∈ (card‘𝐴) ↔ (𝑥 ∈ On ∧ 𝑥 ≺ 𝐴)))
8	7	eqabdv 2894	. 2 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥 ≺ 𝐴)})
9		df-rab 3414	. 2 ⊢ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥 ≺ 𝐴)}
10	8, 9	eqtr4di 2814	1 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  {crab 3413   class class class wbr 5103  dom cdm 5651  Oncon0 6362  ‘cfv 6538   ≺ csdm 8972  cardccrd 10016

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6365  df-on 6366  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-card 10020

This theorem is used by:  ondomon  10647  alephsuc3  10665