| 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 9898 | . . . 4 ⊢ card:{𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}⟶On | |
| 2 | 1 | fdmi 6699 | . . 3 ⊢ dom card = {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} |
| 3 | 2 | eleq2i 2853 | . 2 ⊢ (𝐴 ∈ dom card ↔ 𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦}) |
| 4 | relen 8928 | . . . . 5 ⊢ Rel ≈ | |
| 5 | 4 | brrelex2i 5702 | . . . 4 ⊢ (𝑥 ≈ 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | rexlimivw 3158 | . . 3 ⊢ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 → 𝐴 ∈ V) |
| 7 | breq2 5103 | . . . 4 ⊢ (𝑦 = 𝐴 → (𝑥 ≈ 𝑦 ↔ 𝑥 ≈ 𝐴)) | |
| 8 | 7 | rexbidv 3185 | . . 3 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ On 𝑥 ≈ 𝑦 ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)) |
| 9 | 6, 8 | elab3 3645 | . 2 ⊢ (𝐴 ∈ {𝑦 ∣ ∃𝑥 ∈ On 𝑥 ≈ 𝑦} ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) |
| 10 | 3, 9 | bitri 277 | 1 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 = wceq 1559 ∈ wcel 2141 {cab 2739 ∃wrex 3085 Vcvv 3453 class class class wbr 5099 dom cdm 5645 Oncon0 6342 ≈ cen 8920 cardccrd 9890 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-ord 6345 df-on 6346 df-fun 6519 df-fn 6520 df-f 6521 df-en 8924 df-card 9894 |
| This theorem is referenced by: isnumi 9901 ennum 9902 xpnum 9906 cardval3 9907 dfac10c 10092 isfin7-2 10350 numth2 10425 inawinalem 10644 |
| Copyright terms: Public domain | W3C validator |