ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnm GIF version

Theorem cnm 7826
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.)
Assertion
Ref Expression
cnm (𝐴 ∈ ℂ → ∃𝑥 𝑥𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem cnm
Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxpi 4640 . . 3 (𝐴 ∈ (R × R) → ∃𝑢𝑣(𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R)))
2 df-c 7812 . . 3 ℂ = (R × R)
31, 2eleq2s 2272 . 2 (𝐴 ∈ ℂ → ∃𝑢𝑣(𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R)))
4 vex 2740 . . . . . 6 𝑢 ∈ V
5 vex 2740 . . . . . 6 𝑣 ∈ V
6 opm 4232 . . . . . 6 (∃𝑥 𝑥 ∈ ⟨𝑢, 𝑣⟩ ↔ (𝑢 ∈ V ∧ 𝑣 ∈ V))
74, 5, 6mpbir2an 942 . . . . 5 𝑥 𝑥 ∈ ⟨𝑢, 𝑣
8 simprl 529 . . . . . . 7 ((𝐴 ∈ ℂ ∧ (𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R))) → 𝐴 = ⟨𝑢, 𝑣⟩)
98eleq2d 2247 . . . . . 6 ((𝐴 ∈ ℂ ∧ (𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R))) → (𝑥𝐴𝑥 ∈ ⟨𝑢, 𝑣⟩))
109exbidv 1825 . . . . 5 ((𝐴 ∈ ℂ ∧ (𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R))) → (∃𝑥 𝑥𝐴 ↔ ∃𝑥 𝑥 ∈ ⟨𝑢, 𝑣⟩))
117, 10mpbiri 168 . . . 4 ((𝐴 ∈ ℂ ∧ (𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R))) → ∃𝑥 𝑥𝐴)
1211ex 115 . . 3 (𝐴 ∈ ℂ → ((𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R)) → ∃𝑥 𝑥𝐴))
1312exlimdvv 1897 . 2 (𝐴 ∈ ℂ → (∃𝑢𝑣(𝐴 = ⟨𝑢, 𝑣⟩ ∧ (𝑢R𝑣R)) → ∃𝑥 𝑥𝐴))
143, 13mpd 13 1 (𝐴 ∈ ℂ → ∃𝑥 𝑥𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1353  wex 1492  wcel 2148  Vcvv 2737  cop 3595   × cxp 4622  Rcnr 7291  cc 7804
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4119  ax-pow 4172
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-opab 4063  df-xp 4630  df-c 7812
This theorem is referenced by:  axaddf  7862  axmulf  7863
  Copyright terms: Public domain W3C validator