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 33926

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 15147	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = 𝑋)
3		constrcjcl.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ Constr)
4	3	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → 𝑋 ∈ Constr)
5	2, 4	eqeltrd 2836	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ Constr)
6		0zd 12500	. . . . 5 ⊢ (𝜑 → 0 ∈ ℤ)
7	6	zconstr 33921	. . . 4 ⊢ (𝜑 → 0 ∈ Constr)
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 0 ∈ Constr)
9		1zzd 12522	. . . . 5 ⊢ (𝜑 → 1 ∈ ℤ)
10	9	zconstr 33921	. . . 4 ⊢ (𝜑 → 1 ∈ Constr)
11	10	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 1 ∈ Constr)
12	3	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 𝑋 ∈ Constr)
13	3	constrcjcl 33925	. . . 4 ⊢ (𝜑 → (∗‘𝑋) ∈ Constr)
14	13	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (∗‘𝑋) ∈ Constr)
15	3	constrcn 33917	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ ℂ)
16	15	recld 15117	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℝ)
17	16	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ ℝ)
18		halfre 12354	. . . 4 ⊢ (1 / 2) ∈ ℝ
19	18	a1i 11	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (1 / 2) ∈ ℝ)
20	16	recnd 11160	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℂ)
21	20	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ ℂ)
22		1cnd 11127	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℂ)
23	22	subid1d 11481	. . . . . . . 8 ⊢ (𝜑 → (1 − 0) = 1)
24	23, 22	eqeltrd 2836	. . . . . . 7 ⊢ (𝜑 → (1 − 0) ∈ ℂ)
25	20, 24	mulcld 11152	. . . . . 6 ⊢ (𝜑 → ((ℜ‘𝑋) · (1 − 0)) ∈ ℂ)
26	25	addlidd 11334	. . . . 5 ⊢ (𝜑 → (0 + ((ℜ‘𝑋) · (1 − 0))) = ((ℜ‘𝑋) · (1 − 0)))
27	23	oveq2d 7374	. . . . 5 ⊢ (𝜑 → ((ℜ‘𝑋) · (1 − 0)) = ((ℜ‘𝑋) · 1))
28	20	mulridd 11149	. . . . 5 ⊢ (𝜑 → ((ℜ‘𝑋) · 1) = (ℜ‘𝑋))
29	26, 27, 28	3eqtrrd 2776	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) = (0 + ((ℜ‘𝑋) · (1 − 0))))
30	29	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = (0 + ((ℜ‘𝑋) · (1 − 0))))
31	15	cjcld 15119	. . . . . . 7 ⊢ (𝜑 → (∗‘𝑋) ∈ ℂ)
32	15, 31	addcld 11151	. . . . . 6 ⊢ (𝜑 → (𝑋 + (∗‘𝑋)) ∈ ℂ)
33		2cnd 12223	. . . . . 6 ⊢ (𝜑 → 2 ∈ ℂ)
34		2ne0 12249	. . . . . . 7 ⊢ 2 ≠ 0
35	34	a1i 11	. . . . . 6 ⊢ (𝜑 → 2 ≠ 0)
36	32, 33, 35	divrec2d 11921	. . . . 5 ⊢ (𝜑 → ((𝑋 + (∗‘𝑋)) / 2) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
37		reval 15029	. . . . . 6 ⊢ (𝑋 ∈ ℂ → (ℜ‘𝑋) = ((𝑋 + (∗‘𝑋)) / 2))
38	15, 37	syl 17	. . . . 5 ⊢ (𝜑 → (ℜ‘𝑋) = ((𝑋 + (∗‘𝑋)) / 2))
39	18	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
40	39	recnd 11160	. . . . . . . 8 ⊢ (𝜑 → (1 / 2) ∈ ℂ)
41	40, 31, 15	subdid 11593	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · ((∗‘𝑋) − 𝑋)) = (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋)))
42	41	oveq2d 7374	. . . . . 6 ⊢ (𝜑 → (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))) = (𝑋 + (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋))))
43	40, 15	mulcld 11152	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · 𝑋) ∈ ℂ)
44	40, 31	mulcld 11152	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · (∗‘𝑋)) ∈ ℂ)
45	15, 43, 44	subadd23d 11514	. . . . . 6 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = (𝑋 + (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋))))
46	22, 40, 15	subdird 11594	. . . . . . . . 9 ⊢ (𝜑 → ((1 − (1 / 2)) · 𝑋) = ((1 · 𝑋) − ((1 / 2) · 𝑋)))
47		1mhlfehlf 12360	. . . . . . . . . . 11 ⊢ (1 − (1 / 2)) = (1 / 2)
48	47	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (1 − (1 / 2)) = (1 / 2))
49	48	oveq1d 7373	. . . . . . . . 9 ⊢ (𝜑 → ((1 − (1 / 2)) · 𝑋) = ((1 / 2) · 𝑋))
50	15	mullidd 11150	. . . . . . . . . 10 ⊢ (𝜑 → (1 · 𝑋) = 𝑋)
51	50	oveq1d 7373	. . . . . . . . 9 ⊢ (𝜑 → ((1 · 𝑋) − ((1 / 2) · 𝑋)) = (𝑋 − ((1 / 2) · 𝑋)))
52	46, 49, 51	3eqtr3rd 2780	. . . . . . . 8 ⊢ (𝜑 → (𝑋 − ((1 / 2) · 𝑋)) = ((1 / 2) · 𝑋))
53	52	oveq1d 7373	. . . . . . 7 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = (((1 / 2) · 𝑋) + ((1 / 2) · (∗‘𝑋))))
54	40, 15, 31	adddid 11156	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · (𝑋 + (∗‘𝑋))) = (((1 / 2) · 𝑋) + ((1 / 2) · (∗‘𝑋))))
55	53, 54	eqtr4d 2774	. . . . . 6 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
56	42, 45, 55	3eqtr2d 2777	. . . . 5 ⊢ (𝜑 → (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
57	36, 38, 56	3eqtr4d 2781	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) = (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))))
58	57	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))))
59	23	fveq2d 6838	. . . . . . . . 9 ⊢ (𝜑 → (∗‘(1 − 0)) = (∗‘1))
60		1red 11133	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℝ)
61	60	cjred 15149	. . . . . . . . 9 ⊢ (𝜑 → (∗‘1) = 1)
62	59, 61	eqtrd 2771	. . . . . . . 8 ⊢ (𝜑 → (∗‘(1 − 0)) = 1)
63	62	oveq1d 7373	. . . . . . 7 ⊢ (𝜑 → ((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋)) = (1 · ((∗‘𝑋) − 𝑋)))
64	31, 15	subcld 11492	. . . . . . . 8 ⊢ (𝜑 → ((∗‘𝑋) − 𝑋) ∈ ℂ)
65	64	mullidd 11150	. . . . . . 7 ⊢ (𝜑 → (1 · ((∗‘𝑋) − 𝑋)) = ((∗‘𝑋) − 𝑋))
66	63, 65	eqtrd 2771	. . . . . 6 ⊢ (𝜑 → ((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋)) = ((∗‘𝑋) − 𝑋))
67	66	fveq2d 6838	. . . . 5 ⊢ (𝜑 → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) = (ℑ‘((∗‘𝑋) − 𝑋)))
68	67	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) = (ℑ‘((∗‘𝑋) − 𝑋)))
69	15	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → 𝑋 ∈ ℂ)
70		imval2 15074	. . . . . . . . . . 11 ⊢ (𝑋 ∈ ℂ → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
71	15, 70	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
72	71	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
73	15, 31	subcld 11492	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 − (∗‘𝑋)) ∈ ℂ)
74	73	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) ∈ ℂ)
75	64	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → ((∗‘𝑋) − 𝑋) ∈ ℂ)
76	75	imnegd 15133	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘-((∗‘𝑋) − 𝑋)) = -(ℑ‘((∗‘𝑋) − 𝑋)))
77	31	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (∗‘𝑋) ∈ ℂ)
78	77, 69	negsubdi2d 11508	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → -((∗‘𝑋) − 𝑋) = (𝑋 − (∗‘𝑋)))
79	78	fveq2d 6838	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘-((∗‘𝑋) − 𝑋)) = (ℑ‘(𝑋 − (∗‘𝑋))))
80		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘((∗‘𝑋) − 𝑋)) = 0)
81	80	negeqd 11374	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → -(ℑ‘((∗‘𝑋) − 𝑋)) = -0)
82	76, 79, 81	3eqtr3d 2779	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘(𝑋 − (∗‘𝑋))) = -0)
83		neg0 11427	. . . . . . . . . . . . 13 ⊢ -0 = 0
84	82, 83	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘(𝑋 − (∗‘𝑋))) = 0)
85	74, 84	reim0bd 15123	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) ∈ ℝ)
86		cjth 15026	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ ℂ → ((𝑋 + (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ))
87	15, 86	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑋 + (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ))
88	87	simprd 495	. . . . . . . . . . . 12 ⊢ (𝜑 → (i · (𝑋 − (∗‘𝑋))) ∈ ℝ)
89	88	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (i · (𝑋 − (∗‘𝑋))) ∈ ℝ)
90		rimul 12136	. . . . . . . . . . 11 ⊢ (((𝑋 − (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ) → (𝑋 − (∗‘𝑋)) = 0)
91	85, 89, 90	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) = 0)
92	91	oveq1d 7373	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → ((𝑋 − (∗‘𝑋)) / (2 · i)) = (0 / (2 · i)))
93		ax-icn 11085	. . . . . . . . . . . . 13 ⊢ i ∈ ℂ
94	93	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → i ∈ ℂ)
95	33, 94	mulcld 11152	. . . . . . . . . . 11 ⊢ (𝜑 → (2 · i) ∈ ℂ)
96	95	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (2 · i) ∈ ℂ)
97		ine0 11572	. . . . . . . . . . . . 13 ⊢ i ≠ 0
98	97	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → i ≠ 0)
99	33, 94, 35, 98	mulne0d 11789	. . . . . . . . . . 11 ⊢ (𝜑 → (2 · i) ≠ 0)
100	99	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (2 · i) ≠ 0)
101	96, 100	div0d 11916	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (0 / (2 · i)) = 0)
102	72, 92, 101	3eqtrd 2775	. . . . . . . 8 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘𝑋) = 0)
103	69, 102	reim0bd 15123	. . . . . . 7 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → 𝑋 ∈ ℝ)
104	103	ex 412	. . . . . 6 ⊢ (𝜑 → ((ℑ‘((∗‘𝑋) − 𝑋)) = 0 → 𝑋 ∈ ℝ))
105	104	necon3bd 2946	. . . . 5 ⊢ (𝜑 → (¬ 𝑋 ∈ ℝ → (ℑ‘((∗‘𝑋) − 𝑋)) ≠ 0))
106	105	imp 406	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘𝑋) − 𝑋)) ≠ 0)
107	68, 106	eqnetrd 2999	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) ≠ 0)
108	8, 11, 12, 14, 17, 19, 21, 30, 58, 107	constrllcl 33913	. 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 1541 ∈ wcel 2113 ≠ wne 2932 ‘cfv 6492 (class class class)co 7358 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 ici 11028 + caddc 11029 · cmul 11031 − cmin 11364 -cneg 11365 / cdiv 11794 2c2 12200 ∗ccj 15019 ℜcre 15020 ℑcim 15021 Constrcconstr 33886

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-n0 12402 df-z 12489 df-cj 15022 df-re 15023 df-im 15024 df-abs 15159 df-constr 33887

This theorem is referenced by: constrimcl 33927 constrmulcl 33928

W3C validator