| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cardval2 | Structured version Visualization version GIF version | ||
| Description: An alternate version of the value of the cardinal number of a set. Compare cardval 10555. This theorem could be used to give a simpler definition of card in place of df-card 9945. It apparently does not occur in the literature. (Contributed by NM, 7-Nov-2003.) |
| Ref | Expression |
|---|---|
| cardval2 | ⊢ (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cardon 9950 | . . . . . 6 ⊢ (card‘𝐴) ∈ On | |
| 2 | 1 | oneli 6473 | . . . . 5 ⊢ (𝑥 ∈ (card‘𝐴) → 𝑥 ∈ On) |
| 3 | 2 | pm4.71ri 570 | . . . 4 ⊢ (𝑥 ∈ (card‘𝐴) ↔ (𝑥 ∈ On ∧ 𝑥 ∈ (card‘𝐴))) |
| 4 | cardsdomel 9980 | . . . . . 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 2893 | . 2 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥 ≺ 𝐴)}) |
| 9 | df-rab 3413 | . 2 ⊢ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} = {𝑥 ∣ (𝑥 ∈ On ∧ 𝑥 ≺ 𝐴)} | |
| 10 | 8, 9 | eqtr4di 2813 | 1 ⊢ (𝐴 ∈ dom card → (card‘𝐴) = {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {cab 2738 {crab 3412 class class class wbr 5103 dom cdm 5655 Oncon0 6357 ‘cfv 6533 ≺ csdm 8952 cardccrd 9941 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6360 df-on 6361 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-card 9945 |
| This theorem is used by: ondomon 10572 alephsuc3 10590 |
| Copyright terms: Public domain | W3C validator |