Theorem bj-inftyexpidisj 37895

Description: An element of the circle at infinity is not a complex number. (Contributed by BJ, 22-Jun-2019.) This utility theorem is irrelevant and should generally not be used. (New usage is discouraged.)

Assertion

Ref	Expression
bj-inftyexpidisj	⊢ ¬ (+∞ei‘𝐴) ∈ ℂ

Proof of Theorem bj-inftyexpidisj

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeq1 4843	. . . . 5 ⊢ (𝑥 = 𝐴 → ⟨𝑥, ℂ⟩ = ⟨𝐴, ℂ⟩)
2		df-bj-inftyexpi 37892	. . . . 5 ⊢ +∞ei = (𝑥 ∈ (-π(,]π) ↦ ⟨𝑥, ℂ⟩)
3		opex 5450	. . . . 5 ⊢ ⟨𝐴, ℂ⟩ ∈ V
4	1, 2, 3	fvmpt 6996	. . . 4 ⊢ (𝐴 ∈ (-π(,]π) → (+∞ei‘𝐴) = ⟨𝐴, ℂ⟩)
5		opex 5450	. . . . 5 ⊢ ⟨𝑥, ℂ⟩ ∈ V
6	5, 2	dmmpti 6686	. . . 4 ⊢ dom +∞ei = (-π(,]π)
7	4, 6	eleq2s 2884	. . 3 ⊢ (𝐴 ∈ dom +∞ei → (+∞ei‘𝐴) = ⟨𝐴, ℂ⟩)
8		cnex 11199	. . . . . . 7 ⊢ ℂ ∈ V
9	8	prid2 4734	. . . . . 6 ⊢ ℂ ∈ {𝐴, ℂ}
10		eqid 2766	. . . . . . . 8 ⊢ {𝐴, ℂ} = {𝐴, ℂ}
11	10	olci 880	. . . . . . 7 ⊢ ({𝐴, ℂ} = {𝐴} ∨ {𝐴, ℂ} = {𝐴, ℂ})
12		elopg 5453	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ ℂ ∈ V) → ({𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩ ↔ ({𝐴, ℂ} = {𝐴} ∨ {𝐴, ℂ} = {𝐴, ℂ})))
13	8, 12	mpan2 704	. . . . . . 7 ⊢ (𝐴 ∈ V → ({𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩ ↔ ({𝐴, ℂ} = {𝐴} ∨ {𝐴, ℂ} = {𝐴, ℂ})))
14	11, 13	mpbiri 261	. . . . . 6 ⊢ (𝐴 ∈ V → {𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩)
15		en3lp 9593	. . . . . . 7 ⊢ ¬ (ℂ ∈ {𝐴, ℂ} ∧ {𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩ ∧ ⟨𝐴, ℂ⟩ ∈ ℂ)
16	15	bj-imn3ani 37221	. . . . . 6 ⊢ ((ℂ ∈ {𝐴, ℂ} ∧ {𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩) → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
17	9, 14, 16	sylancr 599	. . . . 5 ⊢ (𝐴 ∈ V → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
18		opprc1 4867	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → ⟨𝐴, ℂ⟩ = ∅)
19		0ncn 11136	. . . . . . 7 ⊢ ¬ ∅ ∈ ℂ
20		eleq1 2854	. . . . . . 7 ⊢ (⟨𝐴, ℂ⟩ = ∅ → (⟨𝐴, ℂ⟩ ∈ ℂ ↔ ∅ ∈ ℂ))
21	19, 20	mtbiri 330	. . . . . 6 ⊢ (⟨𝐴, ℂ⟩ = ∅ → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
22	18, 21	syl 18	. . . . 5 ⊢ (¬ 𝐴 ∈ V → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
23	17, 22	pm2.61i 184	. . . 4 ⊢ ¬ ⟨𝐴, ℂ⟩ ∈ ℂ
24		eqcom 2773	. . . . . 6 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ ↔ ⟨𝐴, ℂ⟩ = (+∞ei‘𝐴))
25	24	biimpi 219	. . . . 5 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ → ⟨𝐴, ℂ⟩ = (+∞ei‘𝐴))
26	25	eleq1d 2851	. . . 4 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ → (⟨𝐴, ℂ⟩ ∈ ℂ ↔ (+∞ei‘𝐴) ∈ ℂ))
27	23, 26	mtbii 329	. . 3 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ → ¬ (+∞ei‘𝐴) ∈ ℂ)
28	7, 27	syl 18	. 2 ⊢ (𝐴 ∈ dom +∞ei → ¬ (+∞ei‘𝐴) ∈ ℂ)
29		ndmfv 6920	. . . 4 ⊢ (¬ 𝐴 ∈ dom +∞ei → (+∞ei‘𝐴) = ∅)
30	29	eleq1d 2851	. . 3 ⊢ (¬ 𝐴 ∈ dom +∞ei → ((+∞ei‘𝐴) ∈ ℂ ↔ ∅ ∈ ℂ))
31	19, 30	mtbiri 330	. 2 ⊢ (¬ 𝐴 ∈ dom +∞ei → ¬ (+∞ei‘𝐴) ∈ ℂ)
32	28, 31	pm2.61i 184	1 ⊢ ¬ (+∞ei‘𝐴) ∈ ℂ

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2146  Vcvv 3458  ∅c0 4289  {csn 4594  {cpr 4596  ⟨cop 4600  dom cdm 5666  ‘cfv 6543  (class class class)co 7423  ℂcc 11116  -cneg 11460  (,]cioc 13391  πcpi 16145  +∞eⁱcinftyexpi 37891

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745  ax-reg 9564  ax-cnex 11174

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551  df-c 11124  df-bj-inftyexpi 37892

This theorem is used by:  bj-ccinftydisj  37898  bj-pinftynrr  37907  bj-minftynrr  37911