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 34159

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 489	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → 𝑋 ∈ ℝ)
2	1	rered 15271	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = 𝑋)
3		constrcjcl.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ Constr)
4	3	adantr 485	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → 𝑋 ∈ Constr)
5	2, 4	eqeltrd 2863	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ Constr)
6		0zd 12598	. . . . 5 ⊢ (𝜑 → 0 ∈ ℤ)
7	6	zconstr 34154	. . . 4 ⊢ (𝜑 → 0 ∈ Constr)
8	7	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 0 ∈ Constr)
9		1zzd 12620	. . . . 5 ⊢ (𝜑 → 1 ∈ ℤ)
10	9	zconstr 34154	. . . 4 ⊢ (𝜑 → 1 ∈ Constr)
11	10	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 1 ∈ Constr)
12	3	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → 𝑋 ∈ Constr)
13	3	constrcjcl 34158	. . . 4 ⊢ (𝜑 → (∗‘𝑋) ∈ Constr)
14	13	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (∗‘𝑋) ∈ Constr)
15	3	constrcn 34150	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ ℂ)
16	15	recld 15241	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℝ)
17	16	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ ℝ)
18		halfre 12452	. . . 4 ⊢ (1 / 2) ∈ ℝ
19	18	a1i 11	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (1 / 2) ∈ ℝ)
20	16	recnd 11232	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℂ)
21	20	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ ℂ)
22		1cnd 11197	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℂ)
23	22	subid1d 11553	. . . . . . . 8 ⊢ (𝜑 → (1 − 0) = 1)
24	23, 22	eqeltrd 2863	. . . . . . 7 ⊢ (𝜑 → (1 − 0) ∈ ℂ)
25	20, 24	mulcld 11224	. . . . . 6 ⊢ (𝜑 → ((ℜ‘𝑋) · (1 − 0)) ∈ ℂ)
26	25	addlidd 11406	. . . . 5 ⊢ (𝜑 → (0 + ((ℜ‘𝑋) · (1 − 0))) = ((ℜ‘𝑋) · (1 − 0)))
27	23	oveq2d 7426	. . . . 5 ⊢ (𝜑 → ((ℜ‘𝑋) · (1 − 0)) = ((ℜ‘𝑋) · 1))
28	20	mulridd 11221	. . . . 5 ⊢ (𝜑 → ((ℜ‘𝑋) · 1) = (ℜ‘𝑋))
29	26, 27, 28	3eqtrrd 2803	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) = (0 + ((ℜ‘𝑋) · (1 − 0))))
30	29	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = (0 + ((ℜ‘𝑋) · (1 − 0))))
31	15	cjcld 15243	. . . . . . 7 ⊢ (𝜑 → (∗‘𝑋) ∈ ℂ)
32	15, 31	addcld 11223	. . . . . 6 ⊢ (𝜑 → (𝑋 + (∗‘𝑋)) ∈ ℂ)
33		2cnd 12314	. . . . . 6 ⊢ (𝜑 → 2 ∈ ℂ)
34		2ne0 12342	. . . . . . 7 ⊢ 2 ≠ 0
35	34	a1i 11	. . . . . 6 ⊢ (𝜑 → 2 ≠ 0)
36	32, 33, 35	divrec2d 11990	. . . . 5 ⊢ (𝜑 → ((𝑋 + (∗‘𝑋)) / 2) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
37		reval 15153	. . . . . 6 ⊢ (𝑋 ∈ ℂ → (ℜ‘𝑋) = ((𝑋 + (∗‘𝑋)) / 2))
38	15, 37	syl 18	. . . . 5 ⊢ (𝜑 → (ℜ‘𝑋) = ((𝑋 + (∗‘𝑋)) / 2))
39	18	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
40	39	recnd 11232	. . . . . . . 8 ⊢ (𝜑 → (1 / 2) ∈ ℂ)
41	40, 31, 15	subdid 11665	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · ((∗‘𝑋) − 𝑋)) = (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋)))
42	41	oveq2d 7426	. . . . . 6 ⊢ (𝜑 → (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))) = (𝑋 + (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋))))
43	40, 15	mulcld 11224	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · 𝑋) ∈ ℂ)
44	40, 31	mulcld 11224	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · (∗‘𝑋)) ∈ ℂ)
45	15, 43, 44	subadd23d 11586	. . . . . 6 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = (𝑋 + (((1 / 2) · (∗‘𝑋)) − ((1 / 2) · 𝑋))))
46	22, 40, 15	subdird 11666	. . . . . . . . 9 ⊢ (𝜑 → ((1 − (1 / 2)) · 𝑋) = ((1 · 𝑋) − ((1 / 2) · 𝑋)))
47		1mhlfehlf 12458	. . . . . . . . . . 11 ⊢ (1 − (1 / 2)) = (1 / 2)
48	47	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (1 − (1 / 2)) = (1 / 2))
49	48	oveq1d 7425	. . . . . . . . 9 ⊢ (𝜑 → ((1 − (1 / 2)) · 𝑋) = ((1 / 2) · 𝑋))
50	15	mullidd 11222	. . . . . . . . . 10 ⊢ (𝜑 → (1 · 𝑋) = 𝑋)
51	50	oveq1d 7425	. . . . . . . . 9 ⊢ (𝜑 → ((1 · 𝑋) − ((1 / 2) · 𝑋)) = (𝑋 − ((1 / 2) · 𝑋)))
52	46, 49, 51	3eqtr3rd 2807	. . . . . . . 8 ⊢ (𝜑 → (𝑋 − ((1 / 2) · 𝑋)) = ((1 / 2) · 𝑋))
53	52	oveq1d 7425	. . . . . . 7 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = (((1 / 2) · 𝑋) + ((1 / 2) · (∗‘𝑋))))
54	40, 15, 31	adddid 11228	. . . . . . 7 ⊢ (𝜑 → ((1 / 2) · (𝑋 + (∗‘𝑋))) = (((1 / 2) · 𝑋) + ((1 / 2) · (∗‘𝑋))))
55	53, 54	eqtr4d 2801	. . . . . 6 ⊢ (𝜑 → ((𝑋 − ((1 / 2) · 𝑋)) + ((1 / 2) · (∗‘𝑋))) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
56	42, 45, 55	3eqtr2d 2804	. . . . 5 ⊢ (𝜑 → (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))) = ((1 / 2) · (𝑋 + (∗‘𝑋))))
57	36, 38, 56	3eqtr4d 2808	. . . 4 ⊢ (𝜑 → (ℜ‘𝑋) = (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))))
58	57	adantr 485	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) = (𝑋 + ((1 / 2) · ((∗‘𝑋) − 𝑋))))
59	23	fveq2d 6885	. . . . . . . . 9 ⊢ (𝜑 → (∗‘(1 − 0)) = (∗‘1))
60		1red 11204	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℝ)
61	60	cjred 15273	. . . . . . . . 9 ⊢ (𝜑 → (∗‘1) = 1)
62	59, 61	eqtrd 2798	. . . . . . . 8 ⊢ (𝜑 → (∗‘(1 − 0)) = 1)
63	62	oveq1d 7425	. . . . . . 7 ⊢ (𝜑 → ((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋)) = (1 · ((∗‘𝑋) − 𝑋)))
64	31, 15	subcld 11564	. . . . . . . 8 ⊢ (𝜑 → ((∗‘𝑋) − 𝑋) ∈ ℂ)
65	64	mullidd 11222	. . . . . . 7 ⊢ (𝜑 → (1 · ((∗‘𝑋) − 𝑋)) = ((∗‘𝑋) − 𝑋))
66	63, 65	eqtrd 2798	. . . . . 6 ⊢ (𝜑 → ((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋)) = ((∗‘𝑋) − 𝑋))
67	66	fveq2d 6885	. . . . 5 ⊢ (𝜑 → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) = (ℑ‘((∗‘𝑋) − 𝑋)))
68	67	adantr 485	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) = (ℑ‘((∗‘𝑋) − 𝑋)))
69	15	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → 𝑋 ∈ ℂ)
70		imval2 15198	. . . . . . . . . . 11 ⊢ (𝑋 ∈ ℂ → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
71	15, 70	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
72	71	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘𝑋) = ((𝑋 − (∗‘𝑋)) / (2 · i)))
73	15, 31	subcld 11564	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 − (∗‘𝑋)) ∈ ℂ)
74	73	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) ∈ ℂ)
75	64	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → ((∗‘𝑋) − 𝑋) ∈ ℂ)
76	75	imnegd 15257	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘-((∗‘𝑋) − 𝑋)) = -(ℑ‘((∗‘𝑋) − 𝑋)))
77	31	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (∗‘𝑋) ∈ ℂ)
78	77, 69	negsubdi2d 11580	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → -((∗‘𝑋) − 𝑋) = (𝑋 − (∗‘𝑋)))
79	78	fveq2d 6885	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘-((∗‘𝑋) − 𝑋)) = (ℑ‘(𝑋 − (∗‘𝑋))))
80		simpr 489	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘((∗‘𝑋) − 𝑋)) = 0)
81	80	negeqd 11446	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → -(ℑ‘((∗‘𝑋) − 𝑋)) = -0)
82	76, 79, 81	3eqtr3d 2806	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘(𝑋 − (∗‘𝑋))) = -0)
83		neg0 11499	. . . . . . . . . . . . 13 ⊢ -0 = 0
84	82, 83	eqtrdi 2814	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘(𝑋 − (∗‘𝑋))) = 0)
85	74, 84	reim0bd 15247	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) ∈ ℝ)
86		cjth 15150	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ ℂ → ((𝑋 + (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ))
87	15, 86	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑋 + (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ))
88	87	simprd 500	. . . . . . . . . . . 12 ⊢ (𝜑 → (i · (𝑋 − (∗‘𝑋))) ∈ ℝ)
89	88	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (i · (𝑋 − (∗‘𝑋))) ∈ ℝ)
90		rimul 12204	. . . . . . . . . . 11 ⊢ (((𝑋 − (∗‘𝑋)) ∈ ℝ ∧ (i · (𝑋 − (∗‘𝑋))) ∈ ℝ) → (𝑋 − (∗‘𝑋)) = 0)
91	85, 89, 90	syl2anc 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (𝑋 − (∗‘𝑋)) = 0)
92	91	oveq1d 7425	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → ((𝑋 − (∗‘𝑋)) / (2 · i)) = (0 / (2 · i)))
93		ax-icn 11154	. . . . . . . . . . . . 13 ⊢ i ∈ ℂ
94	93	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → i ∈ ℂ)
95	33, 94	mulcld 11224	. . . . . . . . . . 11 ⊢ (𝜑 → (2 · i) ∈ ℂ)
96	95	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (2 · i) ∈ ℂ)
97		ine0 11644	. . . . . . . . . . . . 13 ⊢ i ≠ 0
98	97	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → i ≠ 0)
99	33, 94, 35, 98	mulne0d 11861	. . . . . . . . . . 11 ⊢ (𝜑 → (2 · i) ≠ 0)
100	99	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (2 · i) ≠ 0)
101	96, 100	div0d 11985	. . . . . . . . 9 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (0 / (2 · i)) = 0)
102	72, 92, 101	3eqtrd 2802	. . . . . . . 8 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → (ℑ‘𝑋) = 0)
103	69, 102	reim0bd 15247	. . . . . . 7 ⊢ ((𝜑 ∧ (ℑ‘((∗‘𝑋) − 𝑋)) = 0) → 𝑋 ∈ ℝ)
104	103	ex 417	. . . . . 6 ⊢ (𝜑 → ((ℑ‘((∗‘𝑋) − 𝑋)) = 0 → 𝑋 ∈ ℝ))
105	104	necon3bd 2972	. . . . 5 ⊢ (𝜑 → (¬ 𝑋 ∈ ℝ → (ℑ‘((∗‘𝑋) − 𝑋)) ≠ 0))
106	105	imp 411	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘𝑋) − 𝑋)) ≠ 0)
107	68, 106	eqnetrd 3025	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℑ‘((∗‘(1 − 0)) · ((∗‘𝑋) − 𝑋))) ≠ 0)
108	8, 11, 12, 14, 17, 19, 21, 30, 58, 107	constrllcl 34146	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ ℝ) → (ℜ‘𝑋) ∈ Constr)
109	5, 108	pm2.61dan 824	1 ⊢ (𝜑 → (ℜ‘𝑋) ∈ Constr)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ‘cfv 6536 (class class class)co 7410 ℂcc 11093 ℝcr 11094 0cc0 11095 1c1 11096 ici 11097 + caddc 11098 · cmul 11100 − cmin 11436 -cneg 11437 / cdiv 11866 2c2 12290 ∗ccj 15143 ℜcre 15144 ℑcim 15145 Constrcconstr 34119

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 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 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-n0 12500 df-z 12587 df-cj 15146 df-re 15147 df-im 15148 df-abs 15283 df-constr 34120

This theorem is referenced by: constrimcl 34160 constrmulcl 34161

W3C validator