Theorem 4sqlem19 16900

Description: Lemma for 4sq 16901. The proof is by strong induction - we show that if all the integers less than 𝑘 are in 𝑆, then 𝑘 is as well. In this part of the proof we do the induction argument and dispense with all the cases except the odd prime case, which is sent to 4sqlem18 16899. If 𝑘 is 0, 1, 2, we show 𝑘 ∈ 𝑆 directly; otherwise if 𝑘 is composite, 𝑘 is the product of two numbers less than it (and hence in 𝑆 by assumption), so by mul4sq 16891 𝑘 ∈ 𝑆. (Contributed by Mario Carneiro, 14-Jul-2014.) (Revised by Mario Carneiro, 20-Jun-2015.)

Hypothesis

Ref	Expression
4sq.1	⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}

Assertion

Ref	Expression
4sqlem19	⊢ ℕ0 = 𝑆

Distinct variable groups:   𝑤,𝑛,𝑥,𝑦,𝑧   𝑆,𝑛

Allowed substitution hints:   𝑆(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem 4sqlem19

Dummy variables 𝑗 𝑘 𝑖 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn0 12478	. . . 4 ⊢ (𝑘 ∈ ℕ0 ↔ (𝑘 ∈ ℕ ∨ 𝑘 = 0))
2		eleq1 2819	. . . . . 6 ⊢ (𝑗 = 1 → (𝑗 ∈ 𝑆 ↔ 1 ∈ 𝑆))
3		eleq1 2819	. . . . . 6 ⊢ (𝑗 = 𝑚 → (𝑗 ∈ 𝑆 ↔ 𝑚 ∈ 𝑆))
4		eleq1 2819	. . . . . 6 ⊢ (𝑗 = 𝑖 → (𝑗 ∈ 𝑆 ↔ 𝑖 ∈ 𝑆))
5		eleq1 2819	. . . . . 6 ⊢ (𝑗 = (𝑚 · 𝑖) → (𝑗 ∈ 𝑆 ↔ (𝑚 · 𝑖) ∈ 𝑆))
6		eleq1 2819	. . . . . 6 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝑆 ↔ 𝑘 ∈ 𝑆))
7		abs1 15248	. . . . . . . . . . 11 ⊢ (abs‘1) = 1
8	7	oveq1i 7421	. . . . . . . . . 10 ⊢ ((abs‘1)↑2) = (1↑2)
9		sq1 14163	. . . . . . . . . 10 ⊢ (1↑2) = 1
10	8, 9	eqtri 2758	. . . . . . . . 9 ⊢ ((abs‘1)↑2) = 1
11		abs0 15236	. . . . . . . . . . 11 ⊢ (abs‘0) = 0
12	11	oveq1i 7421	. . . . . . . . . 10 ⊢ ((abs‘0)↑2) = (0↑2)
13		sq0 14160	. . . . . . . . . 10 ⊢ (0↑2) = 0
14	12, 13	eqtri 2758	. . . . . . . . 9 ⊢ ((abs‘0)↑2) = 0
15	10, 14	oveq12i 7423	. . . . . . . 8 ⊢ (((abs‘1)↑2) + ((abs‘0)↑2)) = (1 + 0)
16		1p0e1 12340	. . . . . . . 8 ⊢ (1 + 0) = 1
17	15, 16	eqtri 2758	. . . . . . 7 ⊢ (((abs‘1)↑2) + ((abs‘0)↑2)) = 1
18		1z 12596	. . . . . . . . 9 ⊢ 1 ∈ ℤ
19		zgz 16870	. . . . . . . . 9 ⊢ (1 ∈ ℤ → 1 ∈ ℤ[i])
20	18, 19	ax-mp 5	. . . . . . . 8 ⊢ 1 ∈ ℤ[i]
21		0z 12573	. . . . . . . . 9 ⊢ 0 ∈ ℤ
22		zgz 16870	. . . . . . . . 9 ⊢ (0 ∈ ℤ → 0 ∈ ℤ[i])
23	21, 22	ax-mp 5	. . . . . . . 8 ⊢ 0 ∈ ℤ[i]
24		4sq.1	. . . . . . . . 9 ⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}
25	24	4sqlem4a 16888	. . . . . . . 8 ⊢ ((1 ∈ ℤ[i] ∧ 0 ∈ ℤ[i]) → (((abs‘1)↑2) + ((abs‘0)↑2)) ∈ 𝑆)
26	20, 23, 25	mp2an 688	. . . . . . 7 ⊢ (((abs‘1)↑2) + ((abs‘0)↑2)) ∈ 𝑆
27	17, 26	eqeltrri 2828	. . . . . 6 ⊢ 1 ∈ 𝑆
28		eleq1 2819	. . . . . . 7 ⊢ (𝑗 = 2 → (𝑗 ∈ 𝑆 ↔ 2 ∈ 𝑆))
29		eldifsn 4789	. . . . . . . . 9 ⊢ (𝑗 ∈ (ℙ ∖ {2}) ↔ (𝑗 ∈ ℙ ∧ 𝑗 ≠ 2))
30		oddprm 16747	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (ℙ ∖ {2}) → ((𝑗 − 1) / 2) ∈ ℕ)
31	30	adantr 479	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((𝑗 − 1) / 2) ∈ ℕ)
32		eldifi 4125	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ (ℙ ∖ {2}) → 𝑗 ∈ ℙ)
33	32	adantr 479	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ ℙ)
34		prmnn 16615	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ ℙ → 𝑗 ∈ ℕ)
35		nncn 12224	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ ℕ → 𝑗 ∈ ℂ)
36	33, 34, 35	3syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ ℂ)
37		ax-1cn 11170	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℂ
38		subcl 11463	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑗 − 1) ∈ ℂ)
39	36, 37, 38	sylancl 584	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ ℂ)
40		2cnd 12294	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 ∈ ℂ)
41		2ne0 12320	. . . . . . . . . . . . . 14 ⊢ 2 ≠ 0
42	41	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 ≠ 0)
43	39, 40, 42	divcan2d 11996	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (2 · ((𝑗 − 1) / 2)) = (𝑗 − 1))
44	43	oveq1d 7426	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((2 · ((𝑗 − 1) / 2)) + 1) = ((𝑗 − 1) + 1))
45		npcan 11473	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑗 − 1) + 1) = 𝑗)
46	36, 37, 45	sylancl 584	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((𝑗 − 1) + 1) = 𝑗)
47	44, 46	eqtr2d 2771	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 = ((2 · ((𝑗 − 1) / 2)) + 1))
48	43	oveq2d 7427	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) = (0...(𝑗 − 1)))
49		nnm1nn0 12517	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ ℕ → (𝑗 − 1) ∈ ℕ0)
50	33, 34, 49	3syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ ℕ0)
51		elnn0uz 12871	. . . . . . . . . . . . . 14 ⊢ ((𝑗 − 1) ∈ ℕ0 ↔ (𝑗 − 1) ∈ (ℤ≥‘0))
52	50, 51	sylib 217	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ (ℤ≥‘0))
53		eluzfz1 13512	. . . . . . . . . . . . 13 ⊢ ((𝑗 − 1) ∈ (ℤ≥‘0) → 0 ∈ (0...(𝑗 − 1)))
54		fzsplit 13531	. . . . . . . . . . . . 13 ⊢ (0 ∈ (0...(𝑗 − 1)) → (0...(𝑗 − 1)) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
55	52, 53, 54	3syl 18	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(𝑗 − 1)) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
56	48, 55	eqtrd 2770	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
57		fz0sn 13605	. . . . . . . . . . . . . 14 ⊢ (0...0) = {0}
58	14, 14	oveq12i 7423	. . . . . . . . . . . . . . . . 17 ⊢ (((abs‘0)↑2) + ((abs‘0)↑2)) = (0 + 0)
59		00id 11393	. . . . . . . . . . . . . . . . 17 ⊢ (0 + 0) = 0
60	58, 59	eqtri 2758	. . . . . . . . . . . . . . . 16 ⊢ (((abs‘0)↑2) + ((abs‘0)↑2)) = 0
61	24	4sqlem4a 16888	. . . . . . . . . . . . . . . . 17 ⊢ ((0 ∈ ℤ[i] ∧ 0 ∈ ℤ[i]) → (((abs‘0)↑2) + ((abs‘0)↑2)) ∈ 𝑆)
62	23, 23, 61	mp2an 688	. . . . . . . . . . . . . . . 16 ⊢ (((abs‘0)↑2) + ((abs‘0)↑2)) ∈ 𝑆
63	60, 62	eqeltrri 2828	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ 𝑆
64		snssi 4810	. . . . . . . . . . . . . . 15 ⊢ (0 ∈ 𝑆 → {0} ⊆ 𝑆)
65	63, 64	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ {0} ⊆ 𝑆
66	57, 65	eqsstri 4015	. . . . . . . . . . . . 13 ⊢ (0...0) ⊆ 𝑆
67	66	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...0) ⊆ 𝑆)
68		0p1e1 12338	. . . . . . . . . . . . . 14 ⊢ (0 + 1) = 1
69	68	oveq1i 7421	. . . . . . . . . . . . 13 ⊢ ((0 + 1)...(𝑗 − 1)) = (1...(𝑗 − 1))
70		simpr 483	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆)
71		dfss3 3969	. . . . . . . . . . . . . 14 ⊢ ((1...(𝑗 − 1)) ⊆ 𝑆 ↔ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆)
72	70, 71	sylibr 233	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (1...(𝑗 − 1)) ⊆ 𝑆)
73	69, 72	eqsstrid 4029	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((0 + 1)...(𝑗 − 1)) ⊆ 𝑆)
74	67, 73	unssd 4185	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((0...0) ∪ ((0 + 1)...(𝑗 − 1))) ⊆ 𝑆)
75	56, 74	eqsstrd 4019	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) ⊆ 𝑆)
76		oveq1 7418	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑖 → (𝑘 · 𝑗) = (𝑖 · 𝑗))
77	76	eleq1d 2816	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑖 → ((𝑘 · 𝑗) ∈ 𝑆 ↔ (𝑖 · 𝑗) ∈ 𝑆))
78	77	cbvrabv 3440	. . . . . . . . . 10 ⊢ {𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆} = {𝑖 ∈ ℕ ∣ (𝑖 · 𝑗) ∈ 𝑆}
79		eqid 2730	. . . . . . . . . 10 ⊢ inf({𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆}, ℝ, < ) = inf({𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆}, ℝ, < )
80	24, 31, 47, 33, 75, 78, 79	4sqlem18 16899	. . . . . . . . 9 ⊢ ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
81	29, 80	sylanbr 580	. . . . . . . 8 ⊢ (((𝑗 ∈ ℙ ∧ 𝑗 ≠ 2) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
82	81	an32s 648	. . . . . . 7 ⊢ (((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) ∧ 𝑗 ≠ 2) → 𝑗 ∈ 𝑆)
83	10, 10	oveq12i 7423	. . . . . . . . . 10 ⊢ (((abs‘1)↑2) + ((abs‘1)↑2)) = (1 + 1)
84		df-2 12279	. . . . . . . . . 10 ⊢ 2 = (1 + 1)
85	83, 84	eqtr4i 2761	. . . . . . . . 9 ⊢ (((abs‘1)↑2) + ((abs‘1)↑2)) = 2
86	24	4sqlem4a 16888	. . . . . . . . . 10 ⊢ ((1 ∈ ℤ[i] ∧ 1 ∈ ℤ[i]) → (((abs‘1)↑2) + ((abs‘1)↑2)) ∈ 𝑆)
87	20, 20, 86	mp2an 688	. . . . . . . . 9 ⊢ (((abs‘1)↑2) + ((abs‘1)↑2)) ∈ 𝑆
88	85, 87	eqeltrri 2828	. . . . . . . 8 ⊢ 2 ∈ 𝑆
89	88	a1i 11	. . . . . . 7 ⊢ ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 ∈ 𝑆)
90	28, 82, 89	pm2.61ne 3025	. . . . . 6 ⊢ ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
91	24	mul4sq 16891	. . . . . . 7 ⊢ ((𝑚 ∈ 𝑆 ∧ 𝑖 ∈ 𝑆) → (𝑚 · 𝑖) ∈ 𝑆)
92	91	a1i 11	. . . . . 6 ⊢ ((𝑚 ∈ (ℤ≥‘2) ∧ 𝑖 ∈ (ℤ≥‘2)) → ((𝑚 ∈ 𝑆 ∧ 𝑖 ∈ 𝑆) → (𝑚 · 𝑖) ∈ 𝑆))
93	2, 3, 4, 5, 6, 27, 90, 92	prmind2 16626	. . . . 5 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ 𝑆)
94		id 22	. . . . . 6 ⊢ (𝑘 = 0 → 𝑘 = 0)
95	94, 63	eqeltrdi 2839	. . . . 5 ⊢ (𝑘 = 0 → 𝑘 ∈ 𝑆)
96	93, 95	jaoi 853	. . . 4 ⊢ ((𝑘 ∈ ℕ ∨ 𝑘 = 0) → 𝑘 ∈ 𝑆)
97	1, 96	sylbi 216	. . 3 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ 𝑆)
98	97	ssriv 3985	. 2 ⊢ ℕ0 ⊆ 𝑆
99	24	4sqlem1 16885	. 2 ⊢ 𝑆 ⊆ ℕ0
100	98, 99	eqssi 3997	1 ⊢ ℕ0 = 𝑆

Syntax hints:   → wi 4   ∧ wa 394   ∨ wo 843   = wceq 1539   ∈ wcel 2104  {cab 2707   ≠ wne 2938  ∀wral 3059  ∃wrex 3068  {crab 3430   ∖ cdif 3944   ∪ cun 3945   ⊆ wss 3947  {csn 4627  ‘cfv 6542  (class class class)co 7411  infcinf 9438  ℂcc 11110  ℝcr 11111  0cc0 11112  1c1 11113   + caddc 11115   · cmul 11117   < clt 11252   − cmin 11448   / cdiv 11875  ℕcn 12216  2c2 12271  ℕ₀cn0 12476  ℤcz 12562  ℤ_≥cuz 12826  ...cfz 13488  ↑cexp 14031  abscabs 15185  ℙcprime 16612  ℤ[i]cgz 16866

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7727  ax-cnex 11168  ax-resscn 11169  ax-1cn 11170  ax-icn 11171  ax-addcl 11172  ax-addrcl 11173  ax-mulcl 11174  ax-mulrcl 11175  ax-mulcom 11176  ax-addass 11177  ax-mulass 11178  ax-distr 11179  ax-i2m1 11180  ax-1ne0 11181  ax-1rid 11182  ax-rnegex 11183  ax-rrecex 11184  ax-cnre 11185  ax-pre-lttri 11186  ax-pre-lttrn 11187  ax-pre-ltadd 11188  ax-pre-mulgt0 11189  ax-pre-sup 11190

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6299  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7367  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7858  df-1st 7977  df-2nd 7978  df-frecs 8268  df-wrecs 8299  df-recs 8373  df-rdg 8412  df-1o 8468  df-2o 8469  df-oadd 8472  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-sup 9439  df-inf 9440  df-dju 9898  df-card 9936  df-pnf 11254  df-mnf 11255  df-xr 11256  df-ltxr 11257  df-le 11258  df-sub 11450  df-neg 11451  df-div 11876  df-nn 12217  df-2 12279  df-3 12280  df-4 12281  df-n0 12477  df-xnn0 12549  df-z 12563  df-uz 12827  df-rp 12979  df-fz 13489  df-fl 13761  df-mod 13839  df-seq 13971  df-exp 14032  df-hash 14295  df-cj 15050  df-re 15051  df-im 15052  df-sqrt 15186  df-abs 15187  df-dvds 16202  df-gcd 16440  df-prm 16613  df-gz 16867

This theorem is referenced by:  4sq  16901