4sqlem18 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > 4sqlem18		GIF version

Theorem 4sqlem18 13165

Description: Lemma for 4sq 13167. Inductive step, odd prime case. (Contributed by Mario Carneiro, 16-Jul-2014.) (Revised by AV, 14-Sep-2020.)

**Hypotheses**
Ref	Expression
4sqlem11.1	⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}
4sq.2	⊢ (𝜑 → 𝑁 ∈ ℕ)
4sq.3	⊢ (𝜑 → 𝑃 = ((2 · 𝑁) + 1))
4sq.4	⊢ (𝜑 → 𝑃 ∈ ℙ)
4sq.5	⊢ (𝜑 → (0...(2 · 𝑁)) ⊆ 𝑆)
4sq.6	⊢ 𝑇 = {𝑖 ∈ ℕ ∣ (𝑖 · 𝑃) ∈ 𝑆}
4sq.7	⊢ 𝑀 = inf(𝑇, ℝ, < )

**Assertion**
Ref	Expression
4sqlem18	⊢ (𝜑 → 𝑃 ∈ 𝑆)

Distinct variable groups: 𝑖,𝑀,𝑛 𝑛,𝑁 𝑃,𝑖,𝑛,𝑤,𝑥,𝑦,𝑧 𝑆,𝑖,𝑛 𝑇,𝑖 𝜑,𝑖,𝑛 Allowed substitution hints: 𝜑(𝑥,𝑦,𝑧,𝑤) 𝑆(𝑥,𝑦,𝑧,𝑤) 𝑇(𝑥,𝑦,𝑧,𝑤,𝑛) 𝑀(𝑥,𝑦,𝑧,𝑤) 𝑁(𝑥,𝑦,𝑧,𝑤,𝑖)

Proof of Theorem 4sqlem18 Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		4sq.4	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℙ)
2		prmnn 12866	. . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
3	1, 2	syl 14	. . . 4 ⊢ (𝜑 → 𝑃 ∈ ℕ)
4	3	nncnd 9297	. . 3 ⊢ (𝜑 → 𝑃 ∈ ℂ)
5	4	mullidd 8334	. 2 ⊢ (𝜑 → (1 · 𝑃) = 𝑃)
6		4sq.7	. . . . . . . . . . . 12 ⊢ 𝑀 = inf(𝑇, ℝ, < )
7		4sqlem11.1	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}
8		4sq.2	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ ℕ)
9		4sq.3	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑃 = ((2 · 𝑁) + 1))
10		4sq.5	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (0...(2 · 𝑁)) ⊆ 𝑆)
11		4sq.6	. . . . . . . . . . . . . . 15 ⊢ 𝑇 = {𝑖 ∈ ℕ ∣ (𝑖 · 𝑃) ∈ 𝑆}
12	7, 8, 9, 1, 10, 11, 6	4sqlem13m 13160	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (∃𝑗 𝑗 ∈ 𝑇 ∧ 𝑀 < 𝑃))
13	12	simpld 112	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∃𝑗 𝑗 ∈ 𝑇)
14		1zzd 9650	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑇) → 1 ∈ ℤ)
15		nnuz 9937	. . . . . . . . . . . . . . . 16 ⊢ ℕ = (ℤ_≥‘1)
16	15	rabeqi 2814	. . . . . . . . . . . . . . 15 ⊢ {𝑖 ∈ ℕ ∣ (𝑖 · 𝑃) ∈ 𝑆} = {𝑖 ∈ (ℤ_≥‘1) ∣ (𝑖 · 𝑃) ∈ 𝑆}
17	11, 16	eqtri 2259	. . . . . . . . . . . . . 14 ⊢ 𝑇 = {𝑖 ∈ (ℤ_≥‘1) ∣ (𝑖 · 𝑃) ∈ 𝑆}
18		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑇) → 𝑗 ∈ 𝑇)
19		elfznn 10438	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖 ∈ (1...𝑗) → 𝑖 ∈ ℕ)
20	19	adantl 277	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑗)) → 𝑖 ∈ ℕ)
21	3	ad2antrr 492	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑗)) → 𝑃 ∈ ℕ)
22	20, 21	nnmulcld 9332	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑗)) → (𝑖 · 𝑃) ∈ ℕ)
23	22	nnnn0d 9599	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑗)) → (𝑖 · 𝑃) ∈ ℕ₀)
24	7	4sqlemsdc 13157	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 · 𝑃) ∈ ℕ₀ → DECID (𝑖 · 𝑃) ∈ 𝑆)
25	23, 24	syl 14	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑗)) → DECID (𝑖 · 𝑃) ∈ 𝑆)
26	14, 17, 18, 25	infssuzcldc 10646	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑇) → inf(𝑇, ℝ, < ) ∈ 𝑇)
27	13, 26	exlimddv 1954	. . . . . . . . . . . 12 ⊢ (𝜑 → inf(𝑇, ℝ, < ) ∈ 𝑇)
28	6, 27	eqeltrid 2325	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ 𝑇)
29		oveq1 6082	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑀 → (𝑖 · 𝑃) = (𝑀 · 𝑃))
30	29	eleq1d 2307	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑀 → ((𝑖 · 𝑃) ∈ 𝑆 ↔ (𝑀 · 𝑃) ∈ 𝑆))
31	30, 11	elrab2 2985	. . . . . . . . . . 11 ⊢ (𝑀 ∈ 𝑇 ↔ (𝑀 ∈ ℕ ∧ (𝑀 · 𝑃) ∈ 𝑆))
32	28, 31	sylib 122	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ (𝑀 · 𝑃) ∈ 𝑆))
33	32	simprd 114	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 · 𝑃) ∈ 𝑆)
34	7	4sqlem2 13146	. . . . . . . . 9 ⊢ ((𝑀 · 𝑃) ∈ 𝑆 ↔ ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ ∃𝑐 ∈ ℤ ∃𝑑 ∈ ℤ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))))
35	33, 34	sylib 122	. . . . . . . 8 ⊢ (𝜑 → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ ∃𝑐 ∈ ℤ ∃𝑑 ∈ ℤ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))))
36	35	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ ∃𝑐 ∈ ℤ ∃𝑑 ∈ ℤ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))))
37		simp1l 1052	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝜑)
38	37, 8	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑁 ∈ ℕ)
39	37, 9	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑃 = ((2 · 𝑁) + 1))
40	37, 1	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑃 ∈ ℙ)
41	37, 10	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → (0...(2 · 𝑁)) ⊆ 𝑆)
42		simp1r 1053	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑀 ∈ (ℤ_≥‘2))
43		simp2ll 1095	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑎 ∈ ℤ)
44		simp2lr 1096	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑏 ∈ ℤ)
45		simp2rl 1097	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑐 ∈ ℤ)
46		simp2rr 1098	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → 𝑑 ∈ ℤ)
47		eqid 2238	. . . . . . . . . . . . 13 ⊢ (((𝑎 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) = (((𝑎 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))
48		eqid 2238	. . . . . . . . . . . . 13 ⊢ (((𝑏 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) = (((𝑏 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))
49		eqid 2238	. . . . . . . . . . . . 13 ⊢ (((𝑐 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) = (((𝑐 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))
50		eqid 2238	. . . . . . . . . . . . 13 ⊢ (((𝑑 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2)) = (((𝑑 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))
51		eqid 2238	. . . . . . . . . . . . 13 ⊢ (((((((𝑎 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2) + ((((𝑏 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2)) + (((((𝑐 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2) + ((((𝑑 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2))) / 𝑀) = (((((((𝑎 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2) + ((((𝑏 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2)) + (((((𝑐 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2) + ((((𝑑 + (𝑀 / 2)) mod 𝑀) − (𝑀 / 2))↑2))) / 𝑀)
52		simp3 1030	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))))
53	7, 38, 39, 40, 41, 11, 6, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52	4sqlem17 13164	. . . . . . . . . . . 12 ⊢ ¬ ((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))))
54	53	pm2.21i 655	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) ∧ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2)))) → ¬ 𝑀 ∈ (ℤ_≥‘2))
55	54	3expia 1236	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ))) → ((𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))) → ¬ 𝑀 ∈ (ℤ_≥‘2)))
56	55	anassrs 404	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ (𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ)) ∧ (𝑐 ∈ ℤ ∧ 𝑑 ∈ ℤ)) → ((𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))) → ¬ 𝑀 ∈ (ℤ_≥‘2)))
57	56	rexlimdvva 2676	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ (𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ)) → (∃𝑐 ∈ ℤ ∃𝑑 ∈ ℤ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))) → ¬ 𝑀 ∈ (ℤ_≥‘2)))
58	57	rexlimdvva 2676	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) → (∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ ∃𝑐 ∈ ℤ ∃𝑑 ∈ ℤ (𝑀 · 𝑃) = (((𝑎↑2) + (𝑏↑2)) + ((𝑐↑2) + (𝑑↑2))) → ¬ 𝑀 ∈ (ℤ_≥‘2)))
59	36, 58	mpd 13	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ_≥‘2)) → ¬ 𝑀 ∈ (ℤ_≥‘2))
60	59	pm2.01da 645	. . . . 5 ⊢ (𝜑 → ¬ 𝑀 ∈ (ℤ_≥‘2))
61	32	simpld 112	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ)
62		elnn1uz2 9986	. . . . . 6 ⊢ (𝑀 ∈ ℕ ↔ (𝑀 = 1 ∨ 𝑀 ∈ (ℤ_≥‘2)))
63	61, 62	sylib 122	. . . . 5 ⊢ (𝜑 → (𝑀 = 1 ∨ 𝑀 ∈ (ℤ_≥‘2)))
64	60, 63	ecased 1390	. . . 4 ⊢ (𝜑 → 𝑀 = 1)
65	64, 28	eqeltrrd 2316	. . 3 ⊢ (𝜑 → 1 ∈ 𝑇)
66		oveq1 6082	. . . . . 6 ⊢ (𝑖 = 1 → (𝑖 · 𝑃) = (1 · 𝑃))
67	66	eleq1d 2307	. . . . 5 ⊢ (𝑖 = 1 → ((𝑖 · 𝑃) ∈ 𝑆 ↔ (1 · 𝑃) ∈ 𝑆))
68	67, 11	elrab2 2985	. . . 4 ⊢ (1 ∈ 𝑇 ↔ (1 ∈ ℕ ∧ (1 · 𝑃) ∈ 𝑆))
69	68	simprbi 275	. . 3 ⊢ (1 ∈ 𝑇 → (1 · 𝑃) ∈ 𝑆)
70	65, 69	syl 14	. 2 ⊢ (𝜑 → (1 · 𝑃) ∈ 𝑆)
71	5, 70	eqeltrrd 2316	1 ⊢ (𝜑 → 𝑃 ∈ 𝑆)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 720 DECID wdc 846 ∧ w3a 1009 = wceq 1402 ∃wex 1545 ∈ wcel 2209 {cab 2224 ∃wrex 2529 {crab 2532 ⊆ wss 3220 class class class wbr 4125 ‘cfv 5372 (class class class)co 6075 infcinf 7313 ℝcr 8168 0cc0 8169 1c1 8170 + caddc 8172 · cmul 8174 < clt 8350 − cmin 8487 / cdiv 8992 ℕcn 9283 2c2 9334 ℕ₀cn0 9542 ℤcz 9623 ℤ_≥cuz 9900 ...cfz 10390 mod cmo 10737 ↑cexp 10953 ℙcprime 12863

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 ax-arch 8288 ax-caucvg 8289

This theorem depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-po 4436 df-iso 4437 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-isom 5381 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-irdg 6631 df-frec 6652 df-1o 6677 df-2o 6678 df-oadd 6681 df-er 6797 df-en 7013 df-dom 7014 df-fin 7015 df-sup 7314 df-inf 7315 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 df-inn 9284 df-2 9342 df-3 9343 df-4 9344 df-n0 9543 df-z 9624 df-uz 9901 df-q 9999 df-rp 10034 df-fz 10391 df-fzo 10528 df-fl 10683 df-mod 10738 df-seqfrec 10863 df-exp 10954 df-ihash 11193 df-cj 11585 df-re 11586 df-im 11587 df-rsqrt 11742 df-abs 11743 df-dvds 12533 df-gcd 12709 df-prm 12864 df-gz 13127

This theorem is referenced by: 4sqlem19 13166

W3C validator