constrrecl - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > constrrecl		Structured version Visualization version GIF version

Theorem constrrecl 33765

Description: Constructible numbers are closed under taking the real part. (Contributed by Thierry Arnoux, 5-Nov-2025.)

**Hypothesis**
Ref	Expression
constrcjcl.1	⊢ (𝜑 → 𝑋 ∈ Constr)

**Assertion**
Ref	Expression
constrrecl	⊢ (𝜑 → (ℜ‘𝑋) ∈ Constr)

**Proof of Theorem constrrecl**
Step	Hyp	Ref	Expression
1		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → 𝑋 ∈ ℝ)
2	1	rered 15196	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = 𝑋)
3		constrcjcl.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ Constr)
4	3	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → 𝑋 ∈ Constr)
5	2, 4	eqeltrd 2829	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ Constr)
6		0zd 12547	. . . . 5 ⊢ (𝜑 → 0 ∈ ℤ)
7	6	zconstr 33760	. . . 4 ⊢ (𝜑 → 0 ∈ Constr)
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 0 ∈ Constr)
9		1zzd 12570	. . . . 5 ⊢ (𝜑 → 1 ∈ ℤ)
10	9	zconstr 33760	. . . 4 ⊢ (𝜑 → 1 ∈ Constr)
11	10	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 1 ∈ Constr)
12	3	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 𝑋 ∈ Constr)
13	3	constrcjcl 33764	. . . 4 ⊢ (𝜑 → (∗‘𝑋) ∈ Constr)
14	13	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (∗‘𝑋) ∈ Constr)
15	3	constrcn 33756	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ ℂ)
16	15	recld 15166	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℝ)
17	16	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ ℝ)
18		halfre 12401	. . . 4 ⊢ (1 / 2) ∈ ℝ
19	18	a1i 11	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (1 / 2) ∈ ℝ)
20	16	recnd 11208	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℂ)
21	20	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ ℂ)
22		1cnd 11175	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℂ)
23	22	subid1d 11528	. . . . . . . 8 ⊢ (𝜑 → (1 − 0) = 1)
24	23, 22	eqeltrd 2829	. . . . . . 7 ⊢ (𝜑 → (1 − 0) ∈ ℂ)
25	20, 24	mulcld 11200	. . . . . 6 ⊢ (𝜑 → ((ℜ‘𝑋) · (1 − 0)) ∈ ℂ)
26	25	addlidd 11381	. . . . 5 ⊢ (𝜑 → (0 + ((ℜ‘𝑋) · (1 − 0))) = ((ℜ‘𝑋) · (1 − 0)))
27	23	oveq2d 7405	. . . . 5 ⊢ (𝜑 → ((ℜ‘𝑋) · (1 − 0)) = ((ℜ‘𝑋) · 1))
28	20	mulridd 11197	. . . . 5 ⊢ (𝜑 → ((ℜ‘𝑋) · 1) = (ℜ‘𝑋))
29	26, 27, 28	3eqtrrd 2770	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) = (0 + ((ℜ‘𝑋) · (1 − 0))))
30	29	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = (0 + ((ℜ‘𝑋) · (1 − 0))))
31	15	cjcld 15168	. . . . . . 7 ⊢ (𝜑 → (∗‘𝑋) ∈ ℂ)
32	15, 31	addcld 11199	. . . . . 6 ⊢ (𝜑 → (𝑋 + (∗‘𝑋)) ∈ ℂ)
33		2cnd 12265	. . . . . 6 ⊢ (𝜑 → 2 ∈ ℂ)
34		2ne0 12291	. . . . . . 7 ⊢ 2 ≠ 0
35	34	a1i 11	. . . . . 6 ⊢ (𝜑 → 2 ≠ 0)
36	32, 33, 35	divrec2d 11968	. . . . 5 ⊢ (𝜑 → ((𝑋 + (∗‘𝑋)) / 2) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
37		reval 15078	. . . . . 6 ⊢ (𝑋 ∈ ℂ → (ℜ‘𝑋) = ((𝑋 + (∗‘𝑋)) / 2))
38	15, 37	syl 17	. . . . 5 ⊢ (𝜑 → (ℜ‘𝑋) = ((𝑋 + (∗‘𝑋)) / 2))
39	18	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
40	39	recnd 11208	. . . . . . . 8 ⊢ (𝜑 → (1 / 2) ∈ ℂ)
41	40, 31, 15	subdid 11640	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · ((∗‘𝑋) − 𝑋)) = (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋)))
42	41	oveq2d 7405	. . . . . 6 ⊢ (𝜑 → (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))) = (𝑋 + (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋))))
43	40, 15	mulcld 11200	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · 𝑋) ∈ ℂ)
44	40, 31	mulcld 11200	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · (∗‘𝑋)) ∈ ℂ)
45	15, 43, 44	subadd23d 11561	. . . . . 6 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = (𝑋 + (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋))))
46	22, 40, 15	subdird 11641	. . . . . . . . 9 ⊢ (𝜑 → ((1 − (1 / 2)) · 𝑋) = ((1 · 𝑋) − ((1 / 2) · 𝑋)))
47		1mhlfehlf 12407	. . . . . . . . . . 11 ⊢ (1 − (1 / 2)) = (1 / 2)
48	47	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (1 − (1 / 2)) = (1 / 2))
49	48	oveq1d 7404	. . . . . . . . 9 ⊢ (𝜑 → ((1 − (1 / 2)) · 𝑋) = ((1 / 2) · 𝑋))
50	15	mullidd 11198	. . . . . . . . . 10 ⊢ (𝜑 → (1 · 𝑋) = 𝑋)
51	50	oveq1d 7404	. . . . . . . . 9 ⊢ (𝜑 → ((1 · 𝑋) − ((1 / 2) · 𝑋)) = (𝑋 − ((1 / 2) · 𝑋)))
52	46, 49, 51	3eqtr3rd 2774	. . . . . . . 8 ⊢ (𝜑 → (𝑋 − ((1 / 2) · 𝑋)) = ((1 / 2) · 𝑋))
53	52	oveq1d 7404	. . . . . . 7 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = (((1 / 2) · 𝑋) + ((1 / 2) · (∗‘𝑋))))
54	40, 15, 31	adddid 11204	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · (𝑋 + (∗‘𝑋))) = (((1 / 2) · 𝑋) + ((1 / 2) · (∗‘𝑋))))
55	53, 54	eqtr4d 2768	. . . . . 6 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
56	42, 45, 55	3eqtr2d 2771	. . . . 5 ⊢ (𝜑 → (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
57	36, 38, 56	3eqtr4d 2775	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) = (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))))
58	57	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))))
59	23	fveq2d 6864	. . . . . . . . 9 ⊢ (𝜑 → (∗‘(1 − 0)) = (∗‘1))
60		1red 11181	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℝ)
61	60	cjred 15198	. . . . . . . . 9 ⊢ (𝜑 → (∗‘1) = 1)
62	59, 61	eqtrd 2765	. . . . . . . 8 ⊢ (𝜑 → (∗‘(1 − 0)) = 1)
63	62	oveq1d 7404	. . . . . . 7 ⊢ (𝜑 → ((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋)) = (1 · ((∗‘𝑋) − 𝑋)))
64	31, 15	subcld 11539	. . . . . . . 8 ⊢ (𝜑 → ((∗‘𝑋) − 𝑋) ∈ ℂ)
65	64	mullidd 11198	. . . . . . 7 ⊢ (𝜑 → (1 · ((∗‘𝑋) − 𝑋)) = ((∗‘𝑋) − 𝑋))
66	63, 65	eqtrd 2765	. . . . . 6 ⊢ (𝜑 → ((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋)) = ((∗‘𝑋) − 𝑋))
67	66	fveq2d 6864	. . . . 5 ⊢ (𝜑 → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) = (ℑ‘((∗‘𝑋) − 𝑋)))
68	67	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) = (ℑ‘((∗‘𝑋) − 𝑋)))
69	15	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → 𝑋 ∈ ℂ)
70		imval2 15123	. . . . . . . . . . 11 ⊢ (𝑋 ∈ ℂ → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
71	15, 70	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
72	71	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
73	15, 31	subcld 11539	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 − (∗‘𝑋)) ∈ ℂ)
74	73	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) ∈ ℂ)
75	64	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → ((∗‘𝑋) − 𝑋) ∈ ℂ)
76	75	imnegd 15182	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘-((∗‘𝑋) − 𝑋)) = -(ℑ‘((∗‘𝑋) − 𝑋)))
77	31	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (∗‘𝑋) ∈ ℂ)
78	77, 69	negsubdi2d 11555	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → -((∗‘𝑋) − 𝑋) = (𝑋 − (∗‘𝑋)))
79	78	fveq2d 6864	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘-((∗‘𝑋) − 𝑋)) = (ℑ‘(𝑋 − (∗‘𝑋))))
80		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘((∗‘𝑋) − 𝑋)) = 0)
81	80	negeqd 11421	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → -(ℑ‘((∗‘𝑋) − 𝑋)) = -0)
82	76, 79, 81	3eqtr3d 2773	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘(𝑋 − (∗‘𝑋))) = -0)
83		neg0 11474	. . . . . . . . . . . . 13 ⊢ -0 = 0
84	82, 83	eqtrdi 2781	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘(𝑋 − (∗‘𝑋))) = 0)
85	74, 84	reim0bd 15172	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) ∈ ℝ)
86		cjth 15075	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ ℂ → ((𝑋 + (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ))
87	15, 86	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑋 + (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ))
88	87	simprd 495	. . . . . . . . . . . 12 ⊢ (𝜑 → (i · (𝑋 − (∗‘𝑋))) ∈ ℝ)
89	88	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (i · (𝑋 − (∗‘𝑋))) ∈ ℝ)
90		rimul 12178	. . . . . . . . . . 11 ⊢ (((𝑋 − (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ) → (𝑋 − (∗‘𝑋)) = 0)
91	85, 89, 90	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) = 0)
92	91	oveq1d 7404	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → ((𝑋 − (∗‘𝑋)) / (2 · i)) = (0 / (2 · i)))
93		ax-icn 11133	. . . . . . . . . . . . 13 ⊢ i ∈ ℂ
94	93	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → i ∈ ℂ)
95	33, 94	mulcld 11200	. . . . . . . . . . 11 ⊢ (𝜑 → (2 · i) ∈ ℂ)
96	95	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (2 · i) ∈ ℂ)
97		ine0 11619	. . . . . . . . . . . . 13 ⊢ i ≠ 0
98	97	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → i ≠ 0)
99	33, 94, 35, 98	mulne0d 11836	. . . . . . . . . . 11 ⊢ (𝜑 → (2 · i) ≠ 0)
100	99	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (2 · i) ≠ 0)
101	96, 100	div0d 11963	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (0 / (2 · i)) = 0)
102	72, 92, 101	3eqtrd 2769	. . . . . . . 8 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘𝑋) = 0)
103	69, 102	reim0bd 15172	. . . . . . 7 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → 𝑋 ∈ ℝ)
104	103	ex 412	. . . . . 6 ⊢ (𝜑 → ((ℑ‘((∗‘𝑋) − 𝑋)) = 0 → 𝑋 ∈ ℝ))
105	104	necon3bd 2940	. . . . 5 ⊢ (𝜑 → (¬ 𝑋 ∈ ℝ → (ℑ‘((∗‘𝑋) − 𝑋)) ≠ 0))
106	105	imp 406	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘𝑋) − 𝑋)) ≠ 0)
107	68, 106	eqnetrd 2993	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) ≠ 0)
108	8, 11, 12, 14, 17, 19, 21, 30, 58, 107	constrllcl 33752	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ Constr)
109	5, 108	pm2.61dan 812	1 ⊢ (𝜑 → (ℜ‘𝑋) ∈ Constr)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ‘cfv 6513 (class class class)co 7389 ℂcc 11072 ℝcr 11073 0cc0 11074 1c1 11075 ici 11076 + caddc 11077 · cmul 11079 − cmin 11411 -cneg 11412 / cdiv 11841 2c2 12242 ∗ccj 15068 ℜcre 15069 ℑcim 15070 Constrcconstr 33725

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 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151

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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4874 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-1o 8436 df-2o 8437 df-er 8673 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12188 df-2 12250 df-n0 12449 df-z 12536 df-cj 15071 df-re 15072 df-im 15073 df-abs 15208 df-constr 33726

This theorem is referenced by: constrimcl 33766 constrmulcl 33767

W3C validator