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 38326
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 38323 . . . 4 ¬ (+∞ei‘𝑦) ∈ ℂ
21nex 1833 . . 3 ¬ ∃𝑦(+∞ei‘𝑦) ∈ ℂ
3 elin 4096 . . . . . 6 (𝑥 ∈ (ℂ ∩ ℂ∞) ↔ (𝑥 ∈ ℂ ∧ 𝑥 ∈ ℂ∞))
4 df-bj-inftyexpi 38320 . . . . . . . . . . 11 +∞ei = (𝑧 ∈ ( -π(,]π) ↦ ⟨𝑧, ℂ⟩)
54funmpt2 6599 . . . . . . . . . 10 Fun +∞ei
6 elrnrexdm 7113 . . . . . . . . . 10 (Fun +∞ei → (𝑥 ∈ ran +∞ei → ∃𝑦 ∈ dom +∞ei𝑥 = (+∞ei‘𝑦)))
75, 6ax-mp 5 . . . . . . . . 9 (𝑥 ∈ ran +∞ei → ∃𝑦 ∈ dom +∞ei𝑥 = (+∞ei‘𝑦))
8 rexex 3096 . . . . . . . . 9 (∃𝑦 ∈ dom +∞ei𝑥 = (+∞ei‘𝑦) → ∃𝑦 𝑥 = (+∞ei‘𝑦))
97, 8syl 18 . . . . . . . 8 (𝑥 ∈ ran +∞ei → ∃𝑦 𝑥 = (+∞ei‘𝑦))
10 df-bj-ccinfty 38325 . . . . . . . 8 ℂ∞ = ran +∞ei
119, 10eleq2s 2882 . . . . . . 7 (𝑥 ∈ ℂ∞ → ∃𝑦 𝑥 = (+∞ei‘𝑦))
1211anim2i 629 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑥 ∈ ℂ∞) → (𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)))
133, 12sylbi 220 . . . . 5 (𝑥 ∈ (ℂ ∩ ℂ∞) → (𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)))
14 ancom 466 . . . . . 6 ((𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)) ↔ (∃𝑦 𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
15 exancom 1894 . . . . . . 7 (∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) ↔ ∃𝑦(𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
16 19.41v 1984 . . . . . . 7 (∃𝑦(𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ) ↔ (∃𝑦 𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
1715, 16bitri 278 . . . . . 6 (∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) ↔ (∃𝑦 𝑥 = (+∞ei‘𝑦) ∧ 𝑥 ∈ ℂ))
1814, 17sylbb2 241 . . . . 5 ((𝑥 ∈ ℂ ∧ ∃𝑦 𝑥 = (+∞ei‘𝑦)) → ∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)))
1913, 18syl 18 . . . 4 (𝑥 ∈ (ℂ ∩ ℂ∞) → ∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)))
20 eleq1 2852 . . . . . 6 (𝑥 = (+∞ei‘𝑦) → (𝑥 ∈ ℂ ↔ (+∞ei‘𝑦) ∈ ℂ))
2120biimpac 484 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) → (+∞ei‘𝑦) ∈ ℂ)
2221eximi 1868 . . . 4 (∃𝑦(𝑥 ∈ ℂ ∧ 𝑥 = (+∞ei‘𝑦)) → ∃𝑦(+∞ei‘𝑦) ∈ ℂ)
2319, 22syl 18 . . 3 (𝑥 ∈ (ℂ ∩ ℂ∞) → ∃𝑦(+∞ei‘𝑦) ∈ ℂ)
242, 23mto 200 . 2 ¬ 𝑥 ∈ (ℂ ∩ ℂ∞)
2524nel0 4305 1 (ℂ ∩ ℂ∞) = ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃wrex 3090   ∩ cin 4092  ∅c0 4281  ⟨cop 4838  dom cdm 5655  ran crn 5656  Fun wfun 6552  ‘cfv 6558  (class class class)co 7443  ℂcc 11225   -cneg 11569  (,]cioc 13504  πcpi 16261  +∞eicinftyexpi 38319  ℂ∞cccinfty 38324
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775  ax-reg 9613  ax-cnex 11283
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fn 6561  df-fv 6566  df-c 11233  df-bj-inftyexpi 38320  df-bj-ccinfty 38325
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator