2sqnn0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 2sqnn0		Structured version Visualization version GIF version

Theorem 2sqnn0 27165

Description: All primes of the form 4𝑘 + 1 are sums of squares of two nonnegative integers. (Contributed by AV, 3-Jun-2023.)

**Assertion**
Ref	Expression
2sqnn0	⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → ∃𝑥 ∈ ℕ₀ ∃𝑦 ∈ ℕ₀ 𝑃 = ((𝑥↑2) + (𝑦↑2)))

Distinct variable group: 𝑥,𝑃,𝑦

Proof of Theorem 2sqnn0 Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		2sq 27157	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2)))
2		elnn0z 12575	. . . . . . . . 9 ⊢ (𝑎 ∈ ℕ₀ ↔ (𝑎 ∈ ℤ ∧ 0 ≤ 𝑎))
3	2	biimpri 227	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤ ∧ 0 ≤ 𝑎) → 𝑎 ∈ ℕ₀)
4		elznn0 12577	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℤ ↔ (𝑎 ∈ ℝ ∧ (𝑎 ∈ ℕ₀ ∨ -𝑎 ∈ ℕ₀)))
5		nn0ge0 12501	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ ℕ₀ → 0 ≤ 𝑎)
6	5	pm2.24d 151	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ ℕ₀ → (¬ 0 ≤ 𝑎 → -𝑎 ∈ ℕ₀))
7	6	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ ℝ → (𝑎 ∈ ℕ₀ → (¬ 0 ≤ 𝑎 → -𝑎 ∈ ℕ₀)))
8		ax-1 6	. . . . . . . . . . . . 13 ⊢ (-𝑎 ∈ ℕ₀ → (¬ 0 ≤ 𝑎 → -𝑎 ∈ ℕ₀))
9	8	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ ℝ → (-𝑎 ∈ ℕ₀ → (¬ 0 ≤ 𝑎 → -𝑎 ∈ ℕ₀)))
10	7, 9	jaod 857	. . . . . . . . . . 11 ⊢ (𝑎 ∈ ℝ → ((𝑎 ∈ ℕ₀ ∨ -𝑎 ∈ ℕ₀) → (¬ 0 ≤ 𝑎 → -𝑎 ∈ ℕ₀)))
11	10	imp 407	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ (𝑎 ∈ ℕ₀ ∨ -𝑎 ∈ ℕ₀)) → (¬ 0 ≤ 𝑎 → -𝑎 ∈ ℕ₀))
12	4, 11	sylbi 216	. . . . . . . . 9 ⊢ (𝑎 ∈ ℤ → (¬ 0 ≤ 𝑎 → -𝑎 ∈ ℕ₀))
13	12	imp 407	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤ ∧ ¬ 0 ≤ 𝑎) → -𝑎 ∈ ℕ₀)
14	3, 13	ifclda 4563	. . . . . . 7 ⊢ (𝑎 ∈ ℤ → if(0 ≤ 𝑎, 𝑎, -𝑎) ∈ ℕ₀)
15	14	adantr 481	. . . . . 6 ⊢ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) → if(0 ≤ 𝑎, 𝑎, -𝑎) ∈ ℕ₀)
16	15	adantr 481	. . . . 5 ⊢ (((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ 𝑃 = ((𝑎↑2) + (𝑏↑2))) → if(0 ≤ 𝑎, 𝑎, -𝑎) ∈ ℕ₀)
17		elnn0z 12575	. . . . . . . . 9 ⊢ (𝑏 ∈ ℕ₀ ↔ (𝑏 ∈ ℤ ∧ 0 ≤ 𝑏))
18	17	biimpri 227	. . . . . . . 8 ⊢ ((𝑏 ∈ ℤ ∧ 0 ≤ 𝑏) → 𝑏 ∈ ℕ₀)
19		elznn0 12577	. . . . . . . . . 10 ⊢ (𝑏 ∈ ℤ ↔ (𝑏 ∈ ℝ ∧ (𝑏 ∈ ℕ₀ ∨ -𝑏 ∈ ℕ₀)))
20		nn0ge0 12501	. . . . . . . . . . . . . 14 ⊢ (𝑏 ∈ ℕ₀ → 0 ≤ 𝑏)
21	20	pm2.24d 151	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ ℕ₀ → (¬ 0 ≤ 𝑏 → -𝑏 ∈ ℕ₀))
22	21	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ ℝ → (𝑏 ∈ ℕ₀ → (¬ 0 ≤ 𝑏 → -𝑏 ∈ ℕ₀)))
23		ax-1 6	. . . . . . . . . . . . 13 ⊢ (-𝑏 ∈ ℕ₀ → (¬ 0 ≤ 𝑏 → -𝑏 ∈ ℕ₀))
24	23	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ ℝ → (-𝑏 ∈ ℕ₀ → (¬ 0 ≤ 𝑏 → -𝑏 ∈ ℕ₀)))
25	22, 24	jaod 857	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ℝ → ((𝑏 ∈ ℕ₀ ∨ -𝑏 ∈ ℕ₀) → (¬ 0 ≤ 𝑏 → -𝑏 ∈ ℕ₀)))
26	25	imp 407	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ℝ ∧ (𝑏 ∈ ℕ₀ ∨ -𝑏 ∈ ℕ₀)) → (¬ 0 ≤ 𝑏 → -𝑏 ∈ ℕ₀))
27	19, 26	sylbi 216	. . . . . . . . 9 ⊢ (𝑏 ∈ ℤ → (¬ 0 ≤ 𝑏 → -𝑏 ∈ ℕ₀))
28	27	imp 407	. . . . . . . 8 ⊢ ((𝑏 ∈ ℤ ∧ ¬ 0 ≤ 𝑏) → -𝑏 ∈ ℕ₀)
29	18, 28	ifclda 4563	. . . . . . 7 ⊢ (𝑏 ∈ ℤ → if(0 ≤ 𝑏, 𝑏, -𝑏) ∈ ℕ₀)
30	29	adantl 482	. . . . . 6 ⊢ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) → if(0 ≤ 𝑏, 𝑏, -𝑏) ∈ ℕ₀)
31	30	adantr 481	. . . . 5 ⊢ (((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ 𝑃 = ((𝑎↑2) + (𝑏↑2))) → if(0 ≤ 𝑏, 𝑏, -𝑏) ∈ ℕ₀)
32		elznn0nn 12576	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℤ ↔ (𝑎 ∈ ℕ₀ ∨ (𝑎 ∈ ℝ ∧ -𝑎 ∈ ℕ)))
33	5	iftrued 4536	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ ℕ₀ → if(0 ≤ 𝑎, 𝑎, -𝑎) = 𝑎)
34	33	eqcomd 2738	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ ℕ₀ → 𝑎 = if(0 ≤ 𝑎, 𝑎, -𝑎))
35	34	oveq1d 7426	. . . . . . . . . . 11 ⊢ (𝑎 ∈ ℕ₀ → (𝑎↑2) = (if(0 ≤ 𝑎, 𝑎, -𝑎)↑2))
36		elnnz 12572	. . . . . . . . . . . . . . . 16 ⊢ (-𝑎 ∈ ℕ ↔ (-𝑎 ∈ ℤ ∧ 0 < -𝑎))
37		lt0neg1 11724	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 ∈ ℝ → (𝑎 < 0 ↔ 0 < -𝑎))
38		id 22	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 ∈ ℝ → 𝑎 ∈ ℝ)
39		0red 11221	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 ∈ ℝ → 0 ∈ ℝ)
40	38, 39	ltnled 11365	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ ℝ → (𝑎 < 0 ↔ ¬ 0 ≤ 𝑎))
41	40	biimpd 228	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 ∈ ℝ → (𝑎 < 0 → ¬ 0 ≤ 𝑎))
42	37, 41	sylbird 259	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 ∈ ℝ → (0 < -𝑎 → ¬ 0 ≤ 𝑎))
43	42	com12 32	. . . . . . . . . . . . . . . 16 ⊢ (0 < -𝑎 → (𝑎 ∈ ℝ → ¬ 0 ≤ 𝑎))
44	36, 43	simplbiim 505	. . . . . . . . . . . . . . 15 ⊢ (-𝑎 ∈ ℕ → (𝑎 ∈ ℝ → ¬ 0 ≤ 𝑎))
45	44	impcom 408	. . . . . . . . . . . . . 14 ⊢ ((𝑎 ∈ ℝ ∧ -𝑎 ∈ ℕ) → ¬ 0 ≤ 𝑎)
46	45	iffalsed 4539	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℝ ∧ -𝑎 ∈ ℕ) → if(0 ≤ 𝑎, 𝑎, -𝑎) = -𝑎)
47	46	oveq1d 7426	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ ℝ ∧ -𝑎 ∈ ℕ) → (if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) = (-𝑎↑2))
48		recn 11202	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ ℝ → 𝑎 ∈ ℂ)
49		sqneg 14085	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ ℂ → (-𝑎↑2) = (𝑎↑2))
50	48, 49	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ ℝ → (-𝑎↑2) = (𝑎↑2))
51	50	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ ℝ ∧ -𝑎 ∈ ℕ) → (-𝑎↑2) = (𝑎↑2))
52	47, 51	eqtr2d 2773	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ ℝ ∧ -𝑎 ∈ ℕ) → (𝑎↑2) = (if(0 ≤ 𝑎, 𝑎, -𝑎)↑2))
53	35, 52	jaoi 855	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℕ₀ ∨ (𝑎 ∈ ℝ ∧ -𝑎 ∈ ℕ)) → (𝑎↑2) = (if(0 ≤ 𝑎, 𝑎, -𝑎)↑2))
54	32, 53	sylbi 216	. . . . . . . . 9 ⊢ (𝑎 ∈ ℤ → (𝑎↑2) = (if(0 ≤ 𝑎, 𝑎, -𝑎)↑2))
55		elznn0nn 12576	. . . . . . . . . 10 ⊢ (𝑏 ∈ ℤ ↔ (𝑏 ∈ ℕ₀ ∨ (𝑏 ∈ ℝ ∧ -𝑏 ∈ ℕ)))
56	20	iftrued 4536	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ ℕ₀ → if(0 ≤ 𝑏, 𝑏, -𝑏) = 𝑏)
57	56	eqcomd 2738	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ ℕ₀ → 𝑏 = if(0 ≤ 𝑏, 𝑏, -𝑏))
58	57	oveq1d 7426	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ℕ₀ → (𝑏↑2) = (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))
59		elnnz 12572	. . . . . . . . . . . . . . . 16 ⊢ (-𝑏 ∈ ℕ ↔ (-𝑏 ∈ ℤ ∧ 0 < -𝑏))
60		lt0neg1 11724	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ ℝ → (𝑏 < 0 ↔ 0 < -𝑏))
61		id 22	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 ∈ ℝ → 𝑏 ∈ ℝ)
62		0red 11221	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 ∈ ℝ → 0 ∈ ℝ)
63	61, 62	ltnled 11365	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 ∈ ℝ → (𝑏 < 0 ↔ ¬ 0 ≤ 𝑏))
64	63	biimpd 228	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ ℝ → (𝑏 < 0 → ¬ 0 ≤ 𝑏))
65	60, 64	sylbird 259	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 ∈ ℝ → (0 < -𝑏 → ¬ 0 ≤ 𝑏))
66	65	com12 32	. . . . . . . . . . . . . . . 16 ⊢ (0 < -𝑏 → (𝑏 ∈ ℝ → ¬ 0 ≤ 𝑏))
67	59, 66	simplbiim 505	. . . . . . . . . . . . . . 15 ⊢ (-𝑏 ∈ ℕ → (𝑏 ∈ ℝ → ¬ 0 ≤ 𝑏))
68	67	impcom 408	. . . . . . . . . . . . . 14 ⊢ ((𝑏 ∈ ℝ ∧ -𝑏 ∈ ℕ) → ¬ 0 ≤ 𝑏)
69	68	iffalsed 4539	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ ℝ ∧ -𝑏 ∈ ℕ) → if(0 ≤ 𝑏, 𝑏, -𝑏) = -𝑏)
70	69	oveq1d 7426	. . . . . . . . . . . 12 ⊢ ((𝑏 ∈ ℝ ∧ -𝑏 ∈ ℕ) → (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2) = (-𝑏↑2))
71		recn 11202	. . . . . . . . . . . . . 14 ⊢ (𝑏 ∈ ℝ → 𝑏 ∈ ℂ)
72		sqneg 14085	. . . . . . . . . . . . . 14 ⊢ (𝑏 ∈ ℂ → (-𝑏↑2) = (𝑏↑2))
73	71, 72	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ ℝ → (-𝑏↑2) = (𝑏↑2))
74	73	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝑏 ∈ ℝ ∧ -𝑏 ∈ ℕ) → (-𝑏↑2) = (𝑏↑2))
75	70, 74	eqtr2d 2773	. . . . . . . . . . 11 ⊢ ((𝑏 ∈ ℝ ∧ -𝑏 ∈ ℕ) → (𝑏↑2) = (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))
76	58, 75	jaoi 855	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ℕ₀ ∨ (𝑏 ∈ ℝ ∧ -𝑏 ∈ ℕ)) → (𝑏↑2) = (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))
77	55, 76	sylbi 216	. . . . . . . . 9 ⊢ (𝑏 ∈ ℤ → (𝑏↑2) = (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))
78	54, 77	oveqan12d 7430	. . . . . . . 8 ⊢ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) → ((𝑎↑2) + (𝑏↑2)) = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2)))
79	78	eqeq2d 2743	. . . . . . 7 ⊢ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) → (𝑃 = ((𝑎↑2) + (𝑏↑2)) ↔ 𝑃 = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))))
80	79	biimpd 228	. . . . . 6 ⊢ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) → (𝑃 = ((𝑎↑2) + (𝑏↑2)) → 𝑃 = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))))
81	80	imp 407	. . . . 5 ⊢ (((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ 𝑃 = ((𝑎↑2) + (𝑏↑2))) → 𝑃 = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2)))
82		oveq1 7418	. . . . . . . 8 ⊢ (𝑥 = if(0 ≤ 𝑎, 𝑎, -𝑎) → (𝑥↑2) = (if(0 ≤ 𝑎, 𝑎, -𝑎)↑2))
83	82	oveq1d 7426	. . . . . . 7 ⊢ (𝑥 = if(0 ≤ 𝑎, 𝑎, -𝑎) → ((𝑥↑2) + (𝑦↑2)) = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (𝑦↑2)))
84	83	eqeq2d 2743	. . . . . 6 ⊢ (𝑥 = if(0 ≤ 𝑎, 𝑎, -𝑎) → (𝑃 = ((𝑥↑2) + (𝑦↑2)) ↔ 𝑃 = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (𝑦↑2))))
85		oveq1 7418	. . . . . . . 8 ⊢ (𝑦 = if(0 ≤ 𝑏, 𝑏, -𝑏) → (𝑦↑2) = (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))
86	85	oveq2d 7427	. . . . . . 7 ⊢ (𝑦 = if(0 ≤ 𝑏, 𝑏, -𝑏) → ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (𝑦↑2)) = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2)))
87	86	eqeq2d 2743	. . . . . 6 ⊢ (𝑦 = if(0 ≤ 𝑏, 𝑏, -𝑏) → (𝑃 = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (𝑦↑2)) ↔ 𝑃 = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))))
88	84, 87	rspc2ev 3624	. . . . 5 ⊢ ((if(0 ≤ 𝑎, 𝑎, -𝑎) ∈ ℕ₀ ∧ if(0 ≤ 𝑏, 𝑏, -𝑏) ∈ ℕ₀ ∧ 𝑃 = ((if(0 ≤ 𝑎, 𝑎, -𝑎)↑2) + (if(0 ≤ 𝑏, 𝑏, -𝑏)↑2))) → ∃𝑥 ∈ ℕ₀ ∃𝑦 ∈ ℕ₀ 𝑃 = ((𝑥↑2) + (𝑦↑2)))
89	16, 31, 81, 88	syl3anc 1371	. . . 4 ⊢ (((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) ∧ 𝑃 = ((𝑎↑2) + (𝑏↑2))) → ∃𝑥 ∈ ℕ₀ ∃𝑦 ∈ ℕ₀ 𝑃 = ((𝑥↑2) + (𝑦↑2)))
90	89	ex 413	. . 3 ⊢ ((𝑎 ∈ ℤ ∧ 𝑏 ∈ ℤ) → (𝑃 = ((𝑎↑2) + (𝑏↑2)) → ∃𝑥 ∈ ℕ₀ ∃𝑦 ∈ ℕ₀ 𝑃 = ((𝑥↑2) + (𝑦↑2))))
91	90	rexlimivv 3199	. 2 ⊢ (∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2)) → ∃𝑥 ∈ ℕ₀ ∃𝑦 ∈ ℕ₀ 𝑃 = ((𝑥↑2) + (𝑦↑2)))
92	1, 91	syl 17	1 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → ∃𝑥 ∈ ℕ₀ ∃𝑦 ∈ ℕ₀ 𝑃 = ((𝑥↑2) + (𝑦↑2)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 ∃wrex 3070 ifcif 4528 class class class wbr 5148 (class class class)co 7411 ℂcc 11110 ℝcr 11111 0cc0 11112 1c1 11113 + caddc 11115 < clt 11252 ≤ cle 11253 -cneg 11449 ℕcn 12216 2c2 12271 4c4 12273 ℕ₀cn0 12476 ℤcz 12562 mod cmo 13838 ↑cexp 14031 ℙcprime 16612

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 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 ax-addf 11191 ax-mulf 11192

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7672 df-ofr 7673 df-om 7858 df-1st 7977 df-2nd 7978 df-supp 8149 df-tpos 8213 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-ec 8707 df-qs 8711 df-map 8824 df-pm 8825 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9364 df-sup 9439 df-inf 9440 df-oi 9507 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-5 12282 df-6 12283 df-7 12284 df-8 12285 df-9 12286 df-n0 12477 df-xnn0 12549 df-z 12563 df-dec 12682 df-uz 12827 df-q 12937 df-rp 12979 df-fz 13489 df-fzo 13632 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-phi 16703 df-pc 16774 df-gz 16867 df-struct 17084 df-sets 17101 df-slot 17119 df-ndx 17131 df-base 17149 df-ress 17178 df-plusg 17214 df-mulr 17215 df-starv 17216 df-sca 17217 df-vsca 17218 df-ip 17219 df-tset 17220 df-ple 17221 df-ds 17223 df-unif 17224 df-hom 17225 df-cco 17226 df-0g 17391 df-gsum 17392 df-prds 17397 df-pws 17399 df-imas 17458 df-qus 17459 df-mre 17534 df-mrc 17535 df-acs 17537 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-mhm 18705 df-submnd 18706 df-grp 18858 df-minusg 18859 df-sbg 18860 df-mulg 18987 df-subg 19039 df-nsg 19040 df-eqg 19041 df-ghm 19128 df-cntz 19222 df-cmn 19691 df-abl 19692 df-mgp 20029 df-rng 20047 df-ur 20076 df-srg 20081 df-ring 20129 df-cring 20130 df-oppr 20225 df-dvdsr 20248 df-unit 20249 df-invr 20279 df-dvr 20292 df-rhm 20363 df-nzr 20404 df-subrng 20434 df-subrg 20459 df-drng 20502 df-field 20503 df-lmod 20616 df-lss 20687 df-lsp 20727 df-sra 20930 df-rgmod 20931 df-lidl 20932 df-rsp 20933 df-2idl 21006 df-rlreg 21099 df-domn 21100 df-idom 21101 df-cnfld 21145 df-zring 21218 df-zrh 21272 df-zn 21275 df-assa 21627 df-asp 21628 df-ascl 21629 df-psr 21681 df-mvr 21682 df-mpl 21683 df-opsr 21685 df-evls 21854 df-evl 21855 df-psr1 21923 df-vr1 21924 df-ply1 21925 df-coe1 21926 df-evl1 22055 df-mdeg 25794 df-deg1 25795 df-mon1 25872 df-uc1p 25873 df-q1p 25874 df-r1p 25875 df-lgs 27022

This theorem is referenced by: 2sqnn 27166 2sqreulem1 27173

W3C validator