2sqreunnltlem - Metamath Proof Explorer

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

Theorem 2sqreunnltlem 27512

Description: Lemma for 2sqreunnlt 27522. (Contributed by AV, 4-Jun-2023.) Specialization to different integers, proposed by GL. (Revised by AV, 11-Jun-2023.)

**Assertion**
Ref	Expression
2sqreunnltlem	⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃))

Distinct variable group: 𝑃,𝑎,𝑏

**Proof of Theorem 2sqreunnltlem**
Step	Hyp	Ref	Expression
1		2sqreunnlem1 27511	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 ≤ 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃))
2		oveq1 7455	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = 𝑎 → (𝑏↑2) = (𝑎↑2))
3	2	oveq2d 7464	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑎 → ((𝑎↑2) + (𝑏↑2)) = ((𝑎↑2) + (𝑎↑2)))
4	3	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑏 = 𝑎 ∧ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ)) → ((𝑎↑2) + (𝑏↑2)) = ((𝑎↑2) + (𝑎↑2)))
5		nncn 12301	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 ∈ ℕ → 𝑎 ∈ ℂ)
6	5	sqcld 14194	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 ∈ ℕ → (𝑎↑2) ∈ ℂ)
7		2times 12429	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎↑2) ∈ ℂ → (2 · (𝑎↑2)) = ((𝑎↑2) + (𝑎↑2)))
8	7	eqcomd 2746	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎↑2) ∈ ℂ → ((𝑎↑2) + (𝑎↑2)) = (2 · (𝑎↑2)))
9	6, 8	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑎 ∈ ℕ → ((𝑎↑2) + (𝑎↑2)) = (2 · (𝑎↑2)))
10	9	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) → ((𝑎↑2) + (𝑎↑2)) = (2 · (𝑎↑2)))
11	10	ad2antrl 727	. . . . . . . . . . . . 13 ⊢ ((𝑏 = 𝑎 ∧ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ)) → ((𝑎↑2) + (𝑎↑2)) = (2 · (𝑎↑2)))
12	4, 11	eqtrd 2780	. . . . . . . . . . . 12 ⊢ ((𝑏 = 𝑎 ∧ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ)) → ((𝑎↑2) + (𝑏↑2)) = (2 · (𝑎↑2)))
13	12	eqeq1d 2742	. . . . . . . . . . 11 ⊢ ((𝑏 = 𝑎 ∧ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ)) → (((𝑎↑2) + (𝑏↑2)) = 𝑃 ↔ (2 · (𝑎↑2)) = 𝑃))
14		oveq1 7455	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑃 = (2 · (𝑎↑2)) → (𝑃 mod 4) = ((2 · (𝑎↑2)) mod 4))
15	14	eqeq1d 2742	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑃 = (2 · (𝑎↑2)) → ((𝑃 mod 4) = 1 ↔ ((2 · (𝑎↑2)) mod 4) = 1))
16		eleq1 2832	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑃 = (2 · (𝑎↑2)) → (𝑃 ∈ ℙ ↔ (2 · (𝑎↑2)) ∈ ℙ))
17	15, 16	anbi12d 631	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑃 = (2 · (𝑎↑2)) → (((𝑃 mod 4) = 1 ∧ 𝑃 ∈ ℙ) ↔ (((2 · (𝑎↑2)) mod 4) = 1 ∧ (2 · (𝑎↑2)) ∈ ℙ)))
18		nnz 12660	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑎 ∈ ℕ → 𝑎 ∈ ℤ)
19		2nn0 12570	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ 2 ∈ ℕ₀
20		zexpcl 14127	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑎 ∈ ℤ ∧ 2 ∈ ℕ₀) → (𝑎↑2) ∈ ℤ)
21	18, 19, 20	sylancl 585	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑎 ∈ ℕ → (𝑎↑2) ∈ ℤ)
22		2mulprm 16740	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎↑2) ∈ ℤ → ((2 · (𝑎↑2)) ∈ ℙ ↔ (𝑎↑2) = 1))
23	21, 22	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑎 ∈ ℕ → ((2 · (𝑎↑2)) ∈ ℙ ↔ (𝑎↑2) = 1))
24		oveq2 7456	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑎↑2) = 1 → (2 · (𝑎↑2)) = (2 · 1))
25		2t1e2 12456	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (2 · 1) = 2
26	24, 25	eqtrdi 2796	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑎↑2) = 1 → (2 · (𝑎↑2)) = 2)
27	26	oveq1d 7463	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑎↑2) = 1 → ((2 · (𝑎↑2)) mod 4) = (2 mod 4))
28		2re 12367	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 2 ∈ ℝ
29		4nn 12376	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ 4 ∈ ℕ
30		nnrp 13068	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (4 ∈ ℕ → 4 ∈ ℝ⁺)
31	29, 30	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 4 ∈ ℝ⁺
32		0le2 12395	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 0 ≤ 2
33		2lt4 12468	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 2 < 4
34		modid 13947	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((2 ∈ ℝ ∧ 4 ∈ ℝ⁺) ∧ (0 ≤ 2 ∧ 2 < 4)) → (2 mod 4) = 2)
35	28, 31, 32, 33, 34	mp4an 692	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (2 mod 4) = 2
36	27, 35	eqtrdi 2796	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑎↑2) = 1 → ((2 · (𝑎↑2)) mod 4) = 2)
37	36	eqeq1d 2742	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎↑2) = 1 → (((2 · (𝑎↑2)) mod 4) = 1 ↔ 2 = 1))
38		1ne2 12501	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ 1 ≠ 2
39		eqcom 2747	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (2 = 1 ↔ 1 = 2)
40		eqneqall 2957	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (1 = 2 → (1 ≠ 2 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
41	40	com12 32	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (1 ≠ 2 → (1 = 2 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
42	39, 41	biimtrid 242	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (1 ≠ 2 → (2 = 1 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
43	38, 42	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (2 = 1 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎))
44	37, 43	biimtrdi 253	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎↑2) = 1 → (((2 · (𝑎↑2)) mod 4) = 1 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
45	23, 44	biimtrdi 253	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 ∈ ℕ → ((2 · (𝑎↑2)) ∈ ℙ → (((2 · (𝑎↑2)) mod 4) = 1 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎))))
46	45	impcomd 411	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ ℕ → ((((2 · (𝑎↑2)) mod 4) = 1 ∧ (2 · (𝑎↑2)) ∈ ℙ) → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
47	46	com12 32	. . . . . . . . . . . . . . . . . 18 ⊢ ((((2 · (𝑎↑2)) mod 4) = 1 ∧ (2 · (𝑎↑2)) ∈ ℙ) → (𝑎 ∈ ℕ → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
48	17, 47	biimtrdi 253	. . . . . . . . . . . . . . . . 17 ⊢ (𝑃 = (2 · (𝑎↑2)) → (((𝑃 mod 4) = 1 ∧ 𝑃 ∈ ℙ) → (𝑎 ∈ ℕ → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎))))
49	48	expd 415	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 = (2 · (𝑎↑2)) → ((𝑃 mod 4) = 1 → (𝑃 ∈ ℙ → (𝑎 ∈ ℕ → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))))
50	49	com34 91	. . . . . . . . . . . . . . 15 ⊢ (𝑃 = (2 · (𝑎↑2)) → ((𝑃 mod 4) = 1 → (𝑎 ∈ ℕ → (𝑃 ∈ ℙ → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))))
51	50	eqcoms 2748	. . . . . . . . . . . . . 14 ⊢ ((2 · (𝑎↑2)) = 𝑃 → ((𝑃 mod 4) = 1 → (𝑎 ∈ ℕ → (𝑃 ∈ ℙ → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))))
52	51	com14 96	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → ((𝑃 mod 4) = 1 → (𝑎 ∈ ℕ → ((2 · (𝑎↑2)) = 𝑃 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))))
53	52	imp31 417	. . . . . . . . . . . 12 ⊢ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) → ((2 · (𝑎↑2)) = 𝑃 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
54	53	ad2antrl 727	. . . . . . . . . . 11 ⊢ ((𝑏 = 𝑎 ∧ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ)) → ((2 · (𝑎↑2)) = 𝑃 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
55	13, 54	sylbid 240	. . . . . . . . . 10 ⊢ ((𝑏 = 𝑎 ∧ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ)) → (((𝑎↑2) + (𝑏↑2)) = 𝑃 → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
56	55	expimpd 453	. . . . . . . . 9 ⊢ (𝑏 = 𝑎 → (((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
57		2a1 28	. . . . . . . . 9 ⊢ (𝑏 ≠ 𝑎 → (((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎)))
58	56, 57	pm2.61ine 3031	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑎 ≤ 𝑏 → 𝑏 ≠ 𝑎))
59	58	pm4.71d 561	. . . . . . 7 ⊢ (((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑎 ≤ 𝑏 ↔ (𝑎 ≤ 𝑏 ∧ 𝑏 ≠ 𝑎)))
60		nnre 12300	. . . . . . . . . . 11 ⊢ (𝑎 ∈ ℕ → 𝑎 ∈ ℝ)
61	60	adantl 481	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) → 𝑎 ∈ ℝ)
62		nnre 12300	. . . . . . . . . 10 ⊢ (𝑏 ∈ ℕ → 𝑏 ∈ ℝ)
63		ltlen 11391	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → (𝑎 < 𝑏 ↔ (𝑎 ≤ 𝑏 ∧ 𝑏 ≠ 𝑎)))
64	61, 62, 63	syl2an 595	. . . . . . . . 9 ⊢ ((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) → (𝑎 < 𝑏 ↔ (𝑎 ≤ 𝑏 ∧ 𝑏 ≠ 𝑎)))
65	64	bibi2d 342	. . . . . . . 8 ⊢ ((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) → ((𝑎 ≤ 𝑏 ↔ 𝑎 < 𝑏) ↔ (𝑎 ≤ 𝑏 ↔ (𝑎 ≤ 𝑏 ∧ 𝑏 ≠ 𝑎))))
66	65	adantr 480	. . . . . . 7 ⊢ (((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → ((𝑎 ≤ 𝑏 ↔ 𝑎 < 𝑏) ↔ (𝑎 ≤ 𝑏 ↔ (𝑎 ≤ 𝑏 ∧ 𝑏 ≠ 𝑎))))
67	59, 66	mpbird 257	. . . . . 6 ⊢ (((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑎 ≤ 𝑏 ↔ 𝑎 < 𝑏))
68	67	ex 412	. . . . 5 ⊢ ((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) → (((𝑎↑2) + (𝑏↑2)) = 𝑃 → (𝑎 ≤ 𝑏 ↔ 𝑎 < 𝑏)))
69	68	pm5.32rd 577	. . . 4 ⊢ ((((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) ∧ 𝑏 ∈ ℕ) → ((𝑎 ≤ 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) ↔ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)))
70	69	reubidva 3404	. . 3 ⊢ (((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) ∧ 𝑎 ∈ ℕ) → (∃!𝑏 ∈ ℕ (𝑎 ≤ 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) ↔ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)))
71	70	reubidva 3404	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 ≤ 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) ↔ ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)))
72	1, 71	mpbid 232	1 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∃!wreu 3386 class class class wbr 5166 (class class class)co 7448 ℂcc 11182 ℝcr 11183 0cc0 11184 1c1 11185 + caddc 11187 · cmul 11189 < clt 11324 ≤ cle 11325 ℕcn 12293 2c2 12348 4c4 12350 ℕ₀cn0 12553 ℤcz 12639 ℝ⁺crp 13057 mod cmo 13920 ↑cexp 14112 ℙcprime 16718

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262 ax-addf 11263 ax-mulf 11264

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-isom 6582 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-of 7714 df-ofr 7715 df-om 7904 df-1st 8030 df-2nd 8031 df-supp 8202 df-tpos 8267 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-oadd 8526 df-er 8763 df-ec 8765 df-qs 8769 df-map 8886 df-pm 8887 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fsupp 9432 df-sup 9511 df-inf 9512 df-oi 9579 df-dju 9970 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-xnn0 12626 df-z 12640 df-dec 12759 df-uz 12904 df-q 13014 df-rp 13058 df-fz 13568 df-fzo 13712 df-fl 13843 df-mod 13921 df-seq 14053 df-exp 14113 df-hash 14380 df-cj 15148 df-re 15149 df-im 15150 df-sqrt 15284 df-abs 15285 df-dvds 16303 df-gcd 16541 df-prm 16719 df-phi 16813 df-pc 16884 df-gz 16977 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-starv 17326 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-unif 17334 df-hom 17335 df-cco 17336 df-0g 17501 df-gsum 17502 df-prds 17507 df-pws 17509 df-imas 17568 df-qus 17569 df-mre 17644 df-mrc 17645 df-acs 17647 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-mhm 18818 df-submnd 18819 df-grp 18976 df-minusg 18977 df-sbg 18978 df-mulg 19108 df-subg 19163 df-nsg 19164 df-eqg 19165 df-ghm 19253 df-cntz 19357 df-cmn 19824 df-abl 19825 df-mgp 20162 df-rng 20180 df-ur 20209 df-srg 20214 df-ring 20262 df-cring 20263 df-oppr 20360 df-dvdsr 20383 df-unit 20384 df-invr 20414 df-dvr 20427 df-rhm 20498 df-nzr 20539 df-subrng 20572 df-subrg 20597 df-rlreg 20716 df-domn 20717 df-idom 20718 df-drng 20753 df-field 20754 df-lmod 20882 df-lss 20953 df-lsp 20993 df-sra 21195 df-rgmod 21196 df-lidl 21241 df-rsp 21242 df-2idl 21283 df-cnfld 21388 df-zring 21481 df-zrh 21537 df-zn 21540 df-assa 21896 df-asp 21897 df-ascl 21898 df-psr 21952 df-mvr 21953 df-mpl 21954 df-opsr 21956 df-evls 22121 df-evl 22122 df-psr1 22202 df-vr1 22203 df-ply1 22204 df-coe1 22205 df-evl1 22341 df-mdeg 26114 df-deg1 26115 df-mon1 26190 df-uc1p 26191 df-q1p 26192 df-r1p 26193 df-lgs 27357

This theorem is referenced by: 2sqreunnltblem 27513 2sqreunnlt 27522

W3C validator