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 8652 | . . . 4 ⊢ card:{𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}⟶On | |
2 | 1 | fdmi 5965 | . . 3 ⊢ dom card = {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} |
3 | 2 | eleq2i 2680 | . 2 ⊢ (𝐴 ∈ dom card ↔ 𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}) |
4 | relen 7846 | . . . . 5 ⊢ Rel ≈ | |
5 | 4 | brrelex2i 5083 | . . . 4 ⊢ (𝑥 ≈ 𝐴 → 𝐴 ∈ V) |
6 | 5 | rexlimivw 3011 | . . 3 ⊢ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 → 𝐴 ∈ V) |
7 | breq2 4587 | . . . 4 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴)) | |
8 | 7 | rexbidv 3034 | . . 3 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ On 𝑥 ≈ 𝑦 ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)) |
9 | 6, 8 | elab3 3327 | . 2 ⊢ (𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) |
10 | 3, 9 | bitri 263 | 1 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 = wceq 1475 ∈ wcel 1977 {cab 2596 ∃wrex 2897 Vcvv 3173 class class class wbr 4583 dom cdm 5038 Oncon0 5640 ≈ cen 7838 cardccrd 8644 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-ord 5643 df-on 5644 df-fun 5806 df-fn 5807 df-f 5808 df-en 7842 df-card 8648 |
This theorem is referenced by: isnumi 8655 ennum 8656 xpnum 8660 cardval3 8661 dfac10c 8843 isfin7-2 9101 numth2 9176 inawinalem 9390 |
Copyright terms: Public domain | W3C validator |