rngunsnply - Mathbox for Stefan O'Rear

	Mathbox for Stefan O'Rear		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > rngunsnply		Structured version Visualization version GIF version

Theorem rngunsnply 43181

Description: Adjoining one element to a ring results in a set of polynomial evaluations. (Contributed by Stefan O'Rear, 30-Nov-2014.)

**Hypotheses**
Ref	Expression
rngunsnply.b	⊢ (𝜑 → 𝐵 ∈ (SubRing‘ℂ_fld))
rngunsnply.x	⊢ (𝜑 → 𝑋 ∈ ℂ)
rngunsnply.s	⊢ (𝜑 → 𝑆 = ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))

**Assertion**
Ref	Expression
rngunsnply	⊢ (𝜑 → (𝑉 ∈ 𝑆 ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋)))

Distinct variable groups: 𝜑,𝑝 𝐵,𝑝 𝑋,𝑝 𝑉,𝑝 Allowed substitution hint: 𝑆(𝑝)

Proof of Theorem rngunsnply Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rngunsnply.s	. . 3 ⊢ (𝜑 → 𝑆 = ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
2	1	eleq2d 2827	. 2 ⊢ (𝜑 → (𝑉 ∈ 𝑆 ↔ 𝑉 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋}))))
3		cnring 21403	. . . . . . 7 ⊢ ℂ_fld ∈ Ring
4	3	a1i 11	. . . . . 6 ⊢ (𝜑 → ℂ_fld ∈ Ring)
5		cnfldbas 21368	. . . . . . 7 ⊢ ℂ = (Base‘ℂ_fld)
6	5	a1i 11	. . . . . 6 ⊢ (𝜑 → ℂ = (Base‘ℂ_fld))
7		rngunsnply.b	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ (SubRing‘ℂ_fld))
8	5	subrgss 20572	. . . . . . . 8 ⊢ (𝐵 ∈ (SubRing‘ℂ_fld) → 𝐵 ⊆ ℂ)
9	7, 8	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ ℂ)
10		rngunsnply.x	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ ℂ)
11	10	snssd 4809	. . . . . . 7 ⊢ (𝜑 → {𝑋} ⊆ ℂ)
12	9, 11	unssd 4192	. . . . . 6 ⊢ (𝜑 → (𝐵 ∪ {𝑋}) ⊆ ℂ)
13		eqidd 2738	. . . . . 6 ⊢ (𝜑 → (RingSpan‘ℂ_fld) = (RingSpan‘ℂ_fld))
14		eqidd 2738	. . . . . 6 ⊢ (𝜑 → ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) = ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
15		eqidd 2738	. . . . . . 7 ⊢ (𝜑 → (ℂ_fld ↾_s {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}) = (ℂ_fld ↾_s {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}))
16		cnfld0 21405	. . . . . . . 8 ⊢ 0 = (0_g‘ℂ_fld)
17	16	a1i 11	. . . . . . 7 ⊢ (𝜑 → 0 = (0_g‘ℂ_fld))
18		cnfldadd 21370	. . . . . . . 8 ⊢ + = (+_g‘ℂ_fld)
19	18	a1i 11	. . . . . . 7 ⊢ (𝜑 → + = (+_g‘ℂ_fld))
20		plyf 26237	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ (Poly‘𝐵) → 𝑝:ℂ⟶ℂ)
21		ffvelcdm 7101	. . . . . . . . . . . 12 ⊢ ((𝑝:ℂ⟶ℂ ∧ 𝑋 ∈ ℂ) → (𝑝‘𝑋) ∈ ℂ)
22	20, 10, 21	syl2anr 597	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → (𝑝‘𝑋) ∈ ℂ)
23		eleq1 2829	. . . . . . . . . . 11 ⊢ (𝑎 = (𝑝‘𝑋) → (𝑎 ∈ ℂ ↔ (𝑝‘𝑋) ∈ ℂ))
24	22, 23	syl5ibrcom 247	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → (𝑎 = (𝑝‘𝑋) → 𝑎 ∈ ℂ))
25	24	rexlimdva 3155	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) → 𝑎 ∈ ℂ))
26	25	ss2abdv 4066	. . . . . . . 8 ⊢ (𝜑 → {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ⊆ {𝑎 ∣ 𝑎 ∈ ℂ})
27		abid2 2879	. . . . . . . . 9 ⊢ {𝑎 ∣ 𝑎 ∈ ℂ} = ℂ
28	27, 5	eqtri 2765	. . . . . . . 8 ⊢ {𝑎 ∣ 𝑎 ∈ ℂ} = (Base‘ℂ_fld)
29	26, 28	sseqtrdi 4024	. . . . . . 7 ⊢ (𝜑 → {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ⊆ (Base‘ℂ_fld))
30		abid2 2879	. . . . . . . . 9 ⊢ {𝑎 ∣ 𝑎 ∈ 𝐵} = 𝐵
31		plyconst 26245	. . . . . . . . . . . . 13 ⊢ ((𝐵 ⊆ ℂ ∧ 𝑎 ∈ 𝐵) → (ℂ × {𝑎}) ∈ (Poly‘𝐵))
32	9, 31	sylan 580	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (ℂ × {𝑎}) ∈ (Poly‘𝐵))
33	10	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑋 ∈ ℂ)
34		vex 3484	. . . . . . . . . . . . . . 15 ⊢ 𝑎 ∈ V
35	34	fvconst2 7224	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ ℂ → ((ℂ × {𝑎})‘𝑋) = 𝑎)
36	33, 35	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((ℂ × {𝑎})‘𝑋) = 𝑎)
37	36	eqcomd 2743	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑎 = ((ℂ × {𝑎})‘𝑋))
38		fveq1 6905	. . . . . . . . . . . . 13 ⊢ (𝑝 = (ℂ × {𝑎}) → (𝑝‘𝑋) = ((ℂ × {𝑎})‘𝑋))
39	38	rspceeqv 3645	. . . . . . . . . . . 12 ⊢ (((ℂ × {𝑎}) ∈ (Poly‘𝐵) ∧ 𝑎 = ((ℂ × {𝑎})‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋))
40	32, 37, 39	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋))
41	40	ex 412	. . . . . . . . . 10 ⊢ (𝜑 → (𝑎 ∈ 𝐵 → ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)))
42	41	ss2abdv 4066	. . . . . . . . 9 ⊢ (𝜑 → {𝑎 ∣ 𝑎 ∈ 𝐵} ⊆ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
43	30, 42	eqsstrrid 4023	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ⊆ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
44		subrgsubg 20577	. . . . . . . . . 10 ⊢ (𝐵 ∈ (SubRing‘ℂ_fld) → 𝐵 ∈ (SubGrp‘ℂ_fld))
45	7, 44	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ (SubGrp‘ℂ_fld))
46	16	subg0cl 19152	. . . . . . . . 9 ⊢ (𝐵 ∈ (SubGrp‘ℂ_fld) → 0 ∈ 𝐵)
47	45, 46	syl 17	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ 𝐵)
48	43, 47	sseldd 3984	. . . . . . 7 ⊢ (𝜑 → 0 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
49		biid 261	. . . . . . . . 9 ⊢ (𝜑 ↔ 𝜑)
50		vex 3484	. . . . . . . . . 10 ⊢ 𝑏 ∈ V
51		eqeq1 2741	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑏 → (𝑎 = (𝑝‘𝑋) ↔ 𝑏 = (𝑝‘𝑋)))
52	51	rexbidv 3179	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑏 → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑏 = (𝑝‘𝑋)))
53		fveq1 6905	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑒 → (𝑝‘𝑋) = (𝑒‘𝑋))
54	53	eqeq2d 2748	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑒 → (𝑏 = (𝑝‘𝑋) ↔ 𝑏 = (𝑒‘𝑋)))
55	54	cbvrexvw 3238	. . . . . . . . . . 11 ⊢ (∃𝑝 ∈ (Poly‘𝐵)𝑏 = (𝑝‘𝑋) ↔ ∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋))
56	52, 55	bitrdi 287	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋)))
57	50, 56	elab 3679	. . . . . . . . 9 ⊢ (𝑏 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ↔ ∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋))
58		vex 3484	. . . . . . . . . 10 ⊢ 𝑐 ∈ V
59		eqeq1 2741	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑐 → (𝑎 = (𝑝‘𝑋) ↔ 𝑐 = (𝑝‘𝑋)))
60	59	rexbidv 3179	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑐 → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑐 = (𝑝‘𝑋)))
61		fveq1 6905	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑑 → (𝑝‘𝑋) = (𝑑‘𝑋))
62	61	eqeq2d 2748	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑑 → (𝑐 = (𝑝‘𝑋) ↔ 𝑐 = (𝑑‘𝑋)))
63	62	cbvrexvw 3238	. . . . . . . . . . 11 ⊢ (∃𝑝 ∈ (Poly‘𝐵)𝑐 = (𝑝‘𝑋) ↔ ∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋))
64	60, 63	bitrdi 287	. . . . . . . . . 10 ⊢ (𝑎 = 𝑐 → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋)))
65	58, 64	elab 3679	. . . . . . . . 9 ⊢ (𝑐 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ↔ ∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋))
66		simplr 769	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → 𝑒 ∈ (Poly‘𝐵))
67		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → 𝑑 ∈ (Poly‘𝐵))
68	18	subrgacl 20583	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐵 ∈ (SubRing‘ℂ_fld) ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 + 𝑏) ∈ 𝐵)
69	68	3expb 1121	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 ∈ (SubRing‘ℂ_fld) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 + 𝑏) ∈ 𝐵)
70	7, 69	sylan 580	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 + 𝑏) ∈ 𝐵)
71	70	adantlr 715	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 + 𝑏) ∈ 𝐵)
72	71	adantlr 715	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 + 𝑏) ∈ 𝐵)
73	66, 67, 72	plyadd 26256	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → (𝑒 ∘_f + 𝑑) ∈ (Poly‘𝐵))
74		plyf 26237	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑒 ∈ (Poly‘𝐵) → 𝑒:ℂ⟶ℂ)
75	74	ffnd 6737	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑒 ∈ (Poly‘𝐵) → 𝑒 Fn ℂ)
76	75	ad2antlr 727	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → 𝑒 Fn ℂ)
77		plyf 26237	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑑 ∈ (Poly‘𝐵) → 𝑑:ℂ⟶ℂ)
78	77	ffnd 6737	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 ∈ (Poly‘𝐵) → 𝑑 Fn ℂ)
79	78	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → 𝑑 Fn ℂ)
80		cnex 11236	. . . . . . . . . . . . . . . . . 18 ⊢ ℂ ∈ V
81	80	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → ℂ ∈ V)
82	10	ad2antrr 726	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → 𝑋 ∈ ℂ)
83		fnfvof 7714	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑒 Fn ℂ ∧ 𝑑 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑋 ∈ ℂ)) → ((𝑒 ∘_f + 𝑑)‘𝑋) = ((𝑒‘𝑋) + (𝑑‘𝑋)))
84	76, 79, 81, 82, 83	syl22anc 839	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → ((𝑒 ∘_f + 𝑑)‘𝑋) = ((𝑒‘𝑋) + (𝑑‘𝑋)))
85	84	eqcomd 2743	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → ((𝑒‘𝑋) + (𝑑‘𝑋)) = ((𝑒 ∘_f + 𝑑)‘𝑋))
86		fveq1 6905	. . . . . . . . . . . . . . . 16 ⊢ (𝑝 = (𝑒 ∘_f + 𝑑) → (𝑝‘𝑋) = ((𝑒 ∘_f + 𝑑)‘𝑋))
87	86	rspceeqv 3645	. . . . . . . . . . . . . . 15 ⊢ (((𝑒 ∘_f + 𝑑) ∈ (Poly‘𝐵) ∧ ((𝑒‘𝑋) + (𝑑‘𝑋)) = ((𝑒 ∘_f + 𝑑)‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + (𝑑‘𝑋)) = (𝑝‘𝑋))
88	73, 85, 87	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + (𝑑‘𝑋)) = (𝑝‘𝑋))
89		oveq2 7439	. . . . . . . . . . . . . . . 16 ⊢ (𝑐 = (𝑑‘𝑋) → ((𝑒‘𝑋) + 𝑐) = ((𝑒‘𝑋) + (𝑑‘𝑋)))
90	89	eqeq1d 2739	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = (𝑑‘𝑋) → (((𝑒‘𝑋) + 𝑐) = (𝑝‘𝑋) ↔ ((𝑒‘𝑋) + (𝑑‘𝑋)) = (𝑝‘𝑋)))
91	90	rexbidv 3179	. . . . . . . . . . . . . 14 ⊢ (𝑐 = (𝑑‘𝑋) → (∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + 𝑐) = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + (𝑑‘𝑋)) = (𝑝‘𝑋)))
92	88, 91	syl5ibrcom 247	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → (𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + 𝑐) = (𝑝‘𝑋)))
93	92	rexlimdva 3155	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + 𝑐) = (𝑝‘𝑋)))
94		oveq1 7438	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = (𝑒‘𝑋) → (𝑏 + 𝑐) = ((𝑒‘𝑋) + 𝑐))
95	94	eqeq1d 2739	. . . . . . . . . . . . . 14 ⊢ (𝑏 = (𝑒‘𝑋) → ((𝑏 + 𝑐) = (𝑝‘𝑋) ↔ ((𝑒‘𝑋) + 𝑐) = (𝑝‘𝑋)))
96	95	rexbidv 3179	. . . . . . . . . . . . 13 ⊢ (𝑏 = (𝑒‘𝑋) → (∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + 𝑐) = (𝑝‘𝑋)))
97	96	imbi2d 340	. . . . . . . . . . . 12 ⊢ (𝑏 = (𝑒‘𝑋) → ((∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋)) ↔ (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) + 𝑐) = (𝑝‘𝑋))))
98	93, 97	syl5ibrcom 247	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (𝑏 = (𝑒‘𝑋) → (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋))))
99	98	rexlimdva 3155	. . . . . . . . . 10 ⊢ (𝜑 → (∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋) → (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋))))
100	99	3imp 1111	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋) ∧ ∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋))
101	49, 57, 65, 100	syl3anb 1162	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ∧ 𝑐 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋))
102		ovex 7464	. . . . . . . . 9 ⊢ (𝑏 + 𝑐) ∈ V
103		eqeq1 2741	. . . . . . . . . 10 ⊢ (𝑎 = (𝑏 + 𝑐) → (𝑎 = (𝑝‘𝑋) ↔ (𝑏 + 𝑐) = (𝑝‘𝑋)))
104	103	rexbidv 3179	. . . . . . . . 9 ⊢ (𝑎 = (𝑏 + 𝑐) → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋)))
105	102, 104	elab 3679	. . . . . . . 8 ⊢ ((𝑏 + 𝑐) ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ↔ ∃𝑝 ∈ (Poly‘𝐵)(𝑏 + 𝑐) = (𝑝‘𝑋))
106	101, 105	sylibr 234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ∧ 𝑐 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}) → (𝑏 + 𝑐) ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
107		ax-1cn 11213	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℂ
108		cnfldneg 21408	. . . . . . . . . . . . . . . . . 18 ⊢ (1 ∈ ℂ → ((inv_g‘ℂ_fld)‘1) = -1)
109	107, 108	mp1i 13	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((inv_g‘ℂ_fld)‘1) = -1)
110		cnfld1 21406	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 = (1_r‘ℂ_fld)
111	110	subrg1cl 20580	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐵 ∈ (SubRing‘ℂ_fld) → 1 ∈ 𝐵)
112	7, 111	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 1 ∈ 𝐵)
113		eqid 2737	. . . . . . . . . . . . . . . . . . 19 ⊢ (inv_g‘ℂ_fld) = (inv_g‘ℂ_fld)
114	113	subginvcl 19153	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐵 ∈ (SubGrp‘ℂ_fld) ∧ 1 ∈ 𝐵) → ((inv_g‘ℂ_fld)‘1) ∈ 𝐵)
115	45, 112, 114	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((inv_g‘ℂ_fld)‘1) ∈ 𝐵)
116	109, 115	eqeltrrd 2842	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → -1 ∈ 𝐵)
117		plyconst 26245	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ⊆ ℂ ∧ -1 ∈ 𝐵) → (ℂ × {-1}) ∈ (Poly‘𝐵))
118	9, 116, 117	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (ℂ × {-1}) ∈ (Poly‘𝐵))
119	118	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (ℂ × {-1}) ∈ (Poly‘𝐵))
120		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → 𝑒 ∈ (Poly‘𝐵))
121		cnfldmul 21372	. . . . . . . . . . . . . . . . . 18 ⊢ · = (._r‘ℂ_fld)
122	121	subrgmcl 20584	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐵 ∈ (SubRing‘ℂ_fld) ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 · 𝑏) ∈ 𝐵)
123	122	3expb 1121	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∈ (SubRing‘ℂ_fld) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 · 𝑏) ∈ 𝐵)
124	7, 123	sylan 580	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 · 𝑏) ∈ 𝐵)
125	124	adantlr 715	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 · 𝑏) ∈ 𝐵)
126	119, 120, 71, 125	plymul 26257	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → ((ℂ × {-1}) ∘_f · 𝑒) ∈ (Poly‘𝐵))
127		ffvelcdm 7101	. . . . . . . . . . . . . . . 16 ⊢ ((𝑒:ℂ⟶ℂ ∧ 𝑋 ∈ ℂ) → (𝑒‘𝑋) ∈ ℂ)
128	74, 10, 127	syl2anr 597	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (𝑒‘𝑋) ∈ ℂ)
129		cnfldneg 21408	. . . . . . . . . . . . . . 15 ⊢ ((𝑒‘𝑋) ∈ ℂ → ((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = -(𝑒‘𝑋))
130	128, 129	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → ((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = -(𝑒‘𝑋))
131		negex 11506	. . . . . . . . . . . . . . . . 17 ⊢ -1 ∈ V
132		fnconstg 6796	. . . . . . . . . . . . . . . . 17 ⊢ (-1 ∈ V → (ℂ × {-1}) Fn ℂ)
133	131, 132	mp1i 13	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (ℂ × {-1}) Fn ℂ)
134	75	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → 𝑒 Fn ℂ)
135	80	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → ℂ ∈ V)
136	10	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → 𝑋 ∈ ℂ)
137		fnfvof 7714	. . . . . . . . . . . . . . . 16 ⊢ ((((ℂ × {-1}) Fn ℂ ∧ 𝑒 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑋 ∈ ℂ)) → (((ℂ × {-1}) ∘_f · 𝑒)‘𝑋) = (((ℂ × {-1})‘𝑋) · (𝑒‘𝑋)))
138	133, 134, 135, 136, 137	syl22anc 839	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (((ℂ × {-1}) ∘_f · 𝑒)‘𝑋) = (((ℂ × {-1})‘𝑋) · (𝑒‘𝑋)))
139	131	fvconst2 7224	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 ∈ ℂ → ((ℂ × {-1})‘𝑋) = -1)
140	136, 139	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → ((ℂ × {-1})‘𝑋) = -1)
141	140	oveq1d 7446	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (((ℂ × {-1})‘𝑋) · (𝑒‘𝑋)) = (-1 · (𝑒‘𝑋)))
142	128	mulm1d 11715	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (-1 · (𝑒‘𝑋)) = -(𝑒‘𝑋))
143	138, 141, 142	3eqtrd 2781	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (((ℂ × {-1}) ∘_f · 𝑒)‘𝑋) = -(𝑒‘𝑋))
144	130, 143	eqtr4d 2780	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → ((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = (((ℂ × {-1}) ∘_f · 𝑒)‘𝑋))
145		fveq1 6905	. . . . . . . . . . . . . 14 ⊢ (𝑝 = ((ℂ × {-1}) ∘_f · 𝑒) → (𝑝‘𝑋) = (((ℂ × {-1}) ∘_f · 𝑒)‘𝑋))
146	145	rspceeqv 3645	. . . . . . . . . . . . 13 ⊢ ((((ℂ × {-1}) ∘_f · 𝑒) ∈ (Poly‘𝐵) ∧ ((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = (((ℂ × {-1}) ∘_f · 𝑒)‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = (𝑝‘𝑋))
147	126, 144, 146	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = (𝑝‘𝑋))
148		fveqeq2 6915	. . . . . . . . . . . . 13 ⊢ (𝑏 = (𝑒‘𝑋) → (((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋) ↔ ((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = (𝑝‘𝑋)))
149	148	rexbidv 3179	. . . . . . . . . . . 12 ⊢ (𝑏 = (𝑒‘𝑋) → (∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘(𝑒‘𝑋)) = (𝑝‘𝑋)))
150	147, 149	syl5ibrcom 247	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (𝑏 = (𝑒‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋)))
151	150	rexlimdva 3155	. . . . . . . . . 10 ⊢ (𝜑 → (∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋)))
152	151	imp 406	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋))
153	57, 152	sylan2b 594	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}) → ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋))
154		fvex 6919	. . . . . . . . 9 ⊢ ((inv_g‘ℂ_fld)‘𝑏) ∈ V
155		eqeq1 2741	. . . . . . . . . 10 ⊢ (𝑎 = ((inv_g‘ℂ_fld)‘𝑏) → (𝑎 = (𝑝‘𝑋) ↔ ((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋)))
156	155	rexbidv 3179	. . . . . . . . 9 ⊢ (𝑎 = ((inv_g‘ℂ_fld)‘𝑏) → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋)))
157	154, 156	elab 3679	. . . . . . . 8 ⊢ (((inv_g‘ℂ_fld)‘𝑏) ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ↔ ∃𝑝 ∈ (Poly‘𝐵)((inv_g‘ℂ_fld)‘𝑏) = (𝑝‘𝑋))
158	153, 157	sylibr 234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}) → ((inv_g‘ℂ_fld)‘𝑏) ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
159	110	a1i 11	. . . . . . 7 ⊢ (𝜑 → 1 = (1_r‘ℂ_fld))
160	121	a1i 11	. . . . . . 7 ⊢ (𝜑 → · = (._r‘ℂ_fld))
161	43, 112	sseldd 3984	. . . . . . 7 ⊢ (𝜑 → 1 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
162	125	adantlr 715	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 · 𝑏) ∈ 𝐵)
163	66, 67, 72, 162	plymul 26257	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → (𝑒 ∘_f · 𝑑) ∈ (Poly‘𝐵))
164		fnfvof 7714	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑒 Fn ℂ ∧ 𝑑 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑋 ∈ ℂ)) → ((𝑒 ∘_f · 𝑑)‘𝑋) = ((𝑒‘𝑋) · (𝑑‘𝑋)))
165	76, 79, 81, 82, 164	syl22anc 839	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → ((𝑒 ∘_f · 𝑑)‘𝑋) = ((𝑒‘𝑋) · (𝑑‘𝑋)))
166	165	eqcomd 2743	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → ((𝑒‘𝑋) · (𝑑‘𝑋)) = ((𝑒 ∘_f · 𝑑)‘𝑋))
167		fveq1 6905	. . . . . . . . . . . . . . . 16 ⊢ (𝑝 = (𝑒 ∘_f · 𝑑) → (𝑝‘𝑋) = ((𝑒 ∘_f · 𝑑)‘𝑋))
168	167	rspceeqv 3645	. . . . . . . . . . . . . . 15 ⊢ (((𝑒 ∘_f · 𝑑) ∈ (Poly‘𝐵) ∧ ((𝑒‘𝑋) · (𝑑‘𝑋)) = ((𝑒 ∘_f · 𝑑)‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · (𝑑‘𝑋)) = (𝑝‘𝑋))
169	163, 166, 168	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · (𝑑‘𝑋)) = (𝑝‘𝑋))
170		oveq2 7439	. . . . . . . . . . . . . . . 16 ⊢ (𝑐 = (𝑑‘𝑋) → ((𝑒‘𝑋) · 𝑐) = ((𝑒‘𝑋) · (𝑑‘𝑋)))
171	170	eqeq1d 2739	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = (𝑑‘𝑋) → (((𝑒‘𝑋) · 𝑐) = (𝑝‘𝑋) ↔ ((𝑒‘𝑋) · (𝑑‘𝑋)) = (𝑝‘𝑋)))
172	171	rexbidv 3179	. . . . . . . . . . . . . 14 ⊢ (𝑐 = (𝑑‘𝑋) → (∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · 𝑐) = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · (𝑑‘𝑋)) = (𝑝‘𝑋)))
173	169, 172	syl5ibrcom 247	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) ∧ 𝑑 ∈ (Poly‘𝐵)) → (𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · 𝑐) = (𝑝‘𝑋)))
174	173	rexlimdva 3155	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · 𝑐) = (𝑝‘𝑋)))
175		oveq1 7438	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = (𝑒‘𝑋) → (𝑏 · 𝑐) = ((𝑒‘𝑋) · 𝑐))
176	175	eqeq1d 2739	. . . . . . . . . . . . . 14 ⊢ (𝑏 = (𝑒‘𝑋) → ((𝑏 · 𝑐) = (𝑝‘𝑋) ↔ ((𝑒‘𝑋) · 𝑐) = (𝑝‘𝑋)))
177	176	rexbidv 3179	. . . . . . . . . . . . 13 ⊢ (𝑏 = (𝑒‘𝑋) → (∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · 𝑐) = (𝑝‘𝑋)))
178	177	imbi2d 340	. . . . . . . . . . . 12 ⊢ (𝑏 = (𝑒‘𝑋) → ((∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋)) ↔ (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)((𝑒‘𝑋) · 𝑐) = (𝑝‘𝑋))))
179	174, 178	syl5ibrcom 247	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑒 ∈ (Poly‘𝐵)) → (𝑏 = (𝑒‘𝑋) → (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋))))
180	179	rexlimdva 3155	. . . . . . . . . 10 ⊢ (𝜑 → (∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋) → (∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋))))
181	180	3imp 1111	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑒 ∈ (Poly‘𝐵)𝑏 = (𝑒‘𝑋) ∧ ∃𝑑 ∈ (Poly‘𝐵)𝑐 = (𝑑‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋))
182	49, 57, 65, 181	syl3anb 1162	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ∧ 𝑐 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}) → ∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋))
183		ovex 7464	. . . . . . . . 9 ⊢ (𝑏 · 𝑐) ∈ V
184		eqeq1 2741	. . . . . . . . . 10 ⊢ (𝑎 = (𝑏 · 𝑐) → (𝑎 = (𝑝‘𝑋) ↔ (𝑏 · 𝑐) = (𝑝‘𝑋)))
185	184	rexbidv 3179	. . . . . . . . 9 ⊢ (𝑎 = (𝑏 · 𝑐) → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋)))
186	183, 185	elab 3679	. . . . . . . 8 ⊢ ((𝑏 · 𝑐) ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ↔ ∃𝑝 ∈ (Poly‘𝐵)(𝑏 · 𝑐) = (𝑝‘𝑋))
187	182, 186	sylibr 234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ∧ 𝑐 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}) → (𝑏 · 𝑐) ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
188	15, 17, 19, 29, 48, 106, 158, 159, 160, 161, 187, 4	issubrgd 21196	. . . . . 6 ⊢ (𝜑 → {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ∈ (SubRing‘ℂ_fld))
189		plyid 26248	. . . . . . . . . . 11 ⊢ ((𝐵 ⊆ ℂ ∧ 1 ∈ 𝐵) → X_p ∈ (Poly‘𝐵))
190	9, 112, 189	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → X_p ∈ (Poly‘𝐵))
191		df-idp 26228	. . . . . . . . . . . 12 ⊢ X_p = ( I ↾ ℂ)
192	191	fveq1i 6907	. . . . . . . . . . 11 ⊢ (X_p‘𝑋) = (( I ↾ ℂ)‘𝑋)
193		fvresi 7193	. . . . . . . . . . . 12 ⊢ (𝑋 ∈ ℂ → (( I ↾ ℂ)‘𝑋) = 𝑋)
194	10, 193	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (( I ↾ ℂ)‘𝑋) = 𝑋)
195	192, 194	eqtr2id 2790	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 = (X_p‘𝑋))
196		fveq1 6905	. . . . . . . . . . 11 ⊢ (𝑝 = X_p → (𝑝‘𝑋) = (X_p‘𝑋))
197	196	rspceeqv 3645	. . . . . . . . . 10 ⊢ ((X_p ∈ (Poly‘𝐵) ∧ 𝑋 = (X_p‘𝑋)) → ∃𝑝 ∈ (Poly‘𝐵)𝑋 = (𝑝‘𝑋))
198	190, 195, 197	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑝 ∈ (Poly‘𝐵)𝑋 = (𝑝‘𝑋))
199		eqeq1 2741	. . . . . . . . . 10 ⊢ (𝑎 = 𝑋 → (𝑎 = (𝑝‘𝑋) ↔ 𝑋 = (𝑝‘𝑋)))
200	199	rexbidv 3179	. . . . . . . . 9 ⊢ (𝑎 = 𝑋 → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑋 = (𝑝‘𝑋)))
201	10, 198, 200	elabd 3681	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
202	201	snssd 4809	. . . . . . 7 ⊢ (𝜑 → {𝑋} ⊆ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
203	43, 202	unssd 4192	. . . . . 6 ⊢ (𝜑 → (𝐵 ∪ {𝑋}) ⊆ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
204	4, 6, 12, 13, 14, 188, 203	rgspnmin 20615	. . . . 5 ⊢ (𝜑 → ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) ⊆ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)})
205	204	sseld 3982	. . . 4 ⊢ (𝜑 → (𝑉 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) → 𝑉 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)}))
206		fvex 6919	. . . . . . 7 ⊢ (𝑝‘𝑋) ∈ V
207		eleq1 2829	. . . . . . 7 ⊢ (𝑉 = (𝑝‘𝑋) → (𝑉 ∈ V ↔ (𝑝‘𝑋) ∈ V))
208	206, 207	mpbiri 258	. . . . . 6 ⊢ (𝑉 = (𝑝‘𝑋) → 𝑉 ∈ V)
209	208	rexlimivw 3151	. . . . 5 ⊢ (∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋) → 𝑉 ∈ V)
210		eqeq1 2741	. . . . . 6 ⊢ (𝑎 = 𝑉 → (𝑎 = (𝑝‘𝑋) ↔ 𝑉 = (𝑝‘𝑋)))
211	210	rexbidv 3179	. . . . 5 ⊢ (𝑎 = 𝑉 → (∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋) ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋)))
212	209, 211	elab3 3686	. . . 4 ⊢ (𝑉 ∈ {𝑎 ∣ ∃𝑝 ∈ (Poly‘𝐵)𝑎 = (𝑝‘𝑋)} ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋))
213	205, 212	imbitrdi 251	. . 3 ⊢ (𝜑 → (𝑉 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) → ∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋)))
214	4, 6, 12, 13, 14	rgspncl 20613	. . . . . . 7 ⊢ (𝜑 → ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) ∈ (SubRing‘ℂ_fld))
215	214	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) ∈ (SubRing‘ℂ_fld))
216		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → 𝑝 ∈ (Poly‘𝐵))
217	4, 6, 12, 13, 14	rgspnssid 20614	. . . . . . . . 9 ⊢ (𝜑 → (𝐵 ∪ {𝑋}) ⊆ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
218	217	unssbd 4194	. . . . . . . 8 ⊢ (𝜑 → {𝑋} ⊆ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
219		snidg 4660	. . . . . . . . 9 ⊢ (𝑋 ∈ ℂ → 𝑋 ∈ {𝑋})
220	10, 219	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ {𝑋})
221	218, 220	sseldd 3984	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
222	221	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → 𝑋 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
223	217	unssad 4193	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
224	223	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → 𝐵 ⊆ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
225	215, 216, 222, 224	cnsrplycl 43179	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → (𝑝‘𝑋) ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})))
226		eleq1 2829	. . . . 5 ⊢ (𝑉 = (𝑝‘𝑋) → (𝑉 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) ↔ (𝑝‘𝑋) ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋}))))
227	225, 226	syl5ibrcom 247	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ (Poly‘𝐵)) → (𝑉 = (𝑝‘𝑋) → 𝑉 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋}))))
228	227	rexlimdva 3155	. . 3 ⊢ (𝜑 → (∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋) → 𝑉 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋}))))
229	213, 228	impbid 212	. 2 ⊢ (𝜑 → (𝑉 ∈ ((RingSpan‘ℂ_fld)‘(𝐵 ∪ {𝑋})) ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋)))
230	2, 229	bitrd 279	1 ⊢ (𝜑 → (𝑉 ∈ 𝑆 ↔ ∃𝑝 ∈ (Poly‘𝐵)𝑉 = (𝑝‘𝑋)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 {cab 2714 ∃wrex 3070 Vcvv 3480 ∪ cun 3949 ⊆ wss 3951 {csn 4626 I cid 5577 × cxp 5683 ↾ cres 5687 Fn wfn 6556 ⟶wf 6557 ‘cfv 6561 (class class class)co 7431 ∘_f cof 7695 ℂcc 11153 0cc0 11155 1c1 11156 + caddc 11158 · cmul 11160 -cneg 11493 Basecbs 17247 ↾_s cress 17274 +_gcplusg 17297 ._rcmulr 17298 0_gc0g 17484 inv_gcminusg 18952 SubGrpcsubg 19138 1_rcur 20178 Ringcrg 20230 SubRingcsubrg 20569 RingSpancrgspn 20610 ℂ_fldccnfld 21364 Polycply 26223 X_pcidp 26224

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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-inf2 9681 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 ax-pre-sup 11233 ax-addf 11234 ax-mulf 11235

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-se 5638 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-map 8868 df-pm 8869 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-sup 9482 df-inf 9483 df-oi 9550 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-div 11921 df-nn 12267 df-2 12329 df-3 12330 df-4 12331 df-5 12332 df-6 12333 df-7 12334 df-8 12335 df-9 12336 df-n0 12527 df-z 12614 df-dec 12734 df-uz 12879 df-rp 13035 df-fz 13548 df-fzo 13695 df-fl 13832 df-seq 14043 df-exp 14103 df-hash 14370 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-clim 15524 df-rlim 15525 df-sum 15723 df-struct 17184 df-sets 17201 df-slot 17219 df-ndx 17231 df-base 17248 df-ress 17275 df-plusg 17310 df-mulr 17311 df-starv 17312 df-tset 17316 df-ple 17317 df-ds 17319 df-unif 17320 df-0g 17486 df-mgm 18653 df-sgrp 18732 df-mnd 18748 df-grp 18954 df-minusg 18955 df-subg 19141 df-cmn 19800 df-abl 19801 df-mgp 20138 df-rng 20150 df-ur 20179 df-ring 20232 df-cring 20233 df-subrng 20546 df-subrg 20570 df-rgspn 20611 df-cnfld 21365 df-0p 25705 df-ply 26227 df-idp 26228 df-coe 26229 df-dgr 26230

This theorem is referenced by: (None)

W3C validator