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

Theorem 4sqlem19 13217
Description: Lemma for 4sq 13218. 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 13216. 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 13202 𝑘 ∈ 𝑆. (Contributed by Mario Carneiro, 14-Jul-2014.) (Revised by Mario Carneiro, 20-Jun-2015.)
Hypothesis
Ref Expression
4sqlem11.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.
StepHypRef Expression
1 elnn0 9576 . . . 4 (𝑘 ∈ ℕ0 ↔ (𝑘 ∈ ℕ ∨ 𝑘 = 0))
2 eleq1 2301 . . . . . 6 (𝑗 = 1 → (𝑗 ∈ 𝑆 ↔ 1 ∈ 𝑆))
3 eleq1 2301 . . . . . 6 (𝑗 = 𝑚 → (𝑗 ∈ 𝑆 ↔ 𝑚 ∈ 𝑆))
4 eleq1 2301 . . . . . 6 (𝑗 = 𝑖 → (𝑗 ∈ 𝑆 ↔ 𝑖 ∈ 𝑆))
5 eleq1 2301 . . . . . 6 (𝑗 = (𝑚 · 𝑖) → (𝑗 ∈ 𝑆 ↔ (𝑚 · 𝑖) ∈ 𝑆))
6 eleq1 2301 . . . . . 6 (𝑗 = 𝑘 → (𝑗 ∈ 𝑆 ↔ 𝑘 ∈ 𝑆))
7 abs1 11860 . . . . . . . . . . 11 (abs‘1) = 1
87oveq1i 6098 . . . . . . . . . 10 ((abs‘1)↑2) = (1↑2)
9 sq1 11091 . . . . . . . . . 10 (1↑2) = 1
108, 9eqtri 2259 . . . . . . . . 9 ((abs‘1)↑2) = 1
11 abs0 11846 . . . . . . . . . . 11 (abs‘0) = 0
1211oveq1i 6098 . . . . . . . . . 10 ((abs‘0)↑2) = (0↑2)
13 sq0 11088 . . . . . . . . . 10 (0↑2) = 0
1412, 13eqtri 2259 . . . . . . . . 9 ((abs‘0)↑2) = 0
1510, 14oveq12i 6100 . . . . . . . 8 (((abs‘1)↑2) + ((abs‘0)↑2)) = (1 + 0)
16 1p0e1 9429 . . . . . . . 8 (1 + 0) = 1
1715, 16eqtri 2259 . . . . . . 7 (((abs‘1)↑2) + ((abs‘0)↑2)) = 1
18 1z 9681 . . . . . . . . 9 1 ∈ ℤ
19 zgz 13181 . . . . . . . . 9 (1 ∈ ℤ → 1 ∈ ℤ[i])
2018, 19ax-mp 5 . . . . . . . 8 1 ∈ ℤ[i]
21 0z 9666 . . . . . . . . 9 0 ∈ ℤ
22 zgz 13181 . . . . . . . . 9 (0 ∈ ℤ → 0 ∈ ℤ[i])
2321, 22ax-mp 5 . . . . . . . 8 0 ∈ ℤ[i]
24 4sqlem11.1 . . . . . . . . 9 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}
25244sqlem4a 13199 . . . . . . . 8 ((1 ∈ ℤ[i] ∧ 0 ∈ ℤ[i]) → (((abs‘1)↑2) + ((abs‘0)↑2)) ∈ 𝑆)
2620, 23, 25mp2an 430 . . . . . . 7 (((abs‘1)↑2) + ((abs‘0)↑2)) ∈ 𝑆
2717, 26eqeltrri 2312 . . . . . 6 1 ∈ 𝑆
2810, 10oveq12i 6100 . . . . . . . . . 10 (((abs‘1)↑2) + ((abs‘1)↑2)) = (1 + 1)
29 df-2 9372 . . . . . . . . . 10 2 = (1 + 1)
3028, 29eqtr4i 2262 . . . . . . . . 9 (((abs‘1)↑2) + ((abs‘1)↑2)) = 2
31244sqlem4a 13199 . . . . . . . . . 10 ((1 ∈ ℤ[i] ∧ 1 ∈ ℤ[i]) → (((abs‘1)↑2) + ((abs‘1)↑2)) ∈ 𝑆)
3220, 20, 31mp2an 430 . . . . . . . . 9 (((abs‘1)↑2) + ((abs‘1)↑2)) ∈ 𝑆
3330, 32eqeltrri 2312 . . . . . . . 8 2 ∈ 𝑆
34 eleq1 2301 . . . . . . . . 9 (𝑗 = 2 → (𝑗 ∈ 𝑆 ↔ 2 ∈ 𝑆))
3534adantl 277 . . . . . . . 8 (((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) ∧ 𝑗 = 2) → (𝑗 ∈ 𝑆 ↔ 2 ∈ 𝑆))
3633, 35mpbiri 168 . . . . . . 7 (((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) ∧ 𝑗 = 2) → 𝑗 ∈ 𝑆)
37 eldifsn 3841 . . . . . . . . 9 (𝑗 ∈ (ℙ ∖ {2}) ↔ (𝑗 ∈ ℙ ∧ 𝑗 ≠ 2))
38 oddprm 13067 . . . . . . . . . . 11 (𝑗 ∈ (ℙ ∖ {2}) → ((𝑗 − 1) / 2) ∈ ℕ)
3938adantr 276 . . . . . . . . . 10 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((𝑗 − 1) / 2) ∈ ℕ)
40 eldifi 3351 . . . . . . . . . . . . . . . 16 (𝑗 ∈ (ℙ ∖ {2}) → 𝑗 ∈ ℙ)
4140adantr 276 . . . . . . . . . . . . . . 15 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ ℙ)
42 prmnn 12913 . . . . . . . . . . . . . . 15 (𝑗 ∈ ℙ → 𝑗 ∈ ℕ)
43 nncn 9321 . . . . . . . . . . . . . . 15 (𝑗 ∈ ℕ → 𝑗 ∈ ℂ)
4441, 42, 433syl 17 . . . . . . . . . . . . . 14 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ ℂ)
45 ax-1cn 8278 . . . . . . . . . . . . . 14 1 ∈ ℂ
46 subcl 8532 . . . . . . . . . . . . . 14 ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑗 − 1) ∈ ℂ)
4744, 45, 46sylancl 417 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ ℂ)
48 2cnd 9386 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 ∈ ℂ)
49 2ap0 9406 . . . . . . . . . . . . . 14 2 # 0
5049a1i 9 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 2 # 0)
5147, 48, 50divcanap2d 9130 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (2 · ((𝑗 − 1) / 2)) = (𝑗 − 1))
5251oveq1d 6103 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((2 · ((𝑗 − 1) / 2)) + 1) = ((𝑗 − 1) + 1))
53 npcan 8542 . . . . . . . . . . . 12 ((𝑗 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑗 − 1) + 1) = 𝑗)
5444, 45, 53sylancl 417 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((𝑗 − 1) + 1) = 𝑗)
5552, 54eqtr2d 2272 . . . . . . . . . 10 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 = ((2 · ((𝑗 − 1) / 2)) + 1))
5651oveq2d 6104 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) = (0...(𝑗 − 1)))
57 nnm1nn0 9615 . . . . . . . . . . . . . . 15 (𝑗 ∈ ℕ → (𝑗 − 1) ∈ ℕ0)
5841, 42, 573syl 17 . . . . . . . . . . . . . 14 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ ℕ0)
59 elnn0uz 9976 . . . . . . . . . . . . . 14 ((𝑗 − 1) ∈ ℕ0 ↔ (𝑗 − 1) ∈ (ℤ≥‘0))
6058, 59sylib 122 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 − 1) ∈ (ℤ≥‘0))
61 eluzfz1 10452 . . . . . . . . . . . . 13 ((𝑗 − 1) ∈ (ℤ≥‘0) → 0 ∈ (0...(𝑗 − 1)))
62 fzsplit 10473 . . . . . . . . . . . . 13 (0 ∈ (0...(𝑗 − 1)) → (0...(𝑗 − 1)) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
6360, 61, 623syl 17 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(𝑗 − 1)) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
6456, 63eqtrd 2271 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) = ((0...0) ∪ ((0 + 1)...(𝑗 − 1))))
65 fz0sn 10545 . . . . . . . . . . . . . 14 (0...0) = {0}
6614, 14oveq12i 6100 . . . . . . . . . . . . . . . . 17 (((abs‘0)↑2) + ((abs‘0)↑2)) = (0 + 0)
67 00id 8474 . . . . . . . . . . . . . . . . 17 (0 + 0) = 0
6866, 67eqtri 2259 . . . . . . . . . . . . . . . 16 (((abs‘0)↑2) + ((abs‘0)↑2)) = 0
69244sqlem4a 13199 . . . . . . . . . . . . . . . . 17 ((0 ∈ ℤ[i] ∧ 0 ∈ ℤ[i]) → (((abs‘0)↑2) + ((abs‘0)↑2)) ∈ 𝑆)
7023, 23, 69mp2an 430 . . . . . . . . . . . . . . . 16 (((abs‘0)↑2) + ((abs‘0)↑2)) ∈ 𝑆
7168, 70eqeltrri 2312 . . . . . . . . . . . . . . 15 0 ∈ 𝑆
72 snssi 3859 . . . . . . . . . . . . . . 15 (0 ∈ 𝑆 → {0} ⊆ 𝑆)
7371, 72ax-mp 5 . . . . . . . . . . . . . 14 {0} ⊆ 𝑆
7465, 73eqsstri 3280 . . . . . . . . . . . . 13 (0...0) ⊆ 𝑆
7574a1i 9 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...0) ⊆ 𝑆)
76 0p1e1 9427 . . . . . . . . . . . . . 14 (0 + 1) = 1
7776oveq1i 6098 . . . . . . . . . . . . 13 ((0 + 1)...(𝑗 − 1)) = (1...(𝑗 − 1))
78 simpr 110 . . . . . . . . . . . . . 14 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆)
79 dfss3 3236 . . . . . . . . . . . . . 14 ((1...(𝑗 − 1)) ⊆ 𝑆 ↔ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆)
8078, 79sylibr 134 . . . . . . . . . . . . 13 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (1...(𝑗 − 1)) ⊆ 𝑆)
8177, 80eqsstrid 3294 . . . . . . . . . . . 12 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((0 + 1)...(𝑗 − 1)) ⊆ 𝑆)
8275, 81unssd 3405 . . . . . . . . . . 11 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → ((0...0) ∪ ((0 + 1)...(𝑗 − 1))) ⊆ 𝑆)
8364, 82eqsstrd 3284 . . . . . . . . . 10 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (0...(2 · ((𝑗 − 1) / 2))) ⊆ 𝑆)
84 oveq1 6095 . . . . . . . . . . . 12 (𝑘 = 𝑖 → (𝑘 · 𝑗) = (𝑖 · 𝑗))
8584eleq1d 2307 . . . . . . . . . . 11 (𝑘 = 𝑖 → ((𝑘 · 𝑗) ∈ 𝑆 ↔ (𝑖 · 𝑗) ∈ 𝑆))
8685cbvrabv 2820 . . . . . . . . . 10 {𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆} = {𝑖 ∈ ℕ ∣ (𝑖 · 𝑗) ∈ 𝑆}
87 eqid 2238 . . . . . . . . . 10 inf({𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆}, ℝ, < ) = inf({𝑘 ∈ ℕ ∣ (𝑘 · 𝑗) ∈ 𝑆}, ℝ, < )
8824, 39, 55, 41, 83, 86, 874sqlem18 13216 . . . . . . . . 9 ((𝑗 ∈ (ℙ ∖ {2}) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
8937, 88sylanbr 285 . . . . . . . 8 (((𝑗 ∈ ℙ ∧ 𝑗 ≠ 2) ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
9089an32s 574 . . . . . . 7 (((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) ∧ 𝑗 ≠ 2) → 𝑗 ∈ 𝑆)
91 prmz 12914 . . . . . . . . . 10 (𝑗 ∈ ℙ → 𝑗 ∈ ℤ)
9291adantr 276 . . . . . . . . 9 ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ ℤ)
93 2z 9683 . . . . . . . . 9 2 ∈ ℤ
94 zdceq 9731 . . . . . . . . 9 ((𝑗 ∈ ℤ ∧ 2 ∈ ℤ) → DECID 𝑗 = 2)
9592, 93, 94sylancl 417 . . . . . . . 8 ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → DECID 𝑗 = 2)
96 dcne 2431 . . . . . . . 8 (DECID 𝑗 = 2 ↔ (𝑗 = 2 ∨ 𝑗 ≠ 2))
9795, 96sylib 122 . . . . . . 7 ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → (𝑗 = 2 ∨ 𝑗 ≠ 2))
9836, 90, 97mpjaodan 810 . . . . . 6 ((𝑗 ∈ ℙ ∧ ∀𝑚 ∈ (1...(𝑗 − 1))𝑚 ∈ 𝑆) → 𝑗 ∈ 𝑆)
9924mul4sq 13202 . . . . . . 7 ((𝑚 ∈ 𝑆 ∧ 𝑖 ∈ 𝑆) → (𝑚 · 𝑖) ∈ 𝑆)
10099a1i 9 . . . . . 6 ((𝑚 ∈ (ℤ≥‘2) ∧ 𝑖 ∈ (ℤ≥‘2)) → ((𝑚 ∈ 𝑆 ∧ 𝑖 ∈ 𝑆) → (𝑚 · 𝑖) ∈ 𝑆))
1012, 3, 4, 5, 6, 27, 98, 100prmind2 12923 . . . . 5 (𝑘 ∈ ℕ → 𝑘 ∈ 𝑆)
102 id 19 . . . . . 6 (𝑘 = 0 → 𝑘 = 0)
103102, 71eqeltrdi 2329 . . . . 5 (𝑘 = 0 → 𝑘 ∈ 𝑆)
104101, 103jaoi 728 . . . 4 ((𝑘 ∈ ℕ ∨ 𝑘 = 0) → 𝑘 ∈ 𝑆)
1051, 104sylbi 121 . . 3 (𝑘 ∈ ℕ0 → 𝑘 ∈ 𝑆)
106105ssriv 3252 . 2 ℕ0 ⊆ 𝑆
107244sqlem1 13196 . 2 𝑆 ⊆ ℕ0
108106, 107eqssi 3264 1 ℕ0 = 𝑆
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846   = wceq 1402   ∈ wcel 2209  {cab 2224   ≠ wne 2420  ∀wral 2528  ∃wrex 2529  {crab 2532   ∖ cdif 3217   ∪ cun 3218   ⊆ wss 3220  {csn 3709   class class class wbr 4131  ‘cfv 5380  (class class class)co 6088  infcinf 7329  ℂcc 8183  ℝcr 8184  0cc0 8185  1c1 8186   + caddc 8188   · cmul 8190   < clt 8366   − cmin 8504   # cap 8917   / cdiv 9010  ℕcn 9313  2c2 9364  ℕ0cn0 9574  ℤcz 9655  ℤ≥cuz 9937  ...cfz 10428  ↑cexp 10996  abscabs 11785  ℙcprime 12910  ℤ[i]cgz 13177
This proof depends on 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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
This proof 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-xor 1425  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 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-2o 6692  df-oadd 6695  df-er 6811  df-en 7027  df-dom 7028  df-fin 7029  df-sup 7330  df-inf 7331  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-fz 10429  df-fzo 10567  df-fl 10722  df-mod 10781  df-seqfrec 10906  df-exp 10997  df-ihash 11237  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-dvds 12580  df-gcd 12756  df-prm 12911  df-gz 13178
This theorem is used by:  4sq  13218
  Copyright terms: Public domain W3C validator