2lgs - Intuitionistic Logic Explorer

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

Theorem 2lgs 15429

Description: The second supplement to the law of quadratic reciprocity (for the Legendre symbol extended to arbitrary primes as second argument). Two is a square modulo a prime 𝑃 iff 𝑃≡±1 (mod 8), see first case of theorem 9.5 in [ApostolNT] p. 181. This theorem justifies our definition of (𝑁 /_L 2) (lgs2 15342) to some degree, by demanding that reciprocity extend to the case 𝑄 = 2. (Proposed by Mario Carneiro, 19-Jun-2015.) (Contributed by AV, 16-Jul-2021.)

**Assertion**
Ref	Expression
2lgs	⊢ (𝑃 ∈ ℙ → ((2 /_L 𝑃) = 1 ↔ (𝑃 mod 8) ∈ {1, 7}))

Proof of Theorem 2lgs Dummy variables 𝑖 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prm2orodd 12319	. 2 ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ ¬ 2 ∥ 𝑃))
2		2lgslem4 15428	. . . . . 6 ⊢ ((2 /_L 2) = 1 ↔ (2 mod 8) ∈ {1, 7})
3	2	a1i 9	. . . . 5 ⊢ (𝑃 = 2 → ((2 /_L 2) = 1 ↔ (2 mod 8) ∈ {1, 7}))
4		oveq2 5933	. . . . . 6 ⊢ (𝑃 = 2 → (2 /_L 𝑃) = (2 /_L 2))
5	4	eqeq1d 2205	. . . . 5 ⊢ (𝑃 = 2 → ((2 /_L 𝑃) = 1 ↔ (2 /_L 2) = 1))
6		oveq1 5932	. . . . . 6 ⊢ (𝑃 = 2 → (𝑃 mod 8) = (2 mod 8))
7	6	eleq1d 2265	. . . . 5 ⊢ (𝑃 = 2 → ((𝑃 mod 8) ∈ {1, 7} ↔ (2 mod 8) ∈ {1, 7}))
8	3, 5, 7	3bitr4d 220	. . . 4 ⊢ (𝑃 = 2 → ((2 /_L 𝑃) = 1 ↔ (𝑃 mod 8) ∈ {1, 7}))
9	8	a1d 22	. . 3 ⊢ (𝑃 = 2 → (𝑃 ∈ ℙ → ((2 /_L 𝑃) = 1 ↔ (𝑃 mod 8) ∈ {1, 7})))
10		2prm 12320	. . . . . . . . . 10 ⊢ 2 ∈ ℙ
11		prmnn 12303	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
12		dvdsprime 12315	. . . . . . . . . 10 ⊢ ((2 ∈ ℙ ∧ 𝑃 ∈ ℕ) → (𝑃 ∥ 2 ↔ (𝑃 = 2 ∨ 𝑃 = 1)))
13	10, 11, 12	sylancr 414	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 ∥ 2 ↔ (𝑃 = 2 ∨ 𝑃 = 1)))
14		z2even 12096	. . . . . . . . . . . . 13 ⊢ 2 ∥ 2
15		breq2 4038	. . . . . . . . . . . . 13 ⊢ (𝑃 = 2 → (2 ∥ 𝑃 ↔ 2 ∥ 2))
16	14, 15	mpbiri 168	. . . . . . . . . . . 12 ⊢ (𝑃 = 2 → 2 ∥ 𝑃)
17	16	a1d 22	. . . . . . . . . . 11 ⊢ (𝑃 = 2 → (𝑃 ∈ ℙ → 2 ∥ 𝑃))
18		eleq1 2259	. . . . . . . . . . . 12 ⊢ (𝑃 = 1 → (𝑃 ∈ ℙ ↔ 1 ∈ ℙ))
19		1nprm 12307	. . . . . . . . . . . . 13 ⊢ ¬ 1 ∈ ℙ
20	19	pm2.21i 647	. . . . . . . . . . . 12 ⊢ (1 ∈ ℙ → 2 ∥ 𝑃)
21	18, 20	biimtrdi 163	. . . . . . . . . . 11 ⊢ (𝑃 = 1 → (𝑃 ∈ ℙ → 2 ∥ 𝑃))
22	17, 21	jaoi 717	. . . . . . . . . 10 ⊢ ((𝑃 = 2 ∨ 𝑃 = 1) → (𝑃 ∈ ℙ → 2 ∥ 𝑃))
23	22	com12 30	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → ((𝑃 = 2 ∨ 𝑃 = 1) → 2 ∥ 𝑃))
24	13, 23	sylbid 150	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃 ∥ 2 → 2 ∥ 𝑃))
25	24	con3dimp 636	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ¬ 𝑃 ∥ 2)
26		2z 9371	. . . . . . 7 ⊢ 2 ∈ ℤ
27	25, 26	jctil 312	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (2 ∈ ℤ ∧ ¬ 𝑃 ∥ 2))
28		2lgslem1 15416	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))}) = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))))
29	28	eqcomd 2202	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))}))
30		nnoddn2prmb 12456	. . . . . . . . . 10 ⊢ (𝑃 ∈ (ℙ ∖ {2}) ↔ (𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃))
31	30	biimpri 133	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → 𝑃 ∈ (ℙ ∖ {2}))
32	31	3ad2ant1 1020	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) ∧ (2 ∈ ℤ ∧ ¬ 𝑃 ∥ 2) ∧ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))})) → 𝑃 ∈ (ℙ ∖ {2}))
33		eqid 2196	. . . . . . . 8 ⊢ ((𝑃 − 1) / 2) = ((𝑃 − 1) / 2)
34		eqid 2196	. . . . . . . 8 ⊢ (𝑦 ∈ (1...((𝑃 − 1) / 2)) ↦ if((𝑦 · 2) < (𝑃 / 2), (𝑦 · 2), (𝑃 − (𝑦 · 2)))) = (𝑦 ∈ (1...((𝑃 − 1) / 2)) ↦ if((𝑦 · 2) < (𝑃 / 2), (𝑦 · 2), (𝑃 − (𝑦 · 2))))
35		eqid 2196	. . . . . . . 8 ⊢ (⌊‘(𝑃 / 4)) = (⌊‘(𝑃 / 4))
36		eqid 2196	. . . . . . . 8 ⊢ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))
37	32, 33, 34, 35, 36	gausslemma2d 15394	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) ∧ (2 ∈ ℤ ∧ ¬ 𝑃 ∥ 2) ∧ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))})) → (2 /_L 𝑃) = (-1↑(((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))))
38	37	eqeq1d 2205	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) ∧ (2 ∈ ℤ ∧ ¬ 𝑃 ∥ 2) ∧ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))})) → ((2 /_L 𝑃) = 1 ↔ (-1↑(((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))) = 1))
39	27, 29, 38	mpd3an23 1350	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((2 /_L 𝑃) = 1 ↔ (-1↑(((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))) = 1))
40	36	2lgslem2 15417	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) ∈ ℤ)
41		m1exp1 12083	. . . . . 6 ⊢ ((((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) ∈ ℤ → ((-1↑(((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))) = 1 ↔ 2 ∥ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))))
42	40, 41	syl 14	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((-1↑(((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))) = 1 ↔ 2 ∥ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4)))))
43		2nn 9169	. . . . . . 7 ⊢ 2 ∈ ℕ
44		dvdsval3 11973	. . . . . . 7 ⊢ ((2 ∈ ℕ ∧ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) ∈ ℤ) → (2 ∥ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) ↔ ((((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) mod 2) = 0))
45	43, 40, 44	sylancr 414	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (2 ∥ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) ↔ ((((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) mod 2) = 0))
46	36	2lgslem3 15426	. . . . . . . 8 ⊢ ((𝑃 ∈ ℕ ∧ ¬ 2 ∥ 𝑃) → ((((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) mod 2) = if((𝑃 mod 8) ∈ {1, 7}, 0, 1))
47	11, 46	sylan 283	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) mod 2) = if((𝑃 mod 8) ∈ {1, 7}, 0, 1))
48	47	eqeq1d 2205	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (((((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) mod 2) = 0 ↔ if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0))
49		prmz 12304	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
50		8nn 9175	. . . . . . . . . . . . . . . 16 ⊢ 8 ∈ ℕ
51	50	a1i 9	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → 8 ∈ ℕ)
52	49, 51	zmodcld 10454	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ ℙ → (𝑃 mod 8) ∈ ℕ₀)
53	52	nn0zd 9463	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → (𝑃 mod 8) ∈ ℤ)
54		1z 9369	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℤ
55		zdceq 9418	. . . . . . . . . . . . 13 ⊢ (((𝑃 mod 8) ∈ ℤ ∧ 1 ∈ ℤ) → DECID (𝑃 mod 8) = 1)
56	53, 54, 55	sylancl 413	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℙ → DECID (𝑃 mod 8) = 1)
57		7nn 9174	. . . . . . . . . . . . . 14 ⊢ 7 ∈ ℕ
58	57	nnzi 9364	. . . . . . . . . . . . 13 ⊢ 7 ∈ ℤ
59		zdceq 9418	. . . . . . . . . . . . 13 ⊢ (((𝑃 mod 8) ∈ ℤ ∧ 7 ∈ ℤ) → DECID (𝑃 mod 8) = 7)
60	53, 58, 59	sylancl 413	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℙ → DECID (𝑃 mod 8) = 7)
61		dcor 937	. . . . . . . . . . . 12 ⊢ (DECID (𝑃 mod 8) = 1 → (DECID (𝑃 mod 8) = 7 → DECID ((𝑃 mod 8) = 1 ∨ (𝑃 mod 8) = 7)))
62	56, 60, 61	sylc 62	. . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → DECID ((𝑃 mod 8) = 1 ∨ (𝑃 mod 8) = 7))
63		elprg 3643	. . . . . . . . . . . . 13 ⊢ ((𝑃 mod 8) ∈ ℕ₀ → ((𝑃 mod 8) ∈ {1, 7} ↔ ((𝑃 mod 8) = 1 ∨ (𝑃 mod 8) = 7)))
64	52, 63	syl 14	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℙ → ((𝑃 mod 8) ∈ {1, 7} ↔ ((𝑃 mod 8) = 1 ∨ (𝑃 mod 8) = 7)))
65	64	dcbid 839	. . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → (DECID (𝑃 mod 8) ∈ {1, 7} ↔ DECID ((𝑃 mod 8) = 1 ∨ (𝑃 mod 8) = 7)))
66	62, 65	mpbird 167	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → DECID (𝑃 mod 8) ∈ {1, 7})
67		exmiddc 837	. . . . . . . . . 10 ⊢ (DECID (𝑃 mod 8) ∈ {1, 7} → ((𝑃 mod 8) ∈ {1, 7} ∨ ¬ (𝑃 mod 8) ∈ {1, 7}))
68	66, 67	syl 14	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → ((𝑃 mod 8) ∈ {1, 7} ∨ ¬ (𝑃 mod 8) ∈ {1, 7}))
69		iffalse 3570	. . . . . . . . . . . 12 ⊢ (¬ (𝑃 mod 8) ∈ {1, 7} → if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 1)
70	69	eqeq1d 2205	. . . . . . . . . . 11 ⊢ (¬ (𝑃 mod 8) ∈ {1, 7} → (if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0 ↔ 1 = 0))
71		1ne0 9075	. . . . . . . . . . . 12 ⊢ 1 ≠ 0
72		eqneqall 2377	. . . . . . . . . . . 12 ⊢ (1 = 0 → (1 ≠ 0 → (𝑃 mod 8) ∈ {1, 7}))
73	71, 72	mpi 15	. . . . . . . . . . 11 ⊢ (1 = 0 → (𝑃 mod 8) ∈ {1, 7})
74	70, 73	biimtrdi 163	. . . . . . . . . 10 ⊢ (¬ (𝑃 mod 8) ∈ {1, 7} → (if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0 → (𝑃 mod 8) ∈ {1, 7}))
75	74	jao1i 797	. . . . . . . . 9 ⊢ (((𝑃 mod 8) ∈ {1, 7} ∨ ¬ (𝑃 mod 8) ∈ {1, 7}) → (if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0 → (𝑃 mod 8) ∈ {1, 7}))
76	68, 75	syl 14	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0 → (𝑃 mod 8) ∈ {1, 7}))
77		iftrue 3567	. . . . . . . 8 ⊢ ((𝑃 mod 8) ∈ {1, 7} → if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0)
78	76, 77	impbid1 142	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → (if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0 ↔ (𝑃 mod 8) ∈ {1, 7}))
79	78	adantr 276	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (if((𝑃 mod 8) ∈ {1, 7}, 0, 1) = 0 ↔ (𝑃 mod 8) ∈ {1, 7}))
80	45, 48, 79	3bitrd 214	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (2 ∥ (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))) ↔ (𝑃 mod 8) ∈ {1, 7}))
81	39, 42, 80	3bitrd 214	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((2 /_L 𝑃) = 1 ↔ (𝑃 mod 8) ∈ {1, 7}))
82	81	expcom 116	. . 3 ⊢ (¬ 2 ∥ 𝑃 → (𝑃 ∈ ℙ → ((2 /_L 𝑃) = 1 ↔ (𝑃 mod 8) ∈ {1, 7})))
83	9, 82	jaoi 717	. 2 ⊢ ((𝑃 = 2 ∨ ¬ 2 ∥ 𝑃) → (𝑃 ∈ ℙ → ((2 /_L 𝑃) = 1 ↔ (𝑃 mod 8) ∈ {1, 7})))
84	1, 83	mpcom 36	1 ⊢ (𝑃 ∈ ℙ → ((2 /_L 𝑃) = 1 ↔ (𝑃 mod 8) ∈ {1, 7}))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 ∧ w3a 980 = wceq 1364 ∈ wcel 2167 ≠ wne 2367 ∃wrex 2476 {crab 2479 ∖ cdif 3154 ifcif 3562 {csn 3623 {cpr 3624 class class class wbr 4034 ↦ cmpt 4095 ‘cfv 5259 (class class class)co 5925 0cc0 7896 1c1 7897 · cmul 7901 < clt 8078 − cmin 8214 -cneg 8215 / cdiv 8716 ℕcn 9007 2c2 9058 4c4 9060 7c7 9063 8c8 9064 ℕ₀cn0 9266 ℤcz 9343 ...cfz 10100 ⌊cfl 10375 mod cmo 10431 ↑cexp 10647 ♯chash 10884 ∥ cdvds 11969 ℙcprime 12300 /_L clgs 15322

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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-mulrcl 7995 ax-addcom 7996 ax-mulcom 7997 ax-addass 7998 ax-mulass 7999 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-1rid 8003 ax-0id 8004 ax-rnegex 8005 ax-precex 8006 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-apti 8011 ax-pre-ltadd 8012 ax-pre-mulgt0 8013 ax-pre-mulext 8014 ax-arch 8015 ax-caucvg 8016

This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-xor 1387 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-tp 3631 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-isom 5268 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-irdg 6437 df-frec 6458 df-1o 6483 df-2o 6484 df-oadd 6487 df-er 6601 df-en 6809 df-dom 6810 df-fin 6811 df-sup 7059 df-inf 7060 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-reap 8619 df-ap 8626 df-div 8717 df-inn 9008 df-2 9066 df-3 9067 df-4 9068 df-5 9069 df-6 9070 df-7 9071 df-8 9072 df-n0 9267 df-z 9344 df-uz 9619 df-q 9711 df-rp 9746 df-ioo 9984 df-ico 9986 df-fz 10101 df-fzo 10235 df-fl 10377 df-mod 10432 df-seqfrec 10557 df-exp 10648 df-fac 10835 df-ihash 10885 df-cj 11024 df-re 11025 df-im 11026 df-rsqrt 11180 df-abs 11181 df-clim 11461 df-proddc 11733 df-dvds 11970 df-gcd 12146 df-prm 12301 df-phi 12404 df-pc 12479 df-lgs 15323

This theorem is referenced by: 2lgsoddprm 15438

W3C validator