Theorem constrcccllem 33720

Description: Constructible numbers are closed under circle-circle intersections. (Contributed by Thierry Arnoux, 2-Nov-2025.)

Hypotheses

Ref	Expression
constr0.1	⊢ 𝐶 = rec((𝑠 ∈ V ↦ {𝑥 ∈ ℂ ∣ (∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑡 ∈ ℝ ∃𝑟 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ 𝑥 = (𝑐 + (𝑟 · (𝑑 − 𝑐))) ∧ (ℑ‘((∗‘(𝑏 − 𝑎)) · (𝑑 − 𝑐))) ≠ 0) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 ∃𝑡 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ (abs‘(𝑥 − 𝑐)) = (abs‘(𝑒 − 𝑓))) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 (𝑎 ≠ 𝑑 ∧ (abs‘(𝑥 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑥 − 𝑑)) = (abs‘(𝑒 − 𝑓))))}), {0, 1})
constrcccllem.a	⊢ (𝜑 → 𝐴 ∈ Constr)
constrcccllem.b	⊢ (𝜑 → 𝐵 ∈ Constr)
constrcccllem.c	⊢ (𝜑 → 𝐺 ∈ Constr)
constrcccllem.d	⊢ (𝜑 → 𝐷 ∈ Constr)
constrcccllem.e	⊢ (𝜑 → 𝐸 ∈ Constr)
constrcccllem.f	⊢ (𝜑 → 𝐹 ∈ Constr)
constrcccllem.x	⊢ (𝜑 → 𝑋 ∈ ℂ)
constrcccllem.1	⊢ (𝜑 → 𝐴 ≠ 𝐷)
constrcccllem.2	⊢ (𝜑 → (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)))
constrcccllem.3	⊢ (𝜑 → (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝐹)))

Assertion

Ref	Expression
constrcccllem	⊢ (𝜑 → 𝑋 ∈ Constr)

Distinct variable groups:   𝐴,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓,𝑠,𝑡,𝑥   𝐵,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓,𝑠,𝑡,𝑥   𝐶,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓,𝑠,𝑡,𝑥   𝐷,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓,𝑠,𝑡,𝑥   𝐸,𝑎,𝑏,𝑐,𝑒,𝑓,𝑠,𝑡,𝑥   𝐹,𝑎,𝑏,𝑐,𝑒,𝑓,𝑠,𝑡,𝑥   𝐺,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓,𝑠,𝑡,𝑥   𝑋,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓,𝑟,𝑡   𝑠,𝑟,𝑥   𝜑,𝑎,𝑏,𝑐,𝑒,𝑓,𝑠,𝑡,𝑥

Allowed substitution hints:   𝜑(𝑟,𝑑)   𝐴(𝑟)   𝐵(𝑟)   𝐶(𝑟)   𝐷(𝑟)   𝐸(𝑟,𝑑)   𝐹(𝑟,𝑑)   𝐺(𝑟)   𝑋(𝑥,𝑠)

Proof of Theorem constrcccllem

Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano2b 7823	. . . . . 6 ⊢ (𝑛 ∈ ω ↔ suc 𝑛 ∈ ω)
2	1	biimpi 216	. . . . 5 ⊢ (𝑛 ∈ ω → suc 𝑛 ∈ ω)
3	2	ad2antlr 727	. . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → suc 𝑛 ∈ ω)
4		fveq2 6826	. . . . . 6 ⊢ (𝑚 = suc 𝑛 → (𝐶‘𝑚) = (𝐶‘suc 𝑛))
5	4	eleq2d 2814	. . . . 5 ⊢ (𝑚 = suc 𝑛 → (𝑋 ∈ (𝐶‘𝑚) ↔ 𝑋 ∈ (𝐶‘suc 𝑛)))
6	5	adantl 481	. . . 4 ⊢ ((((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) ∧ 𝑚 = suc 𝑛) → (𝑋 ∈ (𝐶‘𝑚) ↔ 𝑋 ∈ (𝐶‘suc 𝑛)))
7		constrcccllem.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ ℂ)
8	7	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝑋 ∈ ℂ)
9		neeq1 2987	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → (𝑎 ≠ 𝑑 ↔ 𝐴 ≠ 𝑑))
10		oveq2 7361	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐴 → (𝑋 − 𝑎) = (𝑋 − 𝐴))
11	10	fveq2d 6830	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (abs‘(𝑋 − 𝑎)) = (abs‘(𝑋 − 𝐴)))
12	11	eqeq1d 2731	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → ((abs‘(𝑋 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ↔ (abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐))))
13	9, 12	3anbi12d 1439	. . . . . . . . 9 ⊢ (𝑎 = 𝐴 → ((𝑎 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ (𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
14	13	rexbidv 3153	. . . . . . . 8 ⊢ (𝑎 = 𝐴 → (∃𝑓 ∈ (𝐶‘𝑛)(𝑎 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ ∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
15	14	2rexbidv 3194	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝑎 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ ∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
16		oveq1 7360	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝐵 → (𝑏 − 𝑐) = (𝐵 − 𝑐))
17	16	fveq2d 6830	. . . . . . . . . . 11 ⊢ (𝑏 = 𝐵 → (abs‘(𝑏 − 𝑐)) = (abs‘(𝐵 − 𝑐)))
18	17	eqeq2d 2740	. . . . . . . . . 10 ⊢ (𝑏 = 𝐵 → ((abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐)) ↔ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐))))
19	18	3anbi2d 1443	. . . . . . . . 9 ⊢ (𝑏 = 𝐵 → ((𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ (𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
20	19	rexbidv 3153	. . . . . . . 8 ⊢ (𝑏 = 𝐵 → (∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ ∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
21	20	2rexbidv 3194	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ ∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
22		oveq2 7361	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝐺 → (𝐵 − 𝑐) = (𝐵 − 𝐺))
23	22	fveq2d 6830	. . . . . . . . . . 11 ⊢ (𝑐 = 𝐺 → (abs‘(𝐵 − 𝑐)) = (abs‘(𝐵 − 𝐺)))
24	23	eqeq2d 2740	. . . . . . . . . 10 ⊢ (𝑐 = 𝐺 → ((abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐)) ↔ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺))))
25	24	3anbi2d 1443	. . . . . . . . 9 ⊢ (𝑐 = 𝐺 → ((𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ (𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
26	25	rexbidv 3153	. . . . . . . 8 ⊢ (𝑐 = 𝐺 → (∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ ∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
27	26	2rexbidv 3194	. . . . . . 7 ⊢ (𝑐 = 𝐺 → (∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ ∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
28		constrcccllem.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ Constr)
29	28	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐴 ∈ Constr)
30		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛))
31	30	unssad 4146	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → {𝐴, 𝐵, 𝐺} ⊆ (𝐶‘𝑛))
32	29, 31	tpssad 32501	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐴 ∈ (𝐶‘𝑛))
33		constrcccllem.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ Constr)
34	33	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐵 ∈ Constr)
35	34, 31	tpssbd 32502	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐵 ∈ (𝐶‘𝑛))
36		constrcccllem.c	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ Constr)
37	36	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐺 ∈ Constr)
38	37, 31	tpsscd 32503	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐺 ∈ (𝐶‘𝑛))
39		neeq2 2988	. . . . . . . . 9 ⊢ (𝑑 = 𝐷 → (𝐴 ≠ 𝑑 ↔ 𝐴 ≠ 𝐷))
40		oveq2 7361	. . . . . . . . . . 11 ⊢ (𝑑 = 𝐷 → (𝑋 − 𝑑) = (𝑋 − 𝐷))
41	40	fveq2d 6830	. . . . . . . . . 10 ⊢ (𝑑 = 𝐷 → (abs‘(𝑋 − 𝑑)) = (abs‘(𝑋 − 𝐷)))
42	41	eqeq1d 2731	. . . . . . . . 9 ⊢ (𝑑 = 𝐷 → ((abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)) ↔ (abs‘(𝑋 − 𝐷)) = (abs‘(𝑒 − 𝑓))))
43	39, 42	3anbi13d 1440	. . . . . . . 8 ⊢ (𝑑 = 𝐷 → ((𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))) ↔ (𝐴 ≠ 𝐷 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝐷)) = (abs‘(𝑒 − 𝑓)))))
44		oveq1 7360	. . . . . . . . . . 11 ⊢ (𝑒 = 𝐸 → (𝑒 − 𝑓) = (𝐸 − 𝑓))
45	44	fveq2d 6830	. . . . . . . . . 10 ⊢ (𝑒 = 𝐸 → (abs‘(𝑒 − 𝑓)) = (abs‘(𝐸 − 𝑓)))
46	45	eqeq2d 2740	. . . . . . . . 9 ⊢ (𝑒 = 𝐸 → ((abs‘(𝑋 − 𝐷)) = (abs‘(𝑒 − 𝑓)) ↔ (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝑓))))
47	46	3anbi3d 1444	. . . . . . . 8 ⊢ (𝑒 = 𝐸 → ((𝐴 ≠ 𝐷 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝐷)) = (abs‘(𝑒 − 𝑓))) ↔ (𝐴 ≠ 𝐷 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝑓)))))
48		oveq2 7361	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → (𝐸 − 𝑓) = (𝐸 − 𝐹))
49	48	fveq2d 6830	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (abs‘(𝐸 − 𝑓)) = (abs‘(𝐸 − 𝐹)))
50	49	eqeq2d 2740	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝑓)) ↔ (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝐹))))
51	50	3anbi3d 1444	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝐴 ≠ 𝐷 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝑓))) ↔ (𝐴 ≠ 𝐷 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝐹)))))
52		constrcccllem.d	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ Constr)
53	52	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐷 ∈ Constr)
54	30	unssbd 4147	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → {𝐷, 𝐸, 𝐹} ⊆ (𝐶‘𝑛))
55	53, 54	tpssad 32501	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐷 ∈ (𝐶‘𝑛))
56		constrcccllem.e	. . . . . . . . . 10 ⊢ (𝜑 → 𝐸 ∈ Constr)
57	56	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐸 ∈ Constr)
58	57, 54	tpssbd 32502	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐸 ∈ (𝐶‘𝑛))
59		constrcccllem.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ Constr)
60	59	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐹 ∈ Constr)
61	60, 54	tpsscd 32503	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐹 ∈ (𝐶‘𝑛))
62		constrcccllem.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ≠ 𝐷)
63	62	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝐴 ≠ 𝐷)
64		constrcccllem.2	. . . . . . . . . 10 ⊢ (𝜑 → (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)))
65	64	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)))
66		constrcccllem.3	. . . . . . . . . 10 ⊢ (𝜑 → (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝐹)))
67	66	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝐹)))
68	63, 65, 67	3jca 1128	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → (𝐴 ≠ 𝐷 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝐷)) = (abs‘(𝐸 − 𝐹))))
69	43, 47, 51, 55, 58, 61, 68	3rspcedvdw 3597	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → ∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝐴 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝐴)) = (abs‘(𝐵 − 𝐺)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))))
70	15, 21, 27, 32, 35, 38, 69	3rspcedvdw 3597	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → ∃𝑎 ∈ (𝐶‘𝑛)∃𝑏 ∈ (𝐶‘𝑛)∃𝑐 ∈ (𝐶‘𝑛)∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝑎 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓))))
71	70	3mix3d 1339	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → (∃𝑎 ∈ (𝐶‘𝑛)∃𝑏 ∈ (𝐶‘𝑛)∃𝑐 ∈ (𝐶‘𝑛)∃𝑑 ∈ (𝐶‘𝑛)∃𝑡 ∈ ℝ ∃𝑟 ∈ ℝ (𝑋 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ 𝑋 = (𝑐 + (𝑟 · (𝑑 − 𝑐))) ∧ (ℑ‘((∗‘(𝑏 − 𝑎)) · (𝑑 − 𝑐))) ≠ 0) ∨ ∃𝑎 ∈ (𝐶‘𝑛)∃𝑏 ∈ (𝐶‘𝑛)∃𝑐 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)∃𝑡 ∈ ℝ (𝑋 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ (abs‘(𝑋 − 𝑐)) = (abs‘(𝑒 − 𝑓))) ∨ ∃𝑎 ∈ (𝐶‘𝑛)∃𝑏 ∈ (𝐶‘𝑛)∃𝑐 ∈ (𝐶‘𝑛)∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝑎 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))
72		constr0.1	. . . . . 6 ⊢ 𝐶 = rec((𝑠 ∈ V ↦ {𝑥 ∈ ℂ ∣ (∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑡 ∈ ℝ ∃𝑟 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ 𝑥 = (𝑐 + (𝑟 · (𝑑 − 𝑐))) ∧ (ℑ‘((∗‘(𝑏 − 𝑎)) · (𝑑 − 𝑐))) ≠ 0) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 ∃𝑡 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ (abs‘(𝑥 − 𝑐)) = (abs‘(𝑒 − 𝑓))) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 (𝑎 ≠ 𝑑 ∧ (abs‘(𝑥 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑥 − 𝑑)) = (abs‘(𝑒 − 𝑓))))}), {0, 1})
73		nnon 7812	. . . . . . 7 ⊢ (𝑛 ∈ ω → 𝑛 ∈ On)
74	73	ad2antlr 727	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝑛 ∈ On)
75		eqid 2729	. . . . . 6 ⊢ (𝐶‘𝑛) = (𝐶‘𝑛)
76	72, 74, 75	constrsuc 33704	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → (𝑋 ∈ (𝐶‘suc 𝑛) ↔ (𝑋 ∈ ℂ ∧ (∃𝑎 ∈ (𝐶‘𝑛)∃𝑏 ∈ (𝐶‘𝑛)∃𝑐 ∈ (𝐶‘𝑛)∃𝑑 ∈ (𝐶‘𝑛)∃𝑡 ∈ ℝ ∃𝑟 ∈ ℝ (𝑋 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ 𝑋 = (𝑐 + (𝑟 · (𝑑 − 𝑐))) ∧ (ℑ‘((∗‘(𝑏 − 𝑎)) · (𝑑 − 𝑐))) ≠ 0) ∨ ∃𝑎 ∈ (𝐶‘𝑛)∃𝑏 ∈ (𝐶‘𝑛)∃𝑐 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)∃𝑡 ∈ ℝ (𝑋 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ (abs‘(𝑋 − 𝑐)) = (abs‘(𝑒 − 𝑓))) ∨ ∃𝑎 ∈ (𝐶‘𝑛)∃𝑏 ∈ (𝐶‘𝑛)∃𝑐 ∈ (𝐶‘𝑛)∃𝑑 ∈ (𝐶‘𝑛)∃𝑒 ∈ (𝐶‘𝑛)∃𝑓 ∈ (𝐶‘𝑛)(𝑎 ≠ 𝑑 ∧ (abs‘(𝑋 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑋 − 𝑑)) = (abs‘(𝑒 − 𝑓)))))))
77	8, 71, 76	mpbir2and 713	. . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝑋 ∈ (𝐶‘suc 𝑛))
78	3, 6, 77	rspcedvd 3581	. . 3 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → ∃𝑚 ∈ ω 𝑋 ∈ (𝐶‘𝑚))
79	72	isconstr 33702	. . 3 ⊢ (𝑋 ∈ Constr ↔ ∃𝑚 ∈ ω 𝑋 ∈ (𝐶‘𝑚))
80	78, 79	sylibr 234	. 2 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛)) → 𝑋 ∈ Constr)
81	28, 33, 36	tpssd 32500	. . . 4 ⊢ (𝜑 → {𝐴, 𝐵, 𝐺} ⊆ Constr)
82	52, 56, 59	tpssd 32500	. . . 4 ⊢ (𝜑 → {𝐷, 𝐸, 𝐹} ⊆ Constr)
83	81, 82	unssd 4145	. . 3 ⊢ (𝜑 → ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ Constr)
84		tpfi 9234	. . . . 5 ⊢ {𝐴, 𝐵, 𝐺} ∈ Fin
85	84	a1i 11	. . . 4 ⊢ (𝜑 → {𝐴, 𝐵, 𝐺} ∈ Fin)
86		tpfi 9234	. . . . 5 ⊢ {𝐷, 𝐸, 𝐹} ∈ Fin
87	86	a1i 11	. . . 4 ⊢ (𝜑 → {𝐷, 𝐸, 𝐹} ∈ Fin)
88	85, 87	unfid 9096	. . 3 ⊢ (𝜑 → ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ∈ Fin)
89	72, 83, 88	constrfiss 33717	. 2 ⊢ (𝜑 → ∃𝑛 ∈ ω ({𝐴, 𝐵, 𝐺} ∪ {𝐷, 𝐸, 𝐹}) ⊆ (𝐶‘𝑛))
90	80, 89	r19.29a 3137	1 ⊢ (𝜑 → 𝑋 ∈ Constr)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ w3o 1085   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∃wrex 3053  {crab 3396  Vcvv 3438   ∪ cun 3903   ⊆ wss 3905  {cpr 4581  {ctp 4583   ↦ cmpt 5176  Oncon0 6311  suc csuc 6313  ‘cfv 6486  (class class class)co 7353  ωcom 7806  reccrdg 8338  Fincfn 8879  ℂcc 11026  ℝcr 11027  0cc0 11028  1c1 11029   + caddc 11031   · cmul 11033   − cmin 11365  ∗ccj 15021  ℑcim 15023  abscabs 15159  Constrcconstr 33695

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-2o 8396  df-er 8632  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-pnf 11170  df-mnf 11171  df-ltxr 11173  df-sub 11367  df-constr 33696

This theorem is referenced by:  constrcccl  33724