cnrefiisplem - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > cnrefiisplem		Structured version Visualization version GIF version

Theorem cnrefiisplem 40055

Description: Lemma for cnrefiisp 40056 (some local definitions are used). (Contributed by Glauco Siliprandi, 5-Feb-2022.)

**Hypotheses**
Ref	Expression
cnrefiisplem.a	⊢ (𝜑 → 𝐴 ∈ ℂ)
cnrefiisplem.n	⊢ (𝜑 → ¬ 𝐴 ∈ ℝ)
cnrefiisplem.b	⊢ (𝜑 → 𝐵 ∈ Fin)
cnrefiisplem.c	⊢ 𝐶 = (ℝ ∪ 𝐵)
cnrefiisplem.d	⊢ 𝐷 = ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))})
cnrefiisplem.x	⊢ 𝑋 = inf(𝐷, ℝ^*, < )

**Assertion**
Ref	Expression
cnrefiisplem	⊢ (𝜑 → ∃𝑥 ∈ ℝ⁺ ∀𝑦 ∈ 𝐶 ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑥 ≤ (abs‘(𝑦 − 𝐴))))

Distinct variable groups: 𝑦,𝐴,𝑥 𝑦,𝐵 𝑥,𝐶 𝑥,𝑋,𝑦 𝜑,𝑦 Allowed substitution hints: 𝜑(𝑥) 𝐵(𝑥) 𝐶(𝑦) 𝐷(𝑥,𝑦)

Proof of Theorem cnrefiisplem Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 477	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 = (abs‘(ℑ‘𝐴))) → 𝑤 = (abs‘(ℑ‘𝐴)))
2		cnrefiisplem.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ)
3		cnrefiisplem.n	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝐴 ∈ ℝ)
4	2, 3	absimnre 39707	. . . . . . . 8 ⊢ (𝜑 → (abs‘(ℑ‘𝐴)) ∈ ℝ⁺)
5	4	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 = (abs‘(ℑ‘𝐴))) → (abs‘(ℑ‘𝐴)) ∈ ℝ⁺)
6	1, 5	eqeltrd 2701	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 = (abs‘(ℑ‘𝐴))) → 𝑤 ∈ ℝ⁺)
7	6	adantlr 751	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝐷) ∧ 𝑤 = (abs‘(ℑ‘𝐴))) → 𝑤 ∈ ℝ⁺)
8		simpll 790	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝐷) ∧ 𝑤 ≠ (abs‘(ℑ‘𝐴))) → 𝜑)
9		cnrefiisplem.d	. . . . . . . . . . . 12 ⊢ 𝐷 = ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))})
10	9	eleq2i 2693	. . . . . . . . . . 11 ⊢ (𝑤 ∈ 𝐷 ↔ 𝑤 ∈ ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}))
11	10	biimpi 206	. . . . . . . . . 10 ⊢ (𝑤 ∈ 𝐷 → 𝑤 ∈ ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}))
12		nelsn 4212	. . . . . . . . . 10 ⊢ (𝑤 ≠ (abs‘(ℑ‘𝐴)) → ¬ 𝑤 ∈ {(abs‘(ℑ‘𝐴))})
13		elunnel1 3754	. . . . . . . . . 10 ⊢ ((𝑤 ∈ ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}) ∧ ¬ 𝑤 ∈ {(abs‘(ℑ‘𝐴))}) → 𝑤 ∈ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))})
14	11, 12, 13	syl2an 494	. . . . . . . . 9 ⊢ ((𝑤 ∈ 𝐷 ∧ 𝑤 ≠ (abs‘(ℑ‘𝐴))) → 𝑤 ∈ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))})
15		eliun 4524	. . . . . . . . 9 ⊢ (𝑤 ∈ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))} ↔ ∃𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})𝑤 ∈ {(abs‘(𝑦 − 𝐴))})
16	14, 15	sylib 208	. . . . . . . 8 ⊢ ((𝑤 ∈ 𝐷 ∧ 𝑤 ≠ (abs‘(ℑ‘𝐴))) → ∃𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})𝑤 ∈ {(abs‘(𝑦 − 𝐴))})
17		velsn 4193	. . . . . . . . 9 ⊢ (𝑤 ∈ {(abs‘(𝑦 − 𝐴))} ↔ 𝑤 = (abs‘(𝑦 − 𝐴)))
18	17	rexbii 3041	. . . . . . . 8 ⊢ (∃𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})𝑤 ∈ {(abs‘(𝑦 − 𝐴))} ↔ ∃𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})𝑤 = (abs‘(𝑦 − 𝐴)))
19	16, 18	sylib 208	. . . . . . 7 ⊢ ((𝑤 ∈ 𝐷 ∧ 𝑤 ≠ (abs‘(ℑ‘𝐴))) → ∃𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})𝑤 = (abs‘(𝑦 − 𝐴)))
20	19	adantll 750	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝐷) ∧ 𝑤 ≠ (abs‘(ℑ‘𝐴))) → ∃𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})𝑤 = (abs‘(𝑦 − 𝐴)))
21		simpr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → 𝑤 = (abs‘(𝑦 − 𝐴)))
22		eldifi 3732	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}) → 𝑦 ∈ (𝐵 ∩ ℂ))
23	22	elin2d 3803	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}) → 𝑦 ∈ ℂ)
24	23	ad2antlr 763	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → 𝑦 ∈ ℂ)
25	2	ad2antrr 762	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → 𝐴 ∈ ℂ)
26	24, 25	subcld 10392	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → (𝑦 − 𝐴) ∈ ℂ)
27		eldifsni 4320	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}) → 𝑦 ≠ 𝐴)
28	27	ad2antlr 763	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → 𝑦 ≠ 𝐴)
29	24, 25, 28	subne0d 10401	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → (𝑦 − 𝐴) ≠ 0)
30	26, 29	absrpcld 14187	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → (abs‘(𝑦 − 𝐴)) ∈ ℝ⁺)
31	21, 30	eqeltrd 2701	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})) ∧ 𝑤 = (abs‘(𝑦 − 𝐴))) → 𝑤 ∈ ℝ⁺)
32	31	rexlimdva2 39339	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴})𝑤 = (abs‘(𝑦 − 𝐴)) → 𝑤 ∈ ℝ⁺))
33	8, 20, 32	sylc 65	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝐷) ∧ 𝑤 ≠ (abs‘(ℑ‘𝐴))) → 𝑤 ∈ ℝ⁺)
34	7, 33	pm2.61dane 2881	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ∈ ℝ⁺)
35	34	ssd 39252	. . 3 ⊢ (𝜑 → 𝐷 ⊆ ℝ⁺)
36		cnrefiisplem.x	. . . 4 ⊢ 𝑋 = inf(𝐷, ℝ^*, < )
37		xrltso 11974	. . . . . 6 ⊢ < Or ℝ^*
38	37	a1i 11	. . . . 5 ⊢ (𝜑 → < Or ℝ^*)
39		snfi 8038	. . . . . . . 8 ⊢ {(abs‘(ℑ‘𝐴))} ∈ Fin
40	39	a1i 11	. . . . . . 7 ⊢ (𝜑 → {(abs‘(ℑ‘𝐴))} ∈ Fin)
41		cnrefiisplem.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ Fin)
42		inss1 3833	. . . . . . . . . . 11 ⊢ (𝐵 ∩ ℂ) ⊆ 𝐵
43	42	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 ∩ ℂ) ⊆ 𝐵)
44	43	ssdifssd 3748	. . . . . . . . 9 ⊢ (𝜑 → ((𝐵 ∩ ℂ) ∖ {𝐴}) ⊆ 𝐵)
45	41, 44	ssfid 8183	. . . . . . . 8 ⊢ (𝜑 → ((𝐵 ∩ ℂ) ∖ {𝐴}) ∈ Fin)
46		snfi 8038	. . . . . . . . 9 ⊢ {(abs‘(𝑦 − 𝐴))} ∈ Fin
47	46	rgenw 2924	. . . . . . . 8 ⊢ ∀𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))} ∈ Fin
48		iunfi 8254	. . . . . . . 8 ⊢ ((((𝐵 ∩ ℂ) ∖ {𝐴}) ∈ Fin ∧ ∀𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))} ∈ Fin) → ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))} ∈ Fin)
49	45, 47, 48	sylancl 694	. . . . . . 7 ⊢ (𝜑 → ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))} ∈ Fin)
50	40, 49	unfid 39345	. . . . . 6 ⊢ (𝜑 → ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}) ∈ Fin)
51	9, 50	syl5eqel 2705	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ Fin)
52		fvex 6201	. . . . . . . . . 10 ⊢ (abs‘(ℑ‘𝐴)) ∈ V
53	52	snid 4208	. . . . . . . . 9 ⊢ (abs‘(ℑ‘𝐴)) ∈ {(abs‘(ℑ‘𝐴))}
54		elun1 3780	. . . . . . . . 9 ⊢ ((abs‘(ℑ‘𝐴)) ∈ {(abs‘(ℑ‘𝐴))} → (abs‘(ℑ‘𝐴)) ∈ ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}))
55	53, 54	ax-mp 5	. . . . . . . 8 ⊢ (abs‘(ℑ‘𝐴)) ∈ ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))})
56	55, 9	eleqtrri 2700	. . . . . . 7 ⊢ (abs‘(ℑ‘𝐴)) ∈ 𝐷
57	56	a1i 11	. . . . . 6 ⊢ (𝜑 → (abs‘(ℑ‘𝐴)) ∈ 𝐷)
58	57	ne0d 39308	. . . . 5 ⊢ (𝜑 → 𝐷 ≠ ∅)
59		rpssxr 39711	. . . . . 6 ⊢ ℝ⁺ ⊆ ℝ^*
60	35, 59	syl6ss 3615	. . . . 5 ⊢ (𝜑 → 𝐷 ⊆ ℝ^*)
61		fiinfcl 8407	. . . . 5 ⊢ (( < Or ℝ^* ∧ (𝐷 ∈ Fin ∧ 𝐷 ≠ ∅ ∧ 𝐷 ⊆ ℝ^)) → inf(𝐷, ℝ^, < ) ∈ 𝐷)
62	38, 51, 58, 60, 61	syl13anc 1328	. . . 4 ⊢ (𝜑 → inf(𝐷, ℝ^*, < ) ∈ 𝐷)
63	36, 62	syl5eqel 2705	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
64	35, 63	sseldd 3604	. 2 ⊢ (𝜑 → 𝑋 ∈ ℝ⁺)
65	35, 62	sseldd 3604	. . . . . . . . . 10 ⊢ (𝜑 → inf(𝐷, ℝ^*, < ) ∈ ℝ⁺)
66	65	rpred 11872	. . . . . . . . 9 ⊢ (𝜑 → inf(𝐷, ℝ^*, < ) ∈ ℝ)
67	66	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → inf(𝐷, ℝ^*, < ) ∈ ℝ)
68	2	imcld 13935	. . . . . . . . . . 11 ⊢ (𝜑 → (ℑ‘𝐴) ∈ ℝ)
69	68	recnd 10068	. . . . . . . . . 10 ⊢ (𝜑 → (ℑ‘𝐴) ∈ ℂ)
70	69	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (ℑ‘𝐴) ∈ ℂ)
71	70	abscld 14175	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (abs‘(ℑ‘𝐴)) ∈ ℝ)
72		recn 10026	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
73	72	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ)
74	2	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝐴 ∈ ℂ)
75	73, 74	subcld 10392	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 − 𝐴) ∈ ℂ)
76	75	abscld 14175	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (abs‘(𝑦 − 𝐴)) ∈ ℝ)
77	60	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝐷 ⊆ ℝ^*)
78		infxrlb 12164	. . . . . . . . 9 ⊢ ((𝐷 ⊆ ℝ^* ∧ (abs‘(ℑ‘𝐴)) ∈ 𝐷) → inf(𝐷, ℝ^*, < ) ≤ (abs‘(ℑ‘𝐴)))
79	77, 56, 78	sylancl 694	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → inf(𝐷, ℝ^*, < ) ≤ (abs‘(ℑ‘𝐴)))
80		simpr 477	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ)
81	74, 80	absimlere 39710	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (abs‘(ℑ‘𝐴)) ≤ (abs‘(𝑦 − 𝐴)))
82	67, 71, 76, 79, 81	letrd 10194	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → inf(𝐷, ℝ^*, < ) ≤ (abs‘(𝑦 − 𝐴)))
83	36, 82	syl5eqbr 4688	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))
84	83	ad4ant14 1293	. . . . 5 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐶) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ 𝑦 ∈ ℝ) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))
85		cnrefiisplem.c	. . . . . . . . 9 ⊢ 𝐶 = (ℝ ∪ 𝐵)
86	85	eleq2i 2693	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ (ℝ ∪ 𝐵))
87		elunnel1 3754	. . . . . . . 8 ⊢ ((𝑦 ∈ (ℝ ∪ 𝐵) ∧ ¬ 𝑦 ∈ ℝ) → 𝑦 ∈ 𝐵)
88	86, 87	sylanb 489	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐶 ∧ ¬ 𝑦 ∈ ℝ) → 𝑦 ∈ 𝐵)
89	88	ad4ant24 1298	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐶) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ ¬ 𝑦 ∈ ℝ) → 𝑦 ∈ 𝐵)
90	60	ad2antrr 762	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ 𝑦 ∈ 𝐵) → 𝐷 ⊆ ℝ^*)
91		simpr 477	. . . . . . . . . . . . . . . 16 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
92		simpll 790	. . . . . . . . . . . . . . . 16 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ ℂ)
93	91, 92	elind 3798	. . . . . . . . . . . . . . 15 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ (𝐵 ∩ ℂ))
94		nelsn 4212	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ≠ 𝐴 → ¬ 𝑦 ∈ {𝐴})
95	94	ad2antlr 763	. . . . . . . . . . . . . . 15 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → ¬ 𝑦 ∈ {𝐴})
96	93, 95	eldifd 3585	. . . . . . . . . . . . . 14 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}))
97		fvex 6201	. . . . . . . . . . . . . . 15 ⊢ (abs‘(𝑦 − 𝐴)) ∈ V
98	97	snid 4208	. . . . . . . . . . . . . 14 ⊢ (abs‘(𝑦 − 𝐴)) ∈ {(abs‘(𝑦 − 𝐴))}
99		oveq1 6657	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = 𝑦 → (𝑤 − 𝐴) = (𝑦 − 𝐴))
100	99	fveq2d 6195	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = 𝑦 → (abs‘(𝑤 − 𝐴)) = (abs‘(𝑦 − 𝐴)))
101	100	sneqd 4189	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = 𝑦 → {(abs‘(𝑤 − 𝐴))} = {(abs‘(𝑦 − 𝐴))})
102	101	eliuni 4526	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}) ∧ (abs‘(𝑦 − 𝐴)) ∈ {(abs‘(𝑦 − 𝐴))}) → (abs‘(𝑦 − 𝐴)) ∈ ∪ 𝑤 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑤 − 𝐴))})
103	96, 98, 102	sylancl 694	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → (abs‘(𝑦 − 𝐴)) ∈ ∪ 𝑤 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑤 − 𝐴))})
104	101	cbviunv 4559	. . . . . . . . . . . . 13 ⊢ ∪ 𝑤 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑤 − 𝐴))} = ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}
105	103, 104	syl6eleq 2711	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → (abs‘(𝑦 − 𝐴)) ∈ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))})
106		elun2 3781	. . . . . . . . . . . 12 ⊢ ((abs‘(𝑦 − 𝐴)) ∈ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))} → (abs‘(𝑦 − 𝐴)) ∈ ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}))
107	105, 106	syl 17	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → (abs‘(𝑦 − 𝐴)) ∈ ({(abs‘(ℑ‘𝐴))} ∪ ∪ 𝑦 ∈ ((𝐵 ∩ ℂ) ∖ {𝐴}){(abs‘(𝑦 − 𝐴))}))
108	107, 9	syl6eleqr 2712	. . . . . . . . . 10 ⊢ (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) ∧ 𝑦 ∈ 𝐵) → (abs‘(𝑦 − 𝐴)) ∈ 𝐷)
109	108	adantll 750	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ 𝑦 ∈ 𝐵) → (abs‘(𝑦 − 𝐴)) ∈ 𝐷)
110		infxrlb 12164	. . . . . . . . 9 ⊢ ((𝐷 ⊆ ℝ^* ∧ (abs‘(𝑦 − 𝐴)) ∈ 𝐷) → inf(𝐷, ℝ^*, < ) ≤ (abs‘(𝑦 − 𝐴)))
111	90, 109, 110	syl2anc 693	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ 𝑦 ∈ 𝐵) → inf(𝐷, ℝ^*, < ) ≤ (abs‘(𝑦 − 𝐴)))
112	36, 111	syl5eqbr 4688	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ 𝑦 ∈ 𝐵) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))
113	112	adantllr 755	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐶) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ 𝑦 ∈ 𝐵) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))
114	89, 113	syldan 487	. . . . 5 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝐶) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) ∧ ¬ 𝑦 ∈ ℝ) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))
115	84, 114	pm2.61dan 832	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐶) ∧ (𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴)) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))
116	115	ex 450	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑋 ≤ (abs‘(𝑦 − 𝐴))))
117	116	ralrimiva 2966	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐶 ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑋 ≤ (abs‘(𝑦 − 𝐴))))
118		breq1 4656	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 ≤ (abs‘(𝑦 − 𝐴)) ↔ 𝑋 ≤ (abs‘(𝑦 − 𝐴))))
119	118	imbi2d 330	. . . 4 ⊢ (𝑥 = 𝑋 → (((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑥 ≤ (abs‘(𝑦 − 𝐴))) ↔ ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))))
120	119	ralbidv 2986	. . 3 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ 𝐶 ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑥 ≤ (abs‘(𝑦 − 𝐴))) ↔ ∀𝑦 ∈ 𝐶 ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))))
121	120	rspcev 3309	. 2 ⊢ ((𝑋 ∈ ℝ⁺ ∧ ∀𝑦 ∈ 𝐶 ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑋 ≤ (abs‘(𝑦 − 𝐴)))) → ∃𝑥 ∈ ℝ⁺ ∀𝑦 ∈ 𝐶 ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑥 ≤ (abs‘(𝑦 − 𝐴))))
122	64, 117, 121	syl2anc 693	1 ⊢ (𝜑 → ∃𝑥 ∈ ℝ⁺ ∀𝑦 ∈ 𝐶 ((𝑦 ∈ ℂ ∧ 𝑦 ≠ 𝐴) → 𝑥 ≤ (abs‘(𝑦 − 𝐴))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∃wrex 2913 ∖ cdif 3571 ∪ cun 3572 ∩ cin 3573 ⊆ wss 3574 ∅c0 3915 {csn 4177 ∪ ciun 4520 class class class wbr 4653 Or wor 5034 ‘cfv 5888 (class class class)co 6650 Fincfn 7955 infcinf 8347 ℂcc 9934 ℝcr 9935 ℝ^*cxr 10073 < clt 10074 ≤ cle 10075 − cmin 10266 ℝ⁺crp 11832 ℑcim 13838 abscabs 13974

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976

This theorem is referenced by: cnrefiisp 40056

W3C validator