Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-ccinftydisj Structured version   Visualization version   GIF version

Theorem bj-ccinftydisj 38210
Description: The circle at infinity is disjoint from the set of complex numbers. (Contributed by BJ, 22-Jun-2019.)
Assertion
Ref Expression
bj-ccinftydisj (ℂ ∩ ℂ∞) = ∅

Proof of Theorem bj-ccinftydisj
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bj-inftyexpidisj 38207 . . . 4 ¬ (+∞ei‘𝑦) ∈ ℂ
21nex 1832 . . 3 ¬ ∃𝑦(+∞ei‘𝑦) ∈ ℂ
3 elin 4093 . . . . . 6 (𝑥 ∈ (ℂ ∩ ℂ∞) ↔ (𝑥 ∈ ℂ ∧ 𝑥 ∈ ℂ∞))
4 df-bj-inftyexpi 38204 . . . . . . . . . . 11 +∞ei = (𝑧 ∈ ( -π(,]π) ↦ ⟨𝑧, ℂ⟩)
54funmpt2 6579 . . . . . . . . . 10 Fun +∞ei
6 elrnrexdm 7089 . . . . . . . . . 10 (Fun +∞ei → (𝑥 ∈ ran +∞ei → ∃𝑦 ∈ dom +∞ei𝑥 = (+∞ei‘𝑦)))
75, 6ax-mp 5 . . . . . . . . 9 (𝑥 ∈ ran +∞ei → ∃𝑦 ∈ dom +∞ei𝑥 = (+∞ei‘𝑦))
8 rexex 3092 . . . . . . . . 9 (∃𝑦 ∈ dom +∞ei𝑥 = (+∞ei‘𝑦) → ∃𝑦 𝑥 = (+∞ei‘𝑦))
97, 8syl 18 . . . . . . . 8 (𝑥 ∈ ran +∞ei → ∃𝑦 𝑥 = (+∞ei‘𝑦))
10 df-bj-ccinfty 38209 . . . . . . . 8 ℂ∞ = ran +∞ei
119, 10eleq2s 2878 . . . . . . 7 (𝑥 ∈ ℂ∞ → ∃𝑦 𝑥 = (+∞ei‘𝑦))
1211anim2i 629 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑥 ∈ ℂ∞) → (𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)))
133, 12sylbi 220 . . . . 5 (𝑥 ∈ (ℂ ∩ ℂ∞) → (𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)))
14 ancom 466 . . . . . 6 ((𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)) ↔ (∃𝑦 𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
15 exancom 1893 . . . . . . 7 (∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) ↔ ∃𝑦(𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
16 19.41v 1981 . . . . . . 7 (∃𝑦(𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ) ↔ (∃𝑦 𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
1715, 16bitri 278 . . . . . 6 (∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) ↔ (∃𝑦 𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
1814, 17sylbb2 241 . . . . 5 ((𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)) → ∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)))
1913, 18syl 18 . . . 4 (𝑥 ∈ (ℂ ∩ ℂ∞) → ∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)))
20 eleq1 2848 . . . . . 6 (𝑥 = (+∞ei‘𝑦) → (𝑥 ∈ ℂ ↔ (+∞ei‘𝑦) ∈ ℂ))
2120biimpac 484 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) → (+∞ei‘𝑦) ∈ ℂ)
2221eximi 1867 . . . 4 (∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) → ∃𝑦(+∞ei‘𝑦) ∈ ℂ)
2319, 22syl 18 . . 3 (𝑥 ∈ (ℂ ∩ ℂ∞) → ∃𝑦(+∞ei‘𝑦) ∈ ℂ)
242, 23mto 200 . 2 ¬ 𝑥 ∈ (ℂ ∩ ℂ∞)
2524nel0 4301 1 (ℂ ∩ ℂ∞) = ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086   ∩ cin 4089  ∅c0 4278  ⟨cop 4589  dom cdm 5650  ran crn 5651  Fun wfun 6532  ‘cfv 6538  (class class class)co 7420  ℂcc 11199   -cneg 11543  (,]cioc 13478  πcpi 16233  +∞eicinftyexpi 38203  ℂ∞cccinfty 38208
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751  ax-reg 9587  ax-cnex 11257
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546  df-c 11207  df-bj-inftyexpi 38204  df-bj-ccinfty 38209
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator