eulerthlemrprm - Intuitionistic Logic Explorer

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

Theorem eulerthlemrprm 13030

Description: Lemma for eulerth 13034. 𝑁 and ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥) are relatively prime. (Contributed by Mario Carneiro, 28-Feb-2014.) (Revised by Jim Kingdon, 2-Sep-2024.)

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

**Assertion**
Ref	Expression
eulerthlemrprm	⊢ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥)) = 1)

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

Proof of Theorem eulerthlemrprm Dummy variables 𝑘 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eulerth.1	. . . . . 6 ⊢ (𝜑 → (𝑁 ∈ ℕ ∧ 𝐴 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1))
2	1	simp1d 1040	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ)
3	2	phicld 13019	. . . 4 ⊢ (𝜑 → (ϕ‘𝑁) ∈ ℕ)
4		elnnuz 9969	. . . 4 ⊢ ((ϕ‘𝑁) ∈ ℕ ↔ (ϕ‘𝑁) ∈ (ℤ_≥‘1))
5	3, 4	sylib 122	. . 3 ⊢ (𝜑 → (ϕ‘𝑁) ∈ (ℤ_≥‘1))
6		eluzfz2 10447	. . 3 ⊢ ((ϕ‘𝑁) ∈ (ℤ_≥‘1) → (ϕ‘𝑁) ∈ (1...(ϕ‘𝑁)))
7	5, 6	syl 14	. 2 ⊢ (𝜑 → (ϕ‘𝑁) ∈ (1...(ϕ‘𝑁)))
8		oveq2 6093	. . . . . . 7 ⊢ (𝑤 = 1 → (1...𝑤) = (1...1))
9	8	prodeq1d 12350	. . . . . 6 ⊢ (𝑤 = 1 → ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥) = ∏𝑥 ∈ (1...1)(𝐹‘𝑥))
10	9	oveq2d 6101	. . . . 5 ⊢ (𝑤 = 1 → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = (𝑁 gcd ∏𝑥 ∈ (1...1)(𝐹‘𝑥)))
11	10	eqeq1d 2247	. . . 4 ⊢ (𝑤 = 1 → ((𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1 ↔ (𝑁 gcd ∏𝑥 ∈ (1...1)(𝐹‘𝑥)) = 1))
12	11	imbi2d 230	. . 3 ⊢ (𝑤 = 1 → ((𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1) ↔ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...1)(𝐹‘𝑥)) = 1)))
13		oveq2 6093	. . . . . . 7 ⊢ (𝑤 = 𝑘 → (1...𝑤) = (1...𝑘))
14	13	prodeq1d 12350	. . . . . 6 ⊢ (𝑤 = 𝑘 → ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥) = ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥))
15	14	oveq2d 6101	. . . . 5 ⊢ (𝑤 = 𝑘 → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)))
16	15	eqeq1d 2247	. . . 4 ⊢ (𝑤 = 𝑘 → ((𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1 ↔ (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1))
17	16	imbi2d 230	. . 3 ⊢ (𝑤 = 𝑘 → ((𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1) ↔ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1)))
18		oveq2 6093	. . . . . . 7 ⊢ (𝑤 = (𝑘 + 1) → (1...𝑤) = (1...(𝑘 + 1)))
19	18	prodeq1d 12350	. . . . . 6 ⊢ (𝑤 = (𝑘 + 1) → ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥) = ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥))
20	19	oveq2d 6101	. . . . 5 ⊢ (𝑤 = (𝑘 + 1) → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)))
21	20	eqeq1d 2247	. . . 4 ⊢ (𝑤 = (𝑘 + 1) → ((𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1 ↔ (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1))
22	21	imbi2d 230	. . 3 ⊢ (𝑤 = (𝑘 + 1) → ((𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1) ↔ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1)))
23		oveq2 6093	. . . . . . 7 ⊢ (𝑤 = (ϕ‘𝑁) → (1...𝑤) = (1...(ϕ‘𝑁)))
24	23	prodeq1d 12350	. . . . . 6 ⊢ (𝑤 = (ϕ‘𝑁) → ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥) = ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥))
25	24	oveq2d 6101	. . . . 5 ⊢ (𝑤 = (ϕ‘𝑁) → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = (𝑁 gcd ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥)))
26	25	eqeq1d 2247	. . . 4 ⊢ (𝑤 = (ϕ‘𝑁) → ((𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1 ↔ (𝑁 gcd ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥)) = 1))
27	26	imbi2d 230	. . 3 ⊢ (𝑤 = (ϕ‘𝑁) → ((𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...𝑤)(𝐹‘𝑥)) = 1) ↔ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥)) = 1)))
28		1z 9675	. . . . . . 7 ⊢ 1 ∈ ℤ
29		eulerth.2	. . . . . . . . . . 11 ⊢ 𝑆 = {𝑦 ∈ (0..^𝑁) ∣ (𝑦 gcd 𝑁) = 1}
30		ssrab2 3333	. . . . . . . . . . 11 ⊢ {𝑦 ∈ (0..^𝑁) ∣ (𝑦 gcd 𝑁) = 1} ⊆ (0..^𝑁)
31	29, 30	eqsstri 3280	. . . . . . . . . 10 ⊢ 𝑆 ⊆ (0..^𝑁)
32		fzo0ssnn0 10644	. . . . . . . . . 10 ⊢ (0..^𝑁) ⊆ ℕ₀
33	31, 32	sstri 3257	. . . . . . . . 9 ⊢ 𝑆 ⊆ ℕ₀
34		nn0sscn 9573	. . . . . . . . 9 ⊢ ℕ₀ ⊆ ℂ
35	33, 34	sstri 3257	. . . . . . . 8 ⊢ 𝑆 ⊆ ℂ
36		eulerth.4	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆)
37		f1of 5639	. . . . . . . . . 10 ⊢ (𝐹:(1...(ϕ‘𝑁))–1-1-onto→𝑆 → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
38	36, 37	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
39	3	nnge1d 9350	. . . . . . . . . 10 ⊢ (𝜑 → 1 ≤ (ϕ‘𝑁))
40		uzid 9946	. . . . . . . . . . . 12 ⊢ (1 ∈ ℤ → 1 ∈ (ℤ_≥‘1))
41	28, 40	ax-mp 5	. . . . . . . . . . 11 ⊢ 1 ∈ (ℤ_≥‘1)
42	3	nnzd 9772	. . . . . . . . . . 11 ⊢ (𝜑 → (ϕ‘𝑁) ∈ ℤ)
43		elfz5 10431	. . . . . . . . . . 11 ⊢ ((1 ∈ (ℤ_≥‘1) ∧ (ϕ‘𝑁) ∈ ℤ) → (1 ∈ (1...(ϕ‘𝑁)) ↔ 1 ≤ (ϕ‘𝑁)))
44	41, 42, 43	sylancr 418	. . . . . . . . . 10 ⊢ (𝜑 → (1 ∈ (1...(ϕ‘𝑁)) ↔ 1 ≤ (ϕ‘𝑁)))
45	39, 44	mpbird 167	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ (1...(ϕ‘𝑁)))
46	38, 45	ffvelcdmd 5844	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘1) ∈ 𝑆)
47	35, 46	sselid 3246	. . . . . . 7 ⊢ (𝜑 → (𝐹‘1) ∈ ℂ)
48		fveq2 5695	. . . . . . . 8 ⊢ (𝑥 = 1 → (𝐹‘𝑥) = (𝐹‘1))
49	48	fprod1 12380	. . . . . . 7 ⊢ ((1 ∈ ℤ ∧ (𝐹‘1) ∈ ℂ) → ∏𝑥 ∈ (1...1)(𝐹‘𝑥) = (𝐹‘1))
50	28, 47, 49	sylancr 418	. . . . . 6 ⊢ (𝜑 → ∏𝑥 ∈ (1...1)(𝐹‘𝑥) = (𝐹‘1))
51	50	oveq2d 6101	. . . . 5 ⊢ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...1)(𝐹‘𝑥)) = (𝑁 gcd (𝐹‘1)))
52	2	nnzd 9772	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℤ)
53		nn0ssz 9667	. . . . . . . 8 ⊢ ℕ₀ ⊆ ℤ
54	33, 53	sstri 3257	. . . . . . 7 ⊢ 𝑆 ⊆ ℤ
55	54, 46	sselid 3246	. . . . . 6 ⊢ (𝜑 → (𝐹‘1) ∈ ℤ)
56		gcdcom 12769	. . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ (𝐹‘1) ∈ ℤ) → (𝑁 gcd (𝐹‘1)) = ((𝐹‘1) gcd 𝑁))
57	52, 55, 56	syl2anc 415	. . . . 5 ⊢ (𝜑 → (𝑁 gcd (𝐹‘1)) = ((𝐹‘1) gcd 𝑁))
58		oveq1 6092	. . . . . . . . 9 ⊢ (𝑦 = (𝐹‘1) → (𝑦 gcd 𝑁) = ((𝐹‘1) gcd 𝑁))
59	58	eqeq1d 2247	. . . . . . . 8 ⊢ (𝑦 = (𝐹‘1) → ((𝑦 gcd 𝑁) = 1 ↔ ((𝐹‘1) gcd 𝑁) = 1))
60	59, 29	elrab2 2985	. . . . . . 7 ⊢ ((𝐹‘1) ∈ 𝑆 ↔ ((𝐹‘1) ∈ (0..^𝑁) ∧ ((𝐹‘1) gcd 𝑁) = 1))
61	46, 60	sylib 122	. . . . . 6 ⊢ (𝜑 → ((𝐹‘1) ∈ (0..^𝑁) ∧ ((𝐹‘1) gcd 𝑁) = 1))
62	61	simprd 114	. . . . 5 ⊢ (𝜑 → ((𝐹‘1) gcd 𝑁) = 1)
63	51, 57, 62	3eqtrd 2275	. . . 4 ⊢ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...1)(𝐹‘𝑥)) = 1)
64	63	a1i 9	. . 3 ⊢ ((ϕ‘𝑁) ∈ (ℤ_≥‘1) → (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...1)(𝐹‘𝑥)) = 1))
65		simpr 110	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1) → (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1)
66	38	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
67		fzofzp1 10656	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (1..^(ϕ‘𝑁)) → (𝑘 + 1) ∈ (1...(ϕ‘𝑁)))
68	67	adantl 277	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → (𝑘 + 1) ∈ (1...(ϕ‘𝑁)))
69	66, 68	ffvelcdmd 5844	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → (𝐹‘(𝑘 + 1)) ∈ 𝑆)
70	54, 69	sselid 3246	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → (𝐹‘(𝑘 + 1)) ∈ ℤ)
71	52	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → 𝑁 ∈ ℤ)
72		gcdcom 12769	. . . . . . . . . . 11 ⊢ (((𝐹‘(𝑘 + 1)) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐹‘(𝑘 + 1)) gcd 𝑁) = (𝑁 gcd (𝐹‘(𝑘 + 1))))
73	70, 71, 72	syl2anc 415	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → ((𝐹‘(𝑘 + 1)) gcd 𝑁) = (𝑁 gcd (𝐹‘(𝑘 + 1))))
74		oveq1 6092	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝐹‘(𝑘 + 1)) → (𝑦 gcd 𝑁) = ((𝐹‘(𝑘 + 1)) gcd 𝑁))
75	74	eqeq1d 2247	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝐹‘(𝑘 + 1)) → ((𝑦 gcd 𝑁) = 1 ↔ ((𝐹‘(𝑘 + 1)) gcd 𝑁) = 1))
76	75, 29	elrab2 2985	. . . . . . . . . . . 12 ⊢ ((𝐹‘(𝑘 + 1)) ∈ 𝑆 ↔ ((𝐹‘(𝑘 + 1)) ∈ (0..^𝑁) ∧ ((𝐹‘(𝑘 + 1)) gcd 𝑁) = 1))
77	76	simprbi 275	. . . . . . . . . . 11 ⊢ ((𝐹‘(𝑘 + 1)) ∈ 𝑆 → ((𝐹‘(𝑘 + 1)) gcd 𝑁) = 1)
78	69, 77	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → ((𝐹‘(𝑘 + 1)) gcd 𝑁) = 1)
79	73, 78	eqtr3d 2273	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → (𝑁 gcd (𝐹‘(𝑘 + 1))) = 1)
80	79	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1) → (𝑁 gcd (𝐹‘(𝑘 + 1))) = 1)
81	28	a1i 9	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → 1 ∈ ℤ)
82		elfzoelz 10565	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (1..^(ϕ‘𝑁)) → 𝑘 ∈ ℤ)
83	82	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → 𝑘 ∈ ℤ)
84	81, 83	fzfigd 10883	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → (1...𝑘) ∈ Fin)
85	38	ad2antrr 492	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
86		elfznn 10471	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ (1...𝑘) → 𝑥 ∈ ℕ)
87	86	nnred 9320	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (1...𝑘) → 𝑥 ∈ ℝ)
88	87	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑥 ∈ ℝ)
89	3	nnred 9320	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (ϕ‘𝑁) ∈ ℝ)
90	89	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → (ϕ‘𝑁) ∈ ℝ)
91	82	ad2antlr 493	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑘 ∈ ℤ)
92	91	zred 9773	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑘 ∈ ℝ)
93		elfzle2 10443	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ (1...𝑘) → 𝑥 ≤ 𝑘)
94	93	adantl 277	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑥 ≤ 𝑘)
95		elfzolt2 10575	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (1..^(ϕ‘𝑁)) → 𝑘 < (ϕ‘𝑁))
96	95	ad2antlr 493	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑘 < (ϕ‘𝑁))
97	88, 92, 90, 94, 96	lelttrd 8453	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑥 < (ϕ‘𝑁))
98	88, 90, 97	ltled 8447	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑥 ≤ (ϕ‘𝑁))
99		elfzuz 10435	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (1...𝑘) → 𝑥 ∈ (ℤ_≥‘1))
100	42	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → (ϕ‘𝑁) ∈ ℤ)
101		elfz5 10431	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ (ℤ_≥‘1) ∧ (ϕ‘𝑁) ∈ ℤ) → (𝑥 ∈ (1...(ϕ‘𝑁)) ↔ 𝑥 ≤ (ϕ‘𝑁)))
102	99, 100, 101	syl2an2 602	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → (𝑥 ∈ (1...(ϕ‘𝑁)) ↔ 𝑥 ≤ (ϕ‘𝑁)))
103	98, 102	mpbird 167	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → 𝑥 ∈ (1...(ϕ‘𝑁)))
104	85, 103	ffvelcdmd 5844	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → (𝐹‘𝑥) ∈ 𝑆)
105	54, 104	sselid 3246	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...𝑘)) → (𝐹‘𝑥) ∈ ℤ)
106	84, 105	fprodzcl 12395	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) ∈ ℤ)
107		rpmul 12895	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) ∈ ℤ ∧ (𝐹‘(𝑘 + 1)) ∈ ℤ) → (((𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1 ∧ (𝑁 gcd (𝐹‘(𝑘 + 1))) = 1) → (𝑁 gcd (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1)))) = 1))
108	71, 106, 70, 107	syl3anc 1278	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → (((𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1 ∧ (𝑁 gcd (𝐹‘(𝑘 + 1))) = 1) → (𝑁 gcd (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1)))) = 1))
109	108	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1) → (((𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1 ∧ (𝑁 gcd (𝐹‘(𝑘 + 1))) = 1) → (𝑁 gcd (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1)))) = 1))
110	65, 80, 109	mp2and 437	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1) → (𝑁 gcd (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1)))) = 1)
111		elfzouz 10569	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (1..^(ϕ‘𝑁)) → 𝑘 ∈ (ℤ_≥‘1))
112	111	adantl 277	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → 𝑘 ∈ (ℤ_≥‘1))
113	38	ad2antrr 492	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → 𝐹:(1...(ϕ‘𝑁))⟶𝑆)
114		elfzelz 10439	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ (1...(𝑘 + 1)) → 𝑥 ∈ ℤ)
115	114	zred 9773	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (1...(𝑘 + 1)) → 𝑥 ∈ ℝ)
116	115	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → 𝑥 ∈ ℝ)
117	82	ad2antlr 493	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → 𝑘 ∈ ℤ)
118	117	peano2zd 9776	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (𝑘 + 1) ∈ ℤ)
119	118	zred 9773	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (𝑘 + 1) ∈ ℝ)
120	89	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (ϕ‘𝑁) ∈ ℝ)
121		elfzle2 10443	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (1...(𝑘 + 1)) → 𝑥 ≤ (𝑘 + 1))
122	121	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → 𝑥 ≤ (𝑘 + 1))
123		elfzle2 10443	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 + 1) ∈ (1...(ϕ‘𝑁)) → (𝑘 + 1) ≤ (ϕ‘𝑁))
124	67, 123	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (1..^(ϕ‘𝑁)) → (𝑘 + 1) ≤ (ϕ‘𝑁))
125	124	ad2antlr 493	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (𝑘 + 1) ≤ (ϕ‘𝑁))
126	116, 119, 120, 122, 125	letrd 8452	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → 𝑥 ≤ (ϕ‘𝑁))
127		elfzuz 10435	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (1...(𝑘 + 1)) → 𝑥 ∈ (ℤ_≥‘1))
128	42	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (ϕ‘𝑁) ∈ ℤ)
129	127, 128, 101	syl2an2 602	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (𝑥 ∈ (1...(ϕ‘𝑁)) ↔ 𝑥 ≤ (ϕ‘𝑁)))
130	126, 129	mpbird 167	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → 𝑥 ∈ (1...(ϕ‘𝑁)))
131	113, 130	ffvelcdmd 5844	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (𝐹‘𝑥) ∈ 𝑆)
132	35, 131	sselid 3246	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ 𝑥 ∈ (1...(𝑘 + 1))) → (𝐹‘𝑥) ∈ ℂ)
133		fveq2 5695	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑘 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑘 + 1)))
134	112, 132, 133	fprodp1 12386	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥) = (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1))))
135	134	oveq2d 6101	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = (𝑁 gcd (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1)))))
136	135	eqeq1d 2247	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → ((𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1 ↔ (𝑁 gcd (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1)))) = 1))
137	136	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1) → ((𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1 ↔ (𝑁 gcd (∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥) · (𝐹‘(𝑘 + 1)))) = 1))
138	110, 137	mpbird 167	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) ∧ (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1) → (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1)
139	138	ex 115	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (1..^(ϕ‘𝑁))) → ((𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1 → (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1))
140	139	expcom 116	. . . 4 ⊢ (𝑘 ∈ (1..^(ϕ‘𝑁)) → (𝜑 → ((𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1 → (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1)))
141	140	a2d 26	. . 3 ⊢ (𝑘 ∈ (1..^(ϕ‘𝑁)) → ((𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...𝑘)(𝐹‘𝑥)) = 1) → (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...(𝑘 + 1))(𝐹‘𝑥)) = 1)))
142	12, 17, 22, 27, 64, 141	fzind2 10669	. 2 ⊢ ((ϕ‘𝑁) ∈ (1...(ϕ‘𝑁)) → (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥)) = 1))
143	7, 142	mpcom 36	1 ⊢ (𝜑 → (𝑁 gcd ∏𝑥 ∈ (1...(ϕ‘𝑁))(𝐹‘𝑥)) = 1)

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 {crab 2532 class class class wbr 4130 ⟶wf 5373 –1-1-onto→wf1o 5376 ‘cfv 5377 (class class class)co 6085 ℂcc 8178 ℝcr 8179 0cc0 8180 1c1 8181 + caddc 8183 · cmul 8185 < clt 8361 ≤ cle 8362 ℕcn 9307 ℕ₀cn0 9568 ℤcz 9649 ℤ_≥cuz 9931 ...cfz 10422 ..^cfzo 10560 ∏cprod 12336 gcd cgcd 12749 ϕcphi 13010

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 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 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 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-sup 7325 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-fz 10423 df-fzo 10561 df-fl 10716 df-mod 10775 df-seqfrec 10900 df-exp 10991 df-ihash 11231 df-cj 11623 df-re 11624 df-im 11625 df-rsqrt 11780 df-abs 11781 df-clim 12064 df-proddc 12337 df-dvds 12574 df-gcd 12750 df-phi 13012

This theorem is used by: eulerthlemth 13033

W3C validator