Theorem bj-inftyexpidisj 38099

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 4833	. . . . 5 ⊢ (𝑥 = 𝐴 → ⟨𝑥, ℂ⟩ = ⟨𝐴, ℂ⟩)
2		df-bj-inftyexpi 38096	. . . . 5 ⊢ +∞ei = (𝑥 ∈ (-π(,]π) ↦ ⟨𝑥, ℂ⟩)
3		opex 5432	. . . . 5 ⊢ ⟨𝐴, ℂ⟩ ∈ V
4	1, 2, 3	fvmpt 6985	. . . 4 ⊢ (𝐴 ∈ (-π(,]π) → (+∞ei‘𝐴) = ⟨𝐴, ℂ⟩)
5		opex 5432	. . . . 5 ⊢ ⟨𝑥, ℂ⟩ ∈ V
6	5, 2	dmmpti 6675	. . . 4 ⊢ dom +∞ei = (-π(,]π)
7	4, 6	eleq2s 2879	. . 3 ⊢ (𝐴 ∈ dom +∞ei → (+∞ei‘𝐴) = ⟨𝐴, ℂ⟩)
8		cnex 11262	. . . . . . 7 ⊢ ℂ ∈ V
9	8	prid2 4724	. . . . . 6 ⊢ ℂ ∈ {𝐴, ℂ}
10		eqid 2761	. . . . . . . 8 ⊢ {𝐴, ℂ} = {𝐴, ℂ}
11	10	olci 880	. . . . . . 7 ⊢ ({𝐴, ℂ} = {𝐴} ∨ {𝐴, ℂ} = {𝐴, ℂ})
12		elopg 5435	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ ℂ ∈ V) → ({𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩ ↔ ({𝐴, ℂ} = {𝐴} ∨ {𝐴, ℂ} = {𝐴, ℂ})))
13	8, 12	mpan2 704	. . . . . . 7 ⊢ (𝐴 ∈ V → ({𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩ ↔ ({𝐴, ℂ} = {𝐴} ∨ {𝐴, ℂ} = {𝐴, ℂ})))
14	11, 13	mpbiri 261	. . . . . 6 ⊢ (𝐴 ∈ V → {𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩)
15		en3lp 9599	. . . . . . 7 ⊢ ¬ (ℂ ∈ {𝐴, ℂ} ∧ {𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩ ∧ ⟨𝐴, ℂ⟩ ∈ ℂ)
16	15	bj-imn3ani 37427	. . . . . 6 ⊢ ((ℂ ∈ {𝐴, ℂ} ∧ {𝐴, ℂ} ∈ ⟨𝐴, ℂ⟩) → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
17	9, 14, 16	sylancr 599	. . . . 5 ⊢ (𝐴 ∈ V → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
18		opprc1 4857	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → ⟨𝐴, ℂ⟩ = ∅)
19		0ncn 11199	. . . . . . 7 ⊢ ¬ ∅ ∈ ℂ
20		eleq1 2849	. . . . . . 7 ⊢ (⟨𝐴, ℂ⟩ = ∅ → (⟨𝐴, ℂ⟩ ∈ ℂ ↔ ∅ ∈ ℂ))
21	19, 20	mtbiri 330	. . . . . 6 ⊢ (⟨𝐴, ℂ⟩ = ∅ → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
22	18, 21	syl 18	. . . . 5 ⊢ (¬ 𝐴 ∈ V → ¬ ⟨𝐴, ℂ⟩ ∈ ℂ)
23	17, 22	pm2.61i 184	. . . 4 ⊢ ¬ ⟨𝐴, ℂ⟩ ∈ ℂ
24		eqcom 2768	. . . . . 6 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ ↔ ⟨𝐴, ℂ⟩ = (+∞ei‘𝐴))
25	24	biimpi 219	. . . . 5 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ → ⟨𝐴, ℂ⟩ = (+∞ei‘𝐴))
26	25	eleq1d 2846	. . . 4 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ → (⟨𝐴, ℂ⟩ ∈ ℂ ↔ (+∞ei‘𝐴) ∈ ℂ))
27	23, 26	mtbii 329	. . 3 ⊢ ((+∞ei‘𝐴) = ⟨𝐴, ℂ⟩ → ¬ (+∞ei‘𝐴) ∈ ℂ)
28	7, 27	syl 18	. 2 ⊢ (𝐴 ∈ dom +∞ei → ¬ (+∞ei‘𝐴) ∈ ℂ)
29		ndmfv 6909	. . . 4 ⊢ (¬ 𝐴 ∈ dom +∞ei → (+∞ei‘𝐴) = ∅)
30	29	eleq1d 2846	. . 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 2145  Vcvv 3451  ∅c0 4279  {csn 4584  {cpr 4586  ⟨cop 4590  dom cdm 5651  ‘cfv 6531  (class class class)co 7412  ℂcc 11179  -cneg 11523  (,]cioc 13458  πcpi 16212  +∞eⁱcinftyexpi 38095

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740  ax-reg 9570  ax-cnex 11237

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539  df-c 11187  df-bj-inftyexpi 38096

This theorem is used by:  bj-ccinftydisj  38102  bj-pinftynrr  38111  bj-minftynrr  38115