| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isnum2 | Structured version Visualization version GIF version | ||
| Description: A way to express well-orderability without bound or distinct variables. (Contributed by Stefan O'Rear, 28-Feb-2015.) (Revised by Mario Carneiro, 27-Apr-2015.) |
| Ref | Expression |
|---|---|
| isnum2 | ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cardf2 9917 | . . . 4 ⊢ card:{𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}⟶On | |
| 2 | 1 | fdmi 6707 | . . 3 ⊢ dom card = {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} |
| 3 | 2 | eleq2i 2857 | . 2 ⊢ (𝐴 ∈ dom card ↔ 𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}) |
| 4 | relen 8936 | . . . . 5 ⊢ Rel ≈ | |
| 5 | 4 | brrelex2i 5709 | . . . 4 ⊢ (𝑥 ≈ 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | rexlimivw 3162 | . . 3 ⊢ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 → 𝐴 ∈ V) |
| 7 | breq2 5109 | . . . 4 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴)) | |
| 8 | 7 | rexbidv 3189 | . . 3 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ On 𝑥 ≈ 𝑦 ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)) |
| 9 | 6, 8 | elab3 3648 | . 2 ⊢ (𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) |
| 10 | 3, 9 | bitri 278 | 1 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 = wceq 1563 ∈ wcel 2145 {cab 2743 ∃wrex 3089 Vcvv 3457 class class class wbr 5105 dom cdm 5652 Oncon0 6350 ≈ cen 8928 cardccrd 9909 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-ord 6353 df-on 6354 df-fun 6527 df-fn 6528 df-f 6529 df-en 8932 df-card 9913 |
| This theorem is referenced by: isnumi 9920 ennum 9921 xpnum 9925 cardval3 9926 dfac10c 10110 isfin7-2 10368 numth2 10443 inawinalem 10662 |
| Copyright terms: Public domain | W3C validator |