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 47858

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 488	. . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℚ)
2		qcn 13071	. . 3 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℂ)
3		sqrtcl 15509	. . 3 ⊢ (𝐴 ∈ ℂ → (√‘𝐴) ∈ ℂ)
4	1, 2, 3	3syl 19	. 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (√‘𝐴) ∈ ℂ)
5		fveq1 6876	. . . 4 ⊢ (𝑥 = ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) → (𝑥‘(√‘𝐴)) = (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)))
6	5	eqeq1d 2763	. . 3 ⊢ (𝑥 = ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) → ((𝑥‘(√‘𝐴)) = 0 ↔ (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = 0))
7		qsscn 13068	. . . . . . 7 ⊢ ℚ ⊆ ℂ
8		1z 12707	. . . . . . . 8 ⊢ 1 ∈ ℤ
9		zq 13062	. . . . . . . 8 ⊢ (1 ∈ ℤ → 1 ∈ ℚ)
10	8, 9	ax-mp 5	. . . . . . 7 ⊢ 1 ∈ ℚ
11		2nn0 12604	. . . . . . 7 ⊢ 2 ∈ ℕ₀
12		plypow 26503	. . . . . . 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 26504	. . . . . 6 ⊢ ((ℚ ⊆ ℂ ∧ 𝐴 ∈ ℚ) → (ℂ × {𝐴}) ∈ (Poly‘ℚ))
17	15, 1, 16	syl2anc 596	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ × {𝐴}) ∈ (Poly‘ℚ))
18		qaddcl 13074	. . . . . 6 ⊢ ((𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ) → (𝑥 + 𝑝) ∈ ℚ)
19	18	adantl 487	. . . . 5 ⊢ (((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) ∧ (𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ)) → (𝑥 + 𝑝) ∈ ℚ)
20		qmulcl 13076	. . . . . 6 ⊢ ((𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ) → (𝑥 · 𝑝) ∈ ℚ)
21	20	adantl 487	. . . . 5 ⊢ (((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) ∧ (𝑥 ∈ ℚ ∧ 𝑝 ∈ ℚ)) → (𝑥 · 𝑝) ∈ ℚ)
22		neg1z 12713	. . . . . . 7 ⊢ -1 ∈ ℤ
23		zq 13062	. . . . . . 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 26518	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ∈ (Poly‘ℚ))
27		0cnd 11280	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 0 ∈ ℂ)
28		fnconstg 6762	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℚ → (ℂ × {𝐴}) Fn ℂ)
29	28	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ × {𝐴}) Fn ℂ)
30		ovex 7445	. . . . . . . . . . 11 ⊢ (𝑡↑2) ∈ V
31	30	rgenw 3081	. . . . . . . . . 10 ⊢ ∀𝑡 ∈ ℂ (𝑡↑2) ∈ V
32		nfcv 2923	. . . . . . . . . . 11 ⊢ Ⅎ𝑡ℂ
33	32	mptfnf 6666	. . . . . . . . . 10 ⊢ (∀𝑡 ∈ ℂ (𝑡↑2) ∈ V ↔ (𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ)
34	31, 33	mpbi 233	. . . . . . . . 9 ⊢ (𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ
35	29, 34	jctil 529	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ ∧ (ℂ × {𝐴}) Fn ℂ))
36		cnex 11262	. . . . . . . . . 10 ⊢ ℂ ∈ V
37		0cn 11279	. . . . . . . . . 10 ⊢ 0 ∈ ℂ
38	36, 37	pm3.2i 476	. . . . . . . . 9 ⊢ (ℂ ∈ V ∧ 0 ∈ ℂ)
39	38	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ ∈ V ∧ 0 ∈ ℂ))
40		fnfvof 7699	. . . . . . . 8 ⊢ ((((𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ ∧ (ℂ × {𝐴}) Fn ℂ) ∧ (ℂ ∈ V ∧ 0 ∈ ℂ)) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) − ((ℂ × {𝐴})‘0)))
41	35, 39, 40	syl2anc 596	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) − ((ℂ × {𝐴})‘0)))
42		oveq1 7419	. . . . . . . . . . . 12 ⊢ (𝑡 = 0 → (𝑡↑2) = (0↑2))
43		eqid 2761	. . . . . . . . . . . 12 ⊢ (𝑡 ∈ ℂ ↦ (𝑡↑2)) = (𝑡 ∈ ℂ ↦ (𝑡↑2))
44		ovex 7445	. . . . . . . . . . . 12 ⊢ (0↑2) ∈ V
45	42, 43, 44	fvmpt 6985	. . . . . . . . . . 11 ⊢ (0 ∈ ℂ → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = (0↑2))
46	37, 45	ax-mp 5	. . . . . . . . . 10 ⊢ ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = (0↑2)
47		sq0 14315	. . . . . . . . . 10 ⊢ (0↑2) = 0
48	46, 47	eqtri 2784	. . . . . . . . 9 ⊢ ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = 0
49	48	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) = 0)
50		fvconst2g 7200	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℚ ∧ 0 ∈ ℂ) → ((ℂ × {𝐴})‘0) = 𝐴)
51	1, 27, 50	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((ℂ × {𝐴})‘0) = 𝐴)
52	49, 51	oveq12d 7430	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘0) − ((ℂ × {𝐴})‘0)) = (0 − 𝐴))
53	41, 52	eqtrd 2796	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) = (0 − 𝐴))
54	2	adantr 486	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ)
55		necom 3009	. . . . . . . 8 ⊢ (𝐴 ≠ 0 ↔ 0 ≠ 𝐴)
56	55	bilani 510	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → 0 ≠ 𝐴)
57	27, 54, 56	subne0d 11660	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (0 − 𝐴) ≠ 0)
58	53, 57	eqnetrd 3023	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) ≠ 0)
59		ne0p 26505	. . . . 5 ⊢ ((0 ∈ ℂ ∧ (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘0) ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ≠ 0_𝑝)
60	27, 58, 59	syl2anc 596	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ≠ 0_𝑝)
61	26, 60	eldifsnd 4750	. . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴})) ∈ ((Poly‘ℚ) ∖ {0_𝑝}))
62	4, 36	jctil 529	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (ℂ ∈ V ∧ (√‘𝐴) ∈ ℂ))
63		fnfvof 7699	. . . . . 6 ⊢ ((((𝑡 ∈ ℂ ↦ (𝑡↑2)) Fn ℂ ∧ (ℂ × {𝐴}) Fn ℂ) ∧ (ℂ ∈ V ∧ (√‘𝐴) ∈ ℂ)) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) − ((ℂ × {𝐴})‘(√‘𝐴))))
64	35, 62, 63	syl2anc 596	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) − ((ℂ × {𝐴})‘(√‘𝐴))))
65		oveq1 7419	. . . . . . . . 9 ⊢ (𝑡 = (√‘𝐴) → (𝑡↑2) = ((√‘𝐴)↑2))
66		ovex 7445	. . . . . . . . 9 ⊢ ((√‘𝐴)↑2) ∈ V
67	65, 43, 66	fvmpt 6985	. . . . . . . 8 ⊢ ((√‘𝐴) ∈ ℂ → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) = ((√‘𝐴)↑2))
68	54, 3, 67	3syl 19	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) = ((√‘𝐴)↑2))
69		sqrtth 15512	. . . . . . . 8 ⊢ (𝐴 ∈ ℂ → ((√‘𝐴)↑2) = 𝐴)
70	1, 2, 69	3syl 19	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((√‘𝐴)↑2) = 𝐴)
71	68, 70	eqtrd 2796	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) = 𝐴)
72		fvconst2g 7200	. . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ (√‘𝐴) ∈ ℂ) → ((ℂ × {𝐴})‘(√‘𝐴)) = 𝐴)
73	1, 4, 72	syl2anc 596	. . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ((ℂ × {𝐴})‘(√‘𝐴)) = 𝐴)
74	71, 73	oveq12d 7430	. . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2))‘(√‘𝐴)) − ((ℂ × {𝐴})‘(√‘𝐴))) = (𝐴 − 𝐴))
75	64, 74	eqtrd 2796	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = (𝐴 − 𝐴))
76		subid 11558	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴 − 𝐴) = 0)
77	1, 2, 76	3syl 19	. . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (𝐴 − 𝐴) = 0)
78	75, 77	eqtrd 2796	. . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (((𝑡 ∈ ℂ ↦ (𝑡↑2)) ∘_f − (ℂ × {𝐴}))‘(√‘𝐴)) = 0)
79	6, 61, 78	rspcedvdw 3580	. 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → ∃𝑥 ∈ ((Poly‘ℚ) ∖ {0_𝑝})(𝑥‘(√‘𝐴)) = 0)
80		elqaa 26627	. 2 ⊢ ((√‘𝐴) ∈ 𝔸 ↔ ((√‘𝐴) ∈ ℂ ∧ ∃𝑥 ∈ ((Poly‘ℚ) ∖ {0_𝑝})(𝑥‘(√‘𝐴)) = 0))
81	4, 79, 80	sylanbrc 595	1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (√‘𝐴) ∈ 𝔸)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 ∃wrex 3087 Vcvv 3451 ∖ cdif 3896 ⊆ wss 3899 {csn 4584 ↦ cmpt 5186 × cxp 5649 Fn wfn 6526 ‘cfv 6531 (class class class)co 7412 ∘_f cof 7680 ℂcc 11179 0cc0 11181 1c1 11182 + caddc 11184 · cmul 11186 − cmin 11522 -cneg 11523 2c2 12378 ℕ₀cn0 12587 ℤcz 12674 ℚcq 13056 ↑cexp 14184 √csqrt 15380 0_𝑝c0p 25970 Polycply 26482 𝔸caa 26619

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7682 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-er 8701 df-map 8833 df-pm 8834 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-inf 9419 df-oi 9488 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-q 13057 df-rp 13102 df-fz 13621 df-fzo 13769 df-fl 13912 df-mod 13990 df-seq 14125 df-exp 14185 df-hash 14455 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-clim 15635 df-rlim 15636 df-sum 15834 df-0p 25971 df-ply 26486 df-coe 26488 df-dgr 26489 df-aa 26620

This theorem is used by: sqrtqaa 47859

W3C validator