eulerthlemh - Intuitionistic Logic Explorer

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

Theorem eulerthlemh 12230

Description: Lemma for eulerth 12232. A permutation of (1...(ϕ‘𝑁)). (Contributed by Mario Carneiro, 28-Feb-2014.) (Revised by Jim Kingdon, 5-Sep-2024.)

**Hypotheses**
Ref	Expression
eulerth.1	⊢ (𝜑 → (𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1))
eulerth.2	⊢ 𝑆 = {𝑦 ∈ (0..^𝑁) ∣ (𝑦 gcd 𝑁) = 1}
eulerth.4	⊢ (𝜑 → 𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆)
eulerth.h	⊢ 𝐻 = (^◡𝐹 ∘ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)))

**Assertion**
Ref	Expression
eulerthlemh	⊢ (𝜑 → 𝐻:(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁)))

Distinct variable groups: 𝑦,𝐴 𝑦,𝐹 𝑦,𝑁 𝜑,𝑦 Allowed substitution hints: 𝑆(𝑦) 𝐻(𝑦)

Proof of Theorem eulerthlemh Dummy variables 𝑎 𝑏 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eulerth.4	. . . 4 ⊢ (𝜑 → 𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆)
2		f1ocnv 5474	. . . 4 ⊢ (𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆 → ^◡𝐹:𝑆–1-1-onto→(1...(ϕ‘𝑁)))
3	1, 2	syl 14	. . 3 ⊢ (𝜑 → ^◡𝐹:𝑆–1-1-onto→(1...(ϕ‘𝑁)))
4		eulerth.1	. . . . . . 7 ⊢ (𝜑 → (𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1))
5		eulerth.2	. . . . . . 7 ⊢ 𝑆 = {𝑦 ∈ (0..^𝑁) ∣ (𝑦 gcd 𝑁) = 1}
6		eqid 2177	. . . . . . 7 ⊢ (1...(ϕ‘𝑁)) = (1...(ϕ‘𝑁))
7		fveq2 5515	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → (𝐹‘𝑎) = (𝐹‘𝑏))
8	7	oveq2d 5890	. . . . . . . . 9 ⊢ (𝑎 = 𝑏 → (𝐴 · (𝐹‘𝑎)) = (𝐴 · (𝐹‘𝑏)))
9	8	oveq1d 5889	. . . . . . . 8 ⊢ (𝑎 = 𝑏 → ((𝐴 · (𝐹‘𝑎)) mod 𝑁) = ((𝐴 · (𝐹‘𝑏)) mod 𝑁))
10	9	cbvmptv 4099	. . . . . . 7 ⊢ (𝑎 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑎)) mod 𝑁)) = (𝑏 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑏)) mod 𝑁))
11	4, 5, 6, 1, 10	eulerthlem1 12226	. . . . . 6 ⊢ (𝜑 → (𝑎 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑎)) mod 𝑁)):(1...(ϕ‘𝑁))⟶𝑆)
12		fveq2 5515	. . . . . . . . . 10 ⊢ (𝑎 = 𝑦 → (𝐹‘𝑎) = (𝐹‘𝑦))
13	12	oveq2d 5890	. . . . . . . . 9 ⊢ (𝑎 = 𝑦 → (𝐴 · (𝐹‘𝑎)) = (𝐴 · (𝐹‘𝑦)))
14	13	oveq1d 5889	. . . . . . . 8 ⊢ (𝑎 = 𝑦 → ((𝐴 · (𝐹‘𝑎)) mod 𝑁) = ((𝐴 · (𝐹‘𝑦)) mod 𝑁))
15	14	cbvmptv 4099	. . . . . . 7 ⊢ (𝑎 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑎)) mod 𝑁)) = (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))
16	15	feq1i 5358	. . . . . 6 ⊢ ((𝑎 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑎)) mod 𝑁)):(1...(ϕ‘𝑁))⟶𝑆 ↔ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))⟶𝑆)
17	11, 16	sylib 122	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))⟶𝑆)
18	4	simp1d 1009	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ)
19	18	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝑁 ∈ ℕ)
20	4	simp2d 1010	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℤ)
21	20	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝐴 ∈ ℤ)
22		ssrab2 3240	. . . . . . . . . . . . 13 ⊢ {𝑦 ∈ (0..^𝑁) ∣ (𝑦 gcd 𝑁) = 1} ⊆ (0..^𝑁)
23	5, 22	eqsstri 3187	. . . . . . . . . . . 12 ⊢ 𝑆 ⊆ (0..^𝑁)
24		fzo0ssnn0 10214	. . . . . . . . . . . . 13 ⊢ (0..^𝑁) ⊆ ℕ₀
25		nn0ssz 9270	. . . . . . . . . . . . 13 ⊢ ℕ₀ ⊆ ℤ
26	24, 25	sstri 3164	. . . . . . . . . . . 12 ⊢ (0..^𝑁) ⊆ ℤ
27	23, 26	sstri 3164	. . . . . . . . . . 11 ⊢ 𝑆 ⊆ ℤ
28		f1of 5461	. . . . . . . . . . . . . 14 ⊢ (𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆 → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
29	1, 28	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
30	29	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
31		simprl 529	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝑢 ∈ (1...(ϕ‘𝑁)))
32	30, 31	ffvelcdmd 5652	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑢) ∈ 𝑆)
33	27, 32	sselid 3153	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑢) ∈ ℤ)
34	21, 33	zmulcld 9380	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐴 · (𝐹‘𝑢)) ∈ ℤ)
35	29	ffvelcdmda 5651	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (1...(ϕ‘𝑁))) → (𝐹‘𝑣) ∈ 𝑆)
36	35	adantrl 478	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑣) ∈ 𝑆)
37	27, 36	sselid 3153	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑣) ∈ ℤ)
38	21, 37	zmulcld 9380	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐴 · (𝐹‘𝑣)) ∈ ℤ)
39		moddvds 11805	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴 · (𝐹‘𝑢)) ∈ ℤ ∧ (𝐴 · (𝐹‘𝑣)) ∈ ℤ) → (((𝐴 · (𝐹‘𝑢)) mod 𝑁) = ((𝐴 · (𝐹‘𝑣)) mod 𝑁) ↔ 𝑁 ∥ ((𝐴 · (𝐹‘𝑢)) − (𝐴 · (𝐹‘𝑣)))))
40	19, 34, 38, 39	syl3anc 1238	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (((𝐴 · (𝐹‘𝑢)) mod 𝑁) = ((𝐴 · (𝐹‘𝑣)) mod 𝑁) ↔ 𝑁 ∥ ((𝐴 · (𝐹‘𝑢)) − (𝐴 · (𝐹‘𝑣)))))
41		eqid 2177	. . . . . . . . . 10 ⊢ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)) = (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))
42		fveq2 5515	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑢 → (𝐹‘𝑦) = (𝐹‘𝑢))
43	42	oveq2d 5890	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑢 → (𝐴 · (𝐹‘𝑦)) = (𝐴 · (𝐹‘𝑢)))
44	43	oveq1d 5889	. . . . . . . . . 10 ⊢ (𝑦 = 𝑢 → ((𝐴 · (𝐹‘𝑦)) mod 𝑁) = ((𝐴 · (𝐹‘𝑢)) mod 𝑁))
45		zmodfzo 10346	. . . . . . . . . . 11 ⊢ (((𝐴 · (𝐹‘𝑢)) ∈ ℤ ∧ 𝑁 ∈ ℕ) → ((𝐴 · (𝐹‘𝑢)) mod 𝑁) ∈ (0..^𝑁))
46	34, 19, 45	syl2anc 411	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝐴 · (𝐹‘𝑢)) mod 𝑁) ∈ (0..^𝑁))
47	41, 44, 31, 46	fvmptd3 5609	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑢) = ((𝐴 · (𝐹‘𝑢)) mod 𝑁))
48		fveq2 5515	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑣 → (𝐹‘𝑦) = (𝐹‘𝑣))
49	48	oveq2d 5890	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑣 → (𝐴 · (𝐹‘𝑦)) = (𝐴 · (𝐹‘𝑣)))
50	49	oveq1d 5889	. . . . . . . . . 10 ⊢ (𝑦 = 𝑣 → ((𝐴 · (𝐹‘𝑦)) mod 𝑁) = ((𝐴 · (𝐹‘𝑣)) mod 𝑁))
51		simprr 531	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝑣 ∈ (1...(ϕ‘𝑁)))
52		zmodfzo 10346	. . . . . . . . . . 11 ⊢ (((𝐴 · (𝐹‘𝑣)) ∈ ℤ ∧ 𝑁 ∈ ℕ) → ((𝐴 · (𝐹‘𝑣)) mod 𝑁) ∈ (0..^𝑁))
53	38, 19, 52	syl2anc 411	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝐴 · (𝐹‘𝑣)) mod 𝑁) ∈ (0..^𝑁))
54	41, 50, 51, 53	fvmptd3 5609	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑣) = ((𝐴 · (𝐹‘𝑣)) mod 𝑁))
55	47, 54	eqeq12d 2192	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑢) = ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑣) ↔ ((𝐴 · (𝐹‘𝑢)) mod 𝑁) = ((𝐴 · (𝐹‘𝑣)) mod 𝑁)))
56	21	zcnd 9375	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝐴 ∈ ℂ)
57	33	zcnd 9375	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑢) ∈ ℂ)
58	37	zcnd 9375	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑣) ∈ ℂ)
59	56, 57, 58	subdid 8370	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐴 · ((𝐹‘𝑢) − (𝐹‘𝑣))) = ((𝐴 · (𝐹‘𝑢)) − (𝐴 · (𝐹‘𝑣))))
60	59	breq2d 4015	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝑁 ∥ (𝐴 · ((𝐹‘𝑢) − (𝐹‘𝑣))) ↔ 𝑁 ∥ ((𝐴 · (𝐹‘𝑢)) − (𝐴 · (𝐹‘𝑣)))))
61	40, 55, 60	3bitr4d 220	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑢) = ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑣) ↔ 𝑁 ∥ (𝐴 · ((𝐹‘𝑢) − (𝐹‘𝑣)))))
62	18	nnzd 9373	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℤ)
63	62, 20	gcdcomd 11974	. . . . . . . . . 10 ⊢ (𝜑 → (𝑁 gcd 𝐴) = (𝐴 gcd 𝑁))
64	4	simp3d 1011	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 gcd 𝑁) = 1)
65	63, 64	eqtrd 2210	. . . . . . . . 9 ⊢ (𝜑 → (𝑁 gcd 𝐴) = 1)
66	65	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝑁 gcd 𝐴) = 1)
67	62	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝑁 ∈ ℤ)
68	33, 37	zsubcld 9379	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝐹‘𝑢) − (𝐹‘𝑣)) ∈ ℤ)
69		coprmdvds 12091	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ ((𝐹‘𝑢) − (𝐹‘𝑣)) ∈ ℤ) → ((𝑁 ∥ (𝐴 · ((𝐹‘𝑢) − (𝐹‘𝑣))) ∧ (𝑁 gcd 𝐴) = 1) → 𝑁 ∥ ((𝐹‘𝑢) − (𝐹‘𝑣))))
70	67, 21, 68, 69	syl3anc 1238	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝑁 ∥ (𝐴 · ((𝐹‘𝑢) − (𝐹‘𝑣))) ∧ (𝑁 gcd 𝐴) = 1) → 𝑁 ∥ ((𝐹‘𝑢) − (𝐹‘𝑣))))
71		zq 9625	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑢) ∈ ℤ → (𝐹‘𝑢) ∈ ℚ)
72	33, 71	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑢) ∈ ℚ)
73		zq 9625	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℚ)
74	62, 73	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑁 ∈ ℚ)
75	74	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 𝑁 ∈ ℚ)
76	23, 32	sselid 3153	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑢) ∈ (0..^𝑁))
77		elfzole1 10154	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑢) ∈ (0..^𝑁) → 0 ≤ (𝐹‘𝑢))
78	76, 77	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 0 ≤ (𝐹‘𝑢))
79		elfzolt2 10155	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑢) ∈ (0..^𝑁) → (𝐹‘𝑢) < 𝑁)
80	76, 79	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑢) < 𝑁)
81		modqid 10348	. . . . . . . . . . . 12 ⊢ ((((𝐹‘𝑢) ∈ ℚ ∧ 𝑁 ∈ ℚ) ∧ (0 ≤ (𝐹‘𝑢) ∧ (𝐹‘𝑢) < 𝑁)) → ((𝐹‘𝑢) mod 𝑁) = (𝐹‘𝑢))
82	72, 75, 78, 80, 81	syl22anc 1239	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝐹‘𝑢) mod 𝑁) = (𝐹‘𝑢))
83	27, 35	sselid 3153	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑣 ∈ (1...(ϕ‘𝑁))) → (𝐹‘𝑣) ∈ ℤ)
84	83	adantrl 478	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑣) ∈ ℤ)
85		zq 9625	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑣) ∈ ℤ → (𝐹‘𝑣) ∈ ℚ)
86	84, 85	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑣) ∈ ℚ)
87	23, 35	sselid 3153	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑣 ∈ (1...(ϕ‘𝑁))) → (𝐹‘𝑣) ∈ (0..^𝑁))
88		elfzole1 10154	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑣) ∈ (0..^𝑁) → 0 ≤ (𝐹‘𝑣))
89	87, 88	syl 14	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 ∈ (1...(ϕ‘𝑁))) → 0 ≤ (𝐹‘𝑣))
90	89	adantrl 478	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → 0 ≤ (𝐹‘𝑣))
91	87	adantrl 478	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑣) ∈ (0..^𝑁))
92		elfzolt2 10155	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑣) ∈ (0..^𝑁) → (𝐹‘𝑣) < 𝑁)
93	91, 92	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝐹‘𝑣) < 𝑁)
94		modqid 10348	. . . . . . . . . . . 12 ⊢ ((((𝐹‘𝑣) ∈ ℚ ∧ 𝑁 ∈ ℚ) ∧ (0 ≤ (𝐹‘𝑣) ∧ (𝐹‘𝑣) < 𝑁)) → ((𝐹‘𝑣) mod 𝑁) = (𝐹‘𝑣))
95	86, 75, 90, 93, 94	syl22anc 1239	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝐹‘𝑣) mod 𝑁) = (𝐹‘𝑣))
96	82, 95	eqeq12d 2192	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (((𝐹‘𝑢) mod 𝑁) = ((𝐹‘𝑣) mod 𝑁) ↔ (𝐹‘𝑢) = (𝐹‘𝑣)))
97		moddvds 11805	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ ∧ (𝐹‘𝑢) ∈ ℤ ∧ (𝐹‘𝑣) ∈ ℤ) → (((𝐹‘𝑢) mod 𝑁) = ((𝐹‘𝑣) mod 𝑁) ↔ 𝑁 ∥ ((𝐹‘𝑢) − (𝐹‘𝑣))))
98	19, 33, 37, 97	syl3anc 1238	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (((𝐹‘𝑢) mod 𝑁) = ((𝐹‘𝑣) mod 𝑁) ↔ 𝑁 ∥ ((𝐹‘𝑢) − (𝐹‘𝑣))))
99		f1of1 5460	. . . . . . . . . . . 12 ⊢ (𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆 → 𝐹:(1...(ϕ‘𝑁))–1-1→𝑆)
100	1, 99	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:(1...(ϕ‘𝑁))–1-1→𝑆)
101		f1fveq 5772	. . . . . . . . . . 11 ⊢ ((𝐹:(1...(ϕ‘𝑁))–1-1→𝑆 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ 𝑢 = 𝑣))
102	100, 101	sylan 283	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ 𝑢 = 𝑣))
103	96, 98, 102	3bitr3d 218	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝑁 ∥ ((𝐹‘𝑢) − (𝐹‘𝑣)) ↔ 𝑢 = 𝑣))
104	70, 103	sylibd 149	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → ((𝑁 ∥ (𝐴 · ((𝐹‘𝑢) − (𝐹‘𝑣))) ∧ (𝑁 gcd 𝐴) = 1) → 𝑢 = 𝑣))
105	66, 104	mpan2d 428	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (𝑁 ∥ (𝐴 · ((𝐹‘𝑢) − (𝐹‘𝑣))) → 𝑢 = 𝑣))
106	61, 105	sylbid 150	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (1...(ϕ‘𝑁)) ∧ 𝑣 ∈ (1...(ϕ‘𝑁)))) → (((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑢) = ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑣) → 𝑢 = 𝑣))
107	106	ralrimivva 2559	. . . . 5 ⊢ (𝜑 → ∀𝑢 ∈ (1...(ϕ‘𝑁))∀𝑣 ∈ (1...(ϕ‘𝑁))(((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑢) = ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑣) → 𝑢 = 𝑣))
108		dff13 5768	. . . . 5 ⊢ ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1→𝑆 ↔ ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))⟶𝑆 ∧ ∀𝑢 ∈ (1...(ϕ‘𝑁))∀𝑣 ∈ (1...(ϕ‘𝑁))(((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑢) = ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))‘𝑣) → 𝑢 = 𝑣)))
109	17, 107, 108	sylanbrc 417	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1→𝑆)
110		1zzd 9279	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℤ)
111	18	phicld 12217	. . . . . . . 8 ⊢ (𝜑 → (ϕ‘𝑁) ∈ ℕ)
112	111	nnzd 9373	. . . . . . 7 ⊢ (𝜑 → (ϕ‘𝑁) ∈ ℤ)
113	110, 112	fzfigd 10430	. . . . . 6 ⊢ (𝜑 → (1...(ϕ‘𝑁)) ∈ Fin)
114		f1oeng 6756	. . . . . 6 ⊢ (((1...(ϕ‘𝑁)) ∈ Fin ∧ 𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆) → (1...(ϕ‘𝑁)) ≈ 𝑆)
115	113, 1, 114	syl2anc 411	. . . . 5 ⊢ (𝜑 → (1...(ϕ‘𝑁)) ≈ 𝑆)
116	4, 5	eulerthlemfi 12227	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ Fin)
117		f1finf1o 6945	. . . . 5 ⊢ (((1...(ϕ‘𝑁)) ≈ 𝑆 ∧ 𝑆 ∈ Fin) → ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1→𝑆 ↔ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1-onto→𝑆))
118	115, 116, 117	syl2anc 411	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1→𝑆 ↔ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1-onto→𝑆))
119	109, 118	mpbid 147	. . 3 ⊢ (𝜑 → (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1-onto→𝑆)
120		f1oco 5484	. . 3 ⊢ ((^◡𝐹:𝑆–1-1-onto→(1...(ϕ‘𝑁)) ∧ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)):(1...(ϕ‘𝑁))–1-1-onto→𝑆) → (^◡𝐹 ∘ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))):(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁)))
121	3, 119, 120	syl2anc 411	. 2 ⊢ (𝜑 → (^◡𝐹 ∘ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))):(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁)))
122		eulerth.h	. . 3 ⊢ 𝐻 = (^◡𝐹 ∘ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁)))
123		f1oeq1 5449	. . 3 ⊢ (𝐻 = (^◡𝐹 ∘ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))) → (𝐻:(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁)) ↔ (^◡𝐹 ∘ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))):(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁))))
124	122, 123	ax-mp 5	. 2 ⊢ (𝐻:(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁)) ↔ (^◡𝐹 ∘ (𝑦 ∈ (1...(ϕ‘𝑁)) ↦ ((𝐴 · (𝐹‘𝑦)) mod 𝑁))):(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁)))
125	121, 124	sylibr 134	1 ⊢ (𝜑 → 𝐻:(1...(ϕ‘𝑁))–1-1-onto→(1...(ϕ‘𝑁)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ∀wral 2455 {crab 2459 class class class wbr 4003 ↦ cmpt 4064 ^◡ccnv 4625 ∘ ccom 4630 ⟶wf 5212 –1-1→wf1 5213 –1-1-onto→wf1o 5215 ‘cfv 5216 (class class class)co 5874 ≈ cen 6737 Fincfn 6739 0cc0 7810 1c1 7811 · cmul 7815 < clt 7991 ≤ cle 7992 − cmin 8127 ℕcn 8918 ℕ₀cn0 9175 ℤcz 9252 ℚcq 9618 ...cfz 10007 ..^cfzo 10141 mod cmo 10321 ∥ cdvds 11793 gcd cgcd 11942 ϕcphi 12208

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4118 ax-sep 4121 ax-nul 4129 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-iinf 4587 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-mulrcl 7909 ax-addcom 7910 ax-mulcom 7911 ax-addass 7912 ax-mulass 7913 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-1rid 7917 ax-0id 7918 ax-rnegex 7919 ax-precex 7920 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-apti 7925 ax-pre-ltadd 7926 ax-pre-mulgt0 7927 ax-pre-mulext 7928 ax-arch 7929 ax-caucvg 7930

This theorem depends on definitions: df-bi 117 df-stab 831 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4004 df-opab 4065 df-mpt 4066 df-tr 4102 df-id 4293 df-po 4296 df-iso 4297 df-iord 4366 df-on 4368 df-ilim 4369 df-suc 4371 df-iom 4590 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-f1 5221 df-fo 5222 df-f1o 5223 df-fv 5224 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-1st 6140 df-2nd 6141 df-recs 6305 df-frec 6391 df-1o 6416 df-er 6534 df-en 6740 df-dom 6741 df-fin 6742 df-sup 6982 df-pnf 7993 df-mnf 7994 df-xr 7995 df-ltxr 7996 df-le 7997 df-sub 8129 df-neg 8130 df-reap 8531 df-ap 8538 df-div 8629 df-inn 8919 df-2 8977 df-3 8978 df-4 8979 df-n0 9176 df-z 9253 df-uz 9528 df-q 9619 df-rp 9653 df-fz 10008 df-fzo 10142 df-fl 10269 df-mod 10322 df-seqfrec 10445 df-exp 10519 df-ihash 10755 df-cj 10850 df-re 10851 df-im 10852 df-rsqrt 11006 df-abs 11007 df-dvds 11794 df-gcd 11943 df-phi 12210

This theorem is referenced by: eulerthlemth 12231

W3C validator