| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnm | GIF version | ||
| Description: A complex number is an inhabited set. Note: do not use this after the real number axioms are developed, since it is a construction-dependent property. (Contributed by Jim Kingdon, 23-Oct-2023.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cnm | ⊢ (𝐴 ∈ ℂ → ∃𝑥 𝑥 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxpi 4747 | . . 3 ⊢ (𝐴 ∈ (R × R) → ∃𝑢∃𝑣(𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R))) | |
| 2 | df-c 8081 | . . 3 ⊢ ℂ = (R × R) | |
| 3 | 1, 2 | eleq2s 2326 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑢∃𝑣(𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R))) |
| 4 | vex 2806 | . . . . . 6 ⊢ 𝑢 ∈ V | |
| 5 | vex 2806 | . . . . . 6 ⊢ 𝑣 ∈ V | |
| 6 | opm 4332 | . . . . . 6 ⊢ (∃𝑥 𝑥 ∈ 〈𝑢, 𝑣〉 ↔ (𝑢 ∈ V ∧ 𝑣 ∈ V)) | |
| 7 | 4, 5, 6 | mpbir2an 951 | . . . . 5 ⊢ ∃𝑥 𝑥 ∈ 〈𝑢, 𝑣〉 |
| 8 | simprl 531 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R))) → 𝐴 = 〈𝑢, 𝑣〉) | |
| 9 | 8 | eleq2d 2301 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R))) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 〈𝑢, 𝑣〉)) |
| 10 | 9 | exbidv 1873 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R))) → (∃𝑥 𝑥 ∈ 𝐴 ↔ ∃𝑥 𝑥 ∈ 〈𝑢, 𝑣〉)) |
| 11 | 7, 10 | mpbiri 168 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R))) → ∃𝑥 𝑥 ∈ 𝐴) |
| 12 | 11 | ex 115 | . . 3 ⊢ (𝐴 ∈ ℂ → ((𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R)) → ∃𝑥 𝑥 ∈ 𝐴)) |
| 13 | 12 | exlimdvv 1946 | . 2 ⊢ (𝐴 ∈ ℂ → (∃𝑢∃𝑣(𝐴 = 〈𝑢, 𝑣〉 ∧ (𝑢 ∈ R ∧ 𝑣 ∈ R)) → ∃𝑥 𝑥 ∈ 𝐴)) |
| 14 | 3, 13 | mpd 13 | 1 ⊢ (𝐴 ∈ ℂ → ∃𝑥 𝑥 ∈ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∃wex 1541 ∈ wcel 2202 Vcvv 2803 〈cop 3676 × cxp 4729 Rcnr 7560 ℂcc 8073 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-opab 4156 df-xp 4737 df-c 8081 |
| This theorem is referenced by: axaddf 8131 axmulf 8132 |
| Copyright terms: Public domain | W3C validator |