Theorem coprmproddvds 16818

Description: If a positive integer is divisible by each element of a set of pairwise coprime positive integers, then it is divisible by their product. (Contributed by AV, 19-Aug-2020.)

Assertion

Ref	Expression
coprmproddvds	⊢ (((𝑀 ⊆ ℕ ∧ 𝑀 ∈ Fin) ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ) ∧ (∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)

Distinct variable groups:   𝑚,𝐹,𝑛   𝑚,𝐾   𝑚,𝑀,𝑛

Allowed substitution hint:   𝐾(𝑛)

Proof of Theorem coprmproddvds

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cleq1lem 15115	. . . . . . 7 ⊢ (𝑥 = ∅ → ((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ↔ (∅ ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ))))
2		difeq1 4067	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → (𝑥 ∖ {𝑚}) = (∅ ∖ {𝑚}))
3	2	raleqdv 3320	. . . . . . . . 9 ⊢ (𝑥 = ∅ → (∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑛 ∈ (∅ ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
4	3	raleqbi1dv 3330	. . . . . . . 8 ⊢ (𝑥 = ∅ → (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑚 ∈ ∅ ∀𝑛 ∈ (∅ ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
5		raleq 3317	. . . . . . . 8 ⊢ (𝑥 = ∅ → (∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∀𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾))
6	4, 5	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = ∅ → ((∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ (∀𝑚 ∈ ∅ ∀𝑛 ∈ (∅ ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾)))
7	1, 6	anbi12d 644	. . . . . 6 ⊢ (𝑥 = ∅ → (((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) ↔ ((∅ ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ ∅ ∀𝑛 ∈ (∅ ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾))))
8		prodeq1 16056	. . . . . . 7 ⊢ (𝑥 = ∅ → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) = ∏𝑚 ∈ ∅ (𝐹‘𝑚))
9	8	breq1d 5113	. . . . . 6 ⊢ (𝑥 = ∅ → (∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∏𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾))
10	7, 9	imbi12d 347	. . . . 5 ⊢ (𝑥 = ∅ → ((((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ (((∅ ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ ∅ ∀𝑛 ∈ (∅ ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾)))
11		cleq1lem 15115	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ↔ (𝑦 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ))))
12		difeq1 4067	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 ∖ {𝑚}) = (𝑦 ∖ {𝑚}))
13	12	raleqdv 3320	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑛 ∈ (𝑦 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
14	13	raleqbi1dv 3330	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑚 ∈ 𝑦 ∀𝑛 ∈ (𝑦 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
15		raleq 3317	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∀𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾))
16	14, 15	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ (∀𝑚 ∈ 𝑦 ∀𝑛 ∈ (𝑦 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾)))
17	11, 16	anbi12d 644	. . . . . 6 ⊢ (𝑥 = 𝑦 → (((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) ↔ ((𝑦 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑦 ∀𝑛 ∈ (𝑦 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾))))
18		prodeq1 16056	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) = ∏𝑚 ∈ 𝑦 (𝐹‘𝑚))
19	18	breq1d 5113	. . . . . 6 ⊢ (𝑥 = 𝑦 → (∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∏𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾))
20	17, 19	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝑦 → ((((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ (((𝑦 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑦 ∀𝑛 ∈ (𝑦 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾)))
21		cleq1lem 15115	. . . . . . 7 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ↔ ((𝑦 ∪ {𝑧}) ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ))))
22		difeq1 4067	. . . . . . . . . 10 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥 ∖ {𝑚}) = ((𝑦 ∪ {𝑧}) ∖ {𝑚}))
23	22	raleqdv 3320	. . . . . . . . 9 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑛 ∈ ((𝑦 ∪ {𝑧}) ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
24	23	raleqbi1dv 3330	. . . . . . . 8 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑚 ∈ (𝑦 ∪ {𝑧})∀𝑛 ∈ ((𝑦 ∪ {𝑧}) ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
25		raleq 3317	. . . . . . . 8 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∀𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾))
26	24, 25	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ (∀𝑚 ∈ (𝑦 ∪ {𝑧})∀𝑛 ∈ ((𝑦 ∪ {𝑧}) ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾)))
27	21, 26	anbi12d 644	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) ↔ (((𝑦 ∪ {𝑧}) ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ (𝑦 ∪ {𝑧})∀𝑛 ∈ ((𝑦 ∪ {𝑧}) ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾))))
28		prodeq1 16056	. . . . . . 7 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) = ∏𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚))
29	28	breq1d 5113	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∏𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾))
30	27, 29	imbi12d 347	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ ((((𝑦 ∪ {𝑧}) ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ (𝑦 ∪ {𝑧})∀𝑛 ∈ ((𝑦 ∪ {𝑧}) ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾)))
31		cleq1lem 15115	. . . . . . 7 ⊢ (𝑥 = 𝑀 → ((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ↔ (𝑀 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ))))
32		difeq1 4067	. . . . . . . . . 10 ⊢ (𝑥 = 𝑀 → (𝑥 ∖ {𝑚}) = (𝑀 ∖ {𝑚}))
33	32	raleqdv 3320	. . . . . . . . 9 ⊢ (𝑥 = 𝑀 → (∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
34	33	raleqbi1dv 3330	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ↔ ∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1))
35		raleq 3317	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → (∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾))
36	34, 35	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = 𝑀 → ((∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ (∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)))
37	31, 36	anbi12d 644	. . . . . 6 ⊢ (𝑥 = 𝑀 → (((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) ↔ ((𝑀 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾))))
38		prodeq1 16056	. . . . . . 7 ⊢ (𝑥 = 𝑀 → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) = ∏𝑚 ∈ 𝑀 (𝐹‘𝑚))
39	38	breq1d 5113	. . . . . 6 ⊢ (𝑥 = 𝑀 → (∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾 ↔ ∏𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾))
40	37, 39	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝑀 → ((((𝑥 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑥 ∀𝑛 ∈ (𝑥 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑥 (𝐹‘𝑚) ∥ 𝐾) ↔ (((𝑀 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)))
41		prod0 16090	. . . . . . . 8 ⊢ ∏𝑚 ∈ ∅ (𝐹‘𝑚) = 1
42		nnz 12695	. . . . . . . . 9 ⊢ (𝐾 ∈ ℕ → 𝐾 ∈ ℤ)
43		1dvds 16420	. . . . . . . . 9 ⊢ (𝐾 ∈ ℤ → 1 ∥ 𝐾)
44	42, 43	syl 18	. . . . . . . 8 ⊢ (𝐾 ∈ ℕ → 1 ∥ 𝐾)
45	41, 44	eqbrtrid 5140	. . . . . . 7 ⊢ (𝐾 ∈ ℕ → ∏𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾)
46	45	adantr 486	. . . . . 6 ⊢ ((𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ) → ∏𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾)
47	46	ad2antlr 740	. . . . 5 ⊢ (((∅ ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ ∅ ∀𝑛 ∈ (∅ ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ ∅ (𝐹‘𝑚) ∥ 𝐾)
48		coprmproddvdslem 16817	. . . . 5 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → ((((𝑦 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑦 ∀𝑛 ∈ (𝑦 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑦 (𝐹‘𝑚) ∥ 𝐾) → ((((𝑦 ∪ {𝑧}) ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ (𝑦 ∪ {𝑧})∀𝑛 ∈ ((𝑦 ∪ {𝑧}) ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ (𝑦 ∪ {𝑧})(𝐹‘𝑚) ∥ 𝐾)))
49	10, 20, 30, 40, 47, 48	findcard2s 9165	. . . 4 ⊢ (𝑀 ∈ Fin → (((𝑀 ⊆ ℕ ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ)) ∧ (∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾))
50	49	exp4c 438	. . 3 ⊢ (𝑀 ∈ Fin → (𝑀 ⊆ ℕ → ((𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ) → ((∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾) → ∏𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾))))
51	50	impcom 413	. 2 ⊢ ((𝑀 ⊆ ℕ ∧ 𝑀 ∈ Fin) → ((𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ) → ((∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾) → ∏𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)))
52	51	3imp 1128	1 ⊢ (((𝑀 ⊆ ℕ ∧ 𝑀 ∈ Fin) ∧ (𝐾 ∈ ℕ ∧ 𝐹:ℕ⟶ℕ) ∧ (∀𝑚 ∈ 𝑀 ∀𝑛 ∈ (𝑀 ∖ {𝑚})((𝐹‘𝑚) gcd (𝐹‘𝑛)) = 1 ∧ ∀𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)) → ∏𝑚 ∈ 𝑀 (𝐹‘𝑚) ∥ 𝐾)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∖ cdif 3896   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  {csn 4584   class class class wbr 5103  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412  Fincfn 8957  1c1 11182  ℕcn 12316  ℤcz 12674  ∏cprod 16052   ∥ cdvds 16402   gcd cgcd 16644

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-inf2 9626  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258  ax-pre-sup 11259

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-er 8701  df-en 8958  df-dom 8959  df-sdom 8960  df-fin 8961  df-sup 9418  df-inf 9419  df-oi 9488  df-card 10001  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-div 11955  df-nn 12317  df-2 12386  df-3 12387  df-n0 12588  df-z 12675  df-uz 12947  df-rp 13102  df-fz 13621  df-fzo 13769  df-fl 13912  df-mod 13990  df-seq 14125  df-exp 14185  df-hash 14455  df-cj 15246  df-re 15247  df-im 15248  df-sqrt 15382  df-abs 15383  df-clim 15635  df-prod 16053  df-dvds 16403  df-gcd 16645

This theorem is used by:  prmodvdslcmf  17205