sqrtnzqaa - Mathbox for Ender Ting

	Mathbox for Ender Ting		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > sqrtnzqaa		Structured version Visualization version GIF version

Theorem sqrtnzqaa 47588

Description: Square root of a nonzero rational is algebraic. (Contributed by Ender Ting, 22-Jul-2026.)

**Assertion**
Ref	Expression
sqrtnzqaa	⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (√‘𝐴) ∈ 𝔸)

Proof of Theorem sqrtnzqaa Dummy variables 𝑥 𝑡 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 487	. . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℚ)
2		qcn 12988	. . 3 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℂ)
3		sqrtcl 15415	. . 3 ⊢ (𝐴 ∈ ℂ → (√‘𝐴) ∈ ℂ)
4	1, 2, 3	3syl 19	. 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (√‘𝐴) ∈ ℂ)
5		fveq1 6882	. . . 4 ⊢ (𝑥 = ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) → (𝑥‘(√‘𝐴)) = (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)))
6	5	eqeq1d 2765	. . 3 ⊢ (𝑥 = ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) → ((𝑥‘(√‘𝐴)) = 0 ↔ (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = 0))
7		qsscn 12985	. . . . . . 7 ⊢ ℚ ⊆ ℂ
8		1z 12625	. . . . . . . 8 ⊢ 1 ∈ ℤ
9		zq 12979	. . . . . . . 8 ⊢ (1 ∈ ℤ → 1 ∈ ℚ)
10	8, 9	ax-mp 5	. . . . . . 7 ⊢ 1 ∈ ℚ
11		2nn0 12522	. . . . . . 7 ⊢ 2 ∈ ℕ₀
12		plypow 26343	. . . . . . 7 ⊢ ((ℚ ⊆ ℂ ∧ 1 ∈ ℚ ∧ 2 ∈ ℕ₀) → (𝑡 ∈ ℂ ↦ (𝑡↑2)) ∈ (Poly‘ℚ))
13	7, 10, 11, 12	mp3an 1490	. . . . . 6 ⊢ (𝑡 ∈ ℂ ↦ (𝑡↑2)) ∈ (Poly‘ℚ)
14	13	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (𝑡 ∈ ℂ ↦ (𝑡↑2)) ∈ (Poly‘ℚ))
15	7	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ℚ ⊆ ℂ)
16		plyconst 26344	. . . . . 6 ⊢ ((ℚ ⊆ ℂ ∧ 𝐴 ∈ ℚ) → (ℂ × {𝐴}) ∈ (Poly‘ℚ))
17	15, 1, 16	syl2anc 595	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ × {𝐴}) ∈ (Poly‘ℚ))
18		qaddcl 12990	. . . . . 6 ⊢ ((𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ) → (𝑥 + 𝑝) ∈ ℚ)
19	18	adantl 486	. . . . 5 ⊢ (((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) ∧ (𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ)) → (𝑥 + 𝑝) ∈ ℚ)
20		qmulcl 12992	. . . . . 6 ⊢ ((𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ) → (𝑥 · 𝑝) ∈ ℚ)
21	20	adantl 486	. . . . 5 ⊢ (((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) ∧ (𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ)) → (𝑥 · 𝑝) ∈ ℚ)
22		neg1z 12631	. . . . . . 7 ⊢ -1 ∈ ℤ
23		zq 12979	. . . . . . 7 ⊢ (-1 ∈ ℤ → -1 ∈ ℚ)
24	22, 23	ax-mp 5	. . . . . 6 ⊢ -1 ∈ ℚ
25	24	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → -1 ∈ ℚ)
26	14, 17, 19, 21, 25	plysub 26357	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ∈ (Poly‘ℚ))
27		0cnd 11200	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 0 ∈ ℂ)
28		fnconstg 6768	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℚ → (ℂ × {𝐴}) Fn ℂ)
29	28	adantr 485	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ × {𝐴}) Fn ℂ)
30		ovex 7445	. . . . . . . . . . 11 ⊢ (𝑡↑2) ∈ V
31	30	rgenw 3083	. . . . . . . . . 10 ⊢ ∀𝑡 ∈ ℂ (𝑡↑2) ∈ V
32		nfcv 2925	. . . . . . . . . . 11 ⊢ Ⅎ𝑡ℂ
33	32	mptfnf 6672	. . . . . . . . . 10 ⊢ (∀𝑡 ∈ ℂ (𝑡↑2) ∈ V ↔ (𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ)
34	31, 33	mpbi 233	. . . . . . . . 9 ⊢ (𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ
35	29, 34	jctil 528	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ ∧ (ℂ × {𝐴}) Fn ℂ))
36		cnex 11182	. . . . . . . . . 10 ⊢ ℂ ∈ V
37		0cn 11199	. . . . . . . . . 10 ⊢ 0 ∈ ℂ
38	36, 37	pm3.2i 475	. . . . . . . . 9 ⊢ (ℂ ∈ V ∧ 0 ∈ ℂ)
39	38	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ ∈ V ∧ 0 ∈ ℂ))
40		fnfvof 7693	. . . . . . . 8 ⊢ ((((𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ ∧ (ℂ × {𝐴}) Fn ℂ) ∧ (ℂ ∈ V ∧ 0 ∈ ℂ)) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) − ((ℂ × {𝐴})‘0)))
41	35, 39, 40	syl2anc 595	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) − ((ℂ × {𝐴})‘0)))
42		oveq1 7419	. . . . . . . . . . . 12 ⊢ (𝑡 = 0 → (𝑡↑2) = (0↑2))
43		eqid 2763	. . . . . . . . . . . 12 ⊢ (𝑡 ∈ ℂ ↦ (𝑡↑2)) = (𝑡 ∈ ℂ ↦ (𝑡↑2))
44		ovex 7445	. . . . . . . . . . . 12 ⊢ (0↑2) ∈ V
45	42, 43, 44	fvmpt 6991	. . . . . . . . . . 11 ⊢ (0 ∈ ℂ → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = (0↑2))
46	37, 45	ax-mp 5	. . . . . . . . . 10 ⊢ ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = (0↑2)
47		sq0 14230	. . . . . . . . . 10 ⊢ (0↑2) = 0
48	46, 47	eqtri 2786	. . . . . . . . 9 ⊢ ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = 0
49	48	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = 0)
50		fvconst2g 7202	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℚ ∧ 0 ∈ ℂ) → ((ℂ × {𝐴})‘0) = 𝐴)
51	1, 27, 50	syl2anc 595	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((ℂ × {𝐴})‘0) = 𝐴)
52	49, 51	oveq12d 7430	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) − ((ℂ × {𝐴})‘0)) = (0 − 𝐴))
53	41, 52	eqtrd 2798	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) = (0 − 𝐴))
54	2	adantr 485	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ)
55		necom 3011	. . . . . . . . 9 ⊢ (𝐴 ≠ 0 ↔ 0 ≠ 𝐴)
56	55	biimpi 219	. . . . . . . 8 ⊢ (𝐴 ≠ 0 → 0 ≠ 𝐴)
57	56	adantl 486	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 0 ≠ 𝐴)
58	27, 54, 57	subne0d 11579	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (0 − 𝐴) ≠ 0)
59	53, 58	eqnetrd 3025	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) ≠ 0)
60		ne0p 26345	. . . . 5 ⊢ ((0 ∈ ℂ ∧ (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ≠ 0_𝑝)
61	27, 59, 60	syl2anc 595	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ≠ 0_𝑝)
62	26, 61	eldifsnd 4756	. . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ∈ ((Poly‘ℚ) ∖ {0_𝑝}))
63	4, 36	jctil 528	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ ∈ V ∧ (√‘𝐴) ∈ ℂ))
64		fnfvof 7693	. . . . . 6 ⊢ ((((𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ ∧ (ℂ × {𝐴}) Fn ℂ) ∧ (ℂ ∈ V ∧ (√‘𝐴) ∈ ℂ)) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) − ((ℂ × {𝐴})‘(√‘𝐴))))
65	35, 63, 64	syl2anc 595	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) − ((ℂ × {𝐴})‘(√‘𝐴))))
66		oveq1 7419	. . . . . . . . 9 ⊢ (𝑡 = (√‘𝐴) → (𝑡↑2) = ((√‘𝐴)↑2))
67		ovex 7445	. . . . . . . . 9 ⊢ ((√‘𝐴)↑2) ∈ V
68	66, 43, 67	fvmpt 6991	. . . . . . . 8 ⊢ ((√‘𝐴) ∈ ℂ → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) = ((√‘𝐴)↑2))
69	54, 3, 68	3syl 19	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) = ((√‘𝐴)↑2))
70		sqrtth 15418	. . . . . . . 8 ⊢ (𝐴 ∈ ℂ → ((√‘𝐴)↑2) = 𝐴)
71	1, 2, 70	3syl 19	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((√‘𝐴)↑2) = 𝐴)
72	69, 71	eqtrd 2798	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) = 𝐴)
73		fvconst2g 7202	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ (√‘𝐴) ∈ ℂ) → ((ℂ × {𝐴})‘(√‘𝐴)) = 𝐴)
74	1, 4, 73	syl2anc 595	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((ℂ × {𝐴})‘(√‘𝐴)) = 𝐴)
75	72, 74	oveq12d 7430	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) − ((ℂ × {𝐴})‘(√‘𝐴))) = (𝐴 − 𝐴))
76	65, 75	eqtrd 2798	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = (𝐴 − 𝐴))
77		subid 11478	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴 − 𝐴) = 0)
78	1, 2, 77	3syl 19	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (𝐴 − 𝐴) = 0)
79	76, 78	eqtrd 2798	. . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = 0)
80	6, 62, 79	rspcedvdw 3585	. 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ∃𝑥 ∈ ((Poly‘ℚ) ∖ {0_𝑝})(𝑥‘(√‘𝐴)) = 0)
81		elqaa 26464	. 2 ⊢ ((√‘𝐴) ∈ 𝔸 ↔ ((√‘𝐴) ∈ ℂ ∧ ∃𝑥 ∈ ((Poly‘ℚ) ∖ {0_𝑝})(𝑥‘(√‘𝐴)) = 0))
82	4, 80, 81	sylanbrc 594	1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (√‘𝐴) ∈ 𝔸)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 ∃wrex 3089 Vcvv 3455 ∖ cdif 3903 ⊆ wss 3906 {csn 4590 ↦ cmpt 5193 × cxp 5661 Fn wfn 6533 ‘cfv 6538 (class class class)co 7412 ∘_f cof 7674 ℂcc 11099 0cc0 11101 1c1 11102 + caddc 11104 · cmul 11106 − cmin 11442 -cneg 11443 2c2 12296 ℕ₀cn0 12505 ℤcz 12592 ℚcq 12973 ↑cexp 14099 √csqrt 15286 0_𝑝c0p 25809 Polycply 26322 𝔸caa 26456

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 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-inf2 9611 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179

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 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7676 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-er 8695 df-map 8827 df-pm 8828 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-inf 9404 df-oi 9473 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-z 12593 df-uz 12864 df-q 12974 df-rp 13018 df-fz 13537 df-fzo 13685 df-fl 13827 df-mod 13905 df-seq 14040 df-exp 14100 df-hash 14369 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-clim 15541 df-rlim 15542 df-sum 15740 df-0p 25810 df-ply 26326 df-coe 26328 df-dgr 26329 df-aa 26457

This theorem is referenced by: sqrtqaa 47589

W3C validator