fprodmodd - Metamath Proof Explorer

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

Theorem fprodmodd 15941

Description: If all factors of two finite products are equal modulo 𝑀, the products are equal modulo 𝑀. (Contributed by AV, 7-Jul-2021.)

**Hypotheses**
Ref	Expression
fprodmodd.a	⊢ (𝜑 → 𝐴 ∈ Fin)
fprodmodd.b	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℤ)
fprodmodd.c	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℤ)
fprodmodd.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
fprodmodd.p	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 mod 𝑀) = (𝐶 mod 𝑀))

**Assertion**
Ref	Expression
fprodmodd	⊢ (𝜑 → (∏𝑘 ∈ 𝐴 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝐴 𝐶 mod 𝑀))

Distinct variable groups: 𝐴,𝑘 𝑘,𝑀 𝜑,𝑘 Allowed substitution hints: 𝐵(𝑘) 𝐶(𝑘)

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

Step	Hyp	Ref	Expression
1		prodeq1 15853	. . . 4 ⊢ (𝑥 = ∅ → ∏𝑘 ∈ 𝑥 𝐵 = ∏𝑘 ∈ ∅ 𝐵)
2	1	oveq1d 7424	. . 3 ⊢ (𝑥 = ∅ → (∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ ∅ 𝐵 mod 𝑀))
3		prodeq1 15853	. . . 4 ⊢ (𝑥 = ∅ → ∏𝑘 ∈ 𝑥 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
4	3	oveq1d 7424	. . 3 ⊢ (𝑥 = ∅ → (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) = (∏𝑘 ∈ ∅ 𝐶 mod 𝑀))
5	2, 4	eqeq12d 2749	. 2 ⊢ (𝑥 = ∅ → ((∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) ↔ (∏𝑘 ∈ ∅ 𝐵 mod 𝑀) = (∏𝑘 ∈ ∅ 𝐶 mod 𝑀)))
6		prodeq1 15853	. . . 4 ⊢ (𝑥 = 𝑦 → ∏𝑘 ∈ 𝑥 𝐵 = ∏𝑘 ∈ 𝑦 𝐵)
7	6	oveq1d 7424	. . 3 ⊢ (𝑥 = 𝑦 → (∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀))
8		prodeq1 15853	. . . 4 ⊢ (𝑥 = 𝑦 → ∏𝑘 ∈ 𝑥 𝐶 = ∏𝑘 ∈ 𝑦 𝐶)
9	8	oveq1d 7424	. . 3 ⊢ (𝑥 = 𝑦 → (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀))
10	7, 9	eqeq12d 2749	. 2 ⊢ (𝑥 = 𝑦 → ((∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) ↔ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)))
11		prodeq1 15853	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑖}) → ∏𝑘 ∈ 𝑥 𝐵 = ∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵)
12	11	oveq1d 7424	. . 3 ⊢ (𝑥 = (𝑦 ∪ {𝑖}) → (∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵 mod 𝑀))
13		prodeq1 15853	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑖}) → ∏𝑘 ∈ 𝑥 𝐶 = ∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶)
14	13	oveq1d 7424	. . 3 ⊢ (𝑥 = (𝑦 ∪ {𝑖}) → (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) = (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 mod 𝑀))
15	12, 14	eqeq12d 2749	. 2 ⊢ (𝑥 = (𝑦 ∪ {𝑖}) → ((∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) ↔ (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵 mod 𝑀) = (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 mod 𝑀)))
16		prodeq1 15853	. . . 4 ⊢ (𝑥 = 𝐴 → ∏𝑘 ∈ 𝑥 𝐵 = ∏𝑘 ∈ 𝐴 𝐵)
17	16	oveq1d 7424	. . 3 ⊢ (𝑥 = 𝐴 → (∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝐴 𝐵 mod 𝑀))
18		prodeq1 15853	. . . 4 ⊢ (𝑥 = 𝐴 → ∏𝑘 ∈ 𝑥 𝐶 = ∏𝑘 ∈ 𝐴 𝐶)
19	18	oveq1d 7424	. . 3 ⊢ (𝑥 = 𝐴 → (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) = (∏𝑘 ∈ 𝐴 𝐶 mod 𝑀))
20	17, 19	eqeq12d 2749	. 2 ⊢ (𝑥 = 𝐴 → ((∏𝑘 ∈ 𝑥 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑥 𝐶 mod 𝑀) ↔ (∏𝑘 ∈ 𝐴 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝐴 𝐶 mod 𝑀)))
21		prod0 15887	. . . . 5 ⊢ ∏𝑘 ∈ ∅ 𝐵 = 1
22	21	a1i 11	. . . 4 ⊢ (𝜑 → ∏𝑘 ∈ ∅ 𝐵 = 1)
23	22	oveq1d 7424	. . 3 ⊢ (𝜑 → (∏𝑘 ∈ ∅ 𝐵 mod 𝑀) = (1 mod 𝑀))
24		prod0 15887	. . . . 5 ⊢ ∏𝑘 ∈ ∅ 𝐶 = 1
25	24	eqcomi 2742	. . . 4 ⊢ 1 = ∏𝑘 ∈ ∅ 𝐶
26	25	oveq1i 7419	. . 3 ⊢ (1 mod 𝑀) = (∏𝑘 ∈ ∅ 𝐶 mod 𝑀)
27	23, 26	eqtrdi 2789	. 2 ⊢ (𝜑 → (∏𝑘 ∈ ∅ 𝐵 mod 𝑀) = (∏𝑘 ∈ ∅ 𝐶 mod 𝑀))
28		nfv 1918	. . . . . . 7 ⊢ Ⅎ𝑘(𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦)))
29		nfcsb1v 3919	. . . . . . 7 ⊢ Ⅎ𝑘⦋𝑖 / 𝑘⦌𝐵
30		ssfi 9173	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin ∧ 𝑦 ⊆ 𝐴) → 𝑦 ∈ Fin)
31	30	ex 414	. . . . . . . . . 10 ⊢ (𝐴 ∈ Fin → (𝑦 ⊆ 𝐴 → 𝑦 ∈ Fin))
32		fprodmodd.a	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ Fin)
33	31, 32	syl11 33	. . . . . . . . 9 ⊢ (𝑦 ⊆ 𝐴 → (𝜑 → 𝑦 ∈ Fin))
34	33	adantr 482	. . . . . . . 8 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦)) → (𝜑 → 𝑦 ∈ Fin))
35	34	impcom 409	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → 𝑦 ∈ Fin)
36		simpr 486	. . . . . . . 8 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦)) → 𝑖 ∈ (𝐴 ∖ 𝑦))
37	36	adantl 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → 𝑖 ∈ (𝐴 ∖ 𝑦))
38		eldifn 4128	. . . . . . . . 9 ⊢ (𝑖 ∈ (𝐴 ∖ 𝑦) → ¬ 𝑖 ∈ 𝑦)
39	38	adantl 483	. . . . . . . 8 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦)) → ¬ 𝑖 ∈ 𝑦)
40	39	adantl 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ¬ 𝑖 ∈ 𝑦)
41		simpll 766	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝜑)
42		ssel 3976	. . . . . . . . . . . 12 ⊢ (𝑦 ⊆ 𝐴 → (𝑘 ∈ 𝑦 → 𝑘 ∈ 𝐴))
43	42	adantr 482	. . . . . . . . . . 11 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦)) → (𝑘 ∈ 𝑦 → 𝑘 ∈ 𝐴))
44	43	adantl 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → (𝑘 ∈ 𝑦 → 𝑘 ∈ 𝐴))
45	44	imp 408	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝑘 ∈ 𝐴)
46		fprodmodd.b	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℤ)
47	41, 45, 46	syl2anc 585	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝐵 ∈ ℤ)
48	47	zcnd 12667	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝐵 ∈ ℂ)
49		csbeq1a 3908	. . . . . . 7 ⊢ (𝑘 = 𝑖 → 𝐵 = ⦋𝑖 / 𝑘⦌𝐵)
50		eldifi 4127	. . . . . . . . . 10 ⊢ (𝑖 ∈ (𝐴 ∖ 𝑦) → 𝑖 ∈ 𝐴)
51	50	adantl 483	. . . . . . . . 9 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦)) → 𝑖 ∈ 𝐴)
52	46	ralrimiva 3147	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℤ)
53		rspcsbela 4436	. . . . . . . . 9 ⊢ ((𝑖 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 𝐵 ∈ ℤ) → ⦋𝑖 / 𝑘⦌𝐵 ∈ ℤ)
54	51, 52, 53	syl2anr 598	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ⦋𝑖 / 𝑘⦌𝐵 ∈ ℤ)
55	54	zcnd 12667	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ⦋𝑖 / 𝑘⦌𝐵 ∈ ℂ)
56	28, 29, 35, 37, 40, 48, 49, 55	fprodsplitsn 15933	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵 = (∏𝑘 ∈ 𝑦 𝐵 · ⦋𝑖 / 𝑘⦌𝐵))
57	56	oveq1d 7424	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵 mod 𝑀) = ((∏𝑘 ∈ 𝑦 𝐵 · ⦋𝑖 / 𝑘⦌𝐵) mod 𝑀))
58	57	adantr 482	. . . 4 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵 mod 𝑀) = ((∏𝑘 ∈ 𝑦 𝐵 · ⦋𝑖 / 𝑘⦌𝐵) mod 𝑀))
59	35, 47	fprodzcl 15898	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ∏𝑘 ∈ 𝑦 𝐵 ∈ ℤ)
60	59	adantr 482	. . . . 5 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → ∏𝑘 ∈ 𝑦 𝐵 ∈ ℤ)
61		fprodmodd.c	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℤ)
62	41, 45, 61	syl2anc 585	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝐶 ∈ ℤ)
63	35, 62	fprodzcl 15898	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ∏𝑘 ∈ 𝑦 𝐶 ∈ ℤ)
64	63	adantr 482	. . . . 5 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → ∏𝑘 ∈ 𝑦 𝐶 ∈ ℤ)
65	54	adantr 482	. . . . 5 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → ⦋𝑖 / 𝑘⦌𝐵 ∈ ℤ)
66	61	ralrimiva 3147	. . . . . . 7 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℤ)
67		rspcsbela 4436	. . . . . . 7 ⊢ ((𝑖 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 𝐶 ∈ ℤ) → ⦋𝑖 / 𝑘⦌𝐶 ∈ ℤ)
68	51, 66, 67	syl2anr 598	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ⦋𝑖 / 𝑘⦌𝐶 ∈ ℤ)
69	68	adantr 482	. . . . 5 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → ⦋𝑖 / 𝑘⦌𝐶 ∈ ℤ)
70		fprodmodd.m	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℕ)
71	70	nnrpd 13014	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℝ⁺)
72	71	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → 𝑀 ∈ ℝ⁺)
73	72	adantr 482	. . . . 5 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → 𝑀 ∈ ℝ⁺)
74		simpr 486	. . . . 5 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀))
75		fprodmodd.p	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 mod 𝑀) = (𝐶 mod 𝑀))
76	75	ralrimiva 3147	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 (𝐵 mod 𝑀) = (𝐶 mod 𝑀))
77		rspsbca 3875	. . . . . . . . 9 ⊢ ((𝑖 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝐵 mod 𝑀) = (𝐶 mod 𝑀)) → [𝑖 / 𝑘](𝐵 mod 𝑀) = (𝐶 mod 𝑀))
78	51, 76, 77	syl2anr 598	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → [𝑖 / 𝑘](𝐵 mod 𝑀) = (𝐶 mod 𝑀))
79		vex 3479	. . . . . . . . 9 ⊢ 𝑖 ∈ V
80		sbceqg 4410	. . . . . . . . 9 ⊢ (𝑖 ∈ V → ([𝑖 / 𝑘](𝐵 mod 𝑀) = (𝐶 mod 𝑀) ↔ ⦋𝑖 / 𝑘⦌(𝐵 mod 𝑀) = ⦋𝑖 / 𝑘⦌(𝐶 mod 𝑀)))
81	79, 80	mp1i 13	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ([𝑖 / 𝑘](𝐵 mod 𝑀) = (𝐶 mod 𝑀) ↔ ⦋𝑖 / 𝑘⦌(𝐵 mod 𝑀) = ⦋𝑖 / 𝑘⦌(𝐶 mod 𝑀)))
82	78, 81	mpbid 231	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ⦋𝑖 / 𝑘⦌(𝐵 mod 𝑀) = ⦋𝑖 / 𝑘⦌(𝐶 mod 𝑀))
83		csbov1g 7454	. . . . . . . 8 ⊢ (𝑖 ∈ V → ⦋𝑖 / 𝑘⦌(𝐵 mod 𝑀) = (⦋𝑖 / 𝑘⦌𝐵 mod 𝑀))
84	83	elv 3481	. . . . . . 7 ⊢ ⦋𝑖 / 𝑘⦌(𝐵 mod 𝑀) = (⦋𝑖 / 𝑘⦌𝐵 mod 𝑀)
85		csbov1g 7454	. . . . . . . 8 ⊢ (𝑖 ∈ V → ⦋𝑖 / 𝑘⦌(𝐶 mod 𝑀) = (⦋𝑖 / 𝑘⦌𝐶 mod 𝑀))
86	85	elv 3481	. . . . . . 7 ⊢ ⦋𝑖 / 𝑘⦌(𝐶 mod 𝑀) = (⦋𝑖 / 𝑘⦌𝐶 mod 𝑀)
87	82, 84, 86	3eqtr3g 2796	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → (⦋𝑖 / 𝑘⦌𝐵 mod 𝑀) = (⦋𝑖 / 𝑘⦌𝐶 mod 𝑀))
88	87	adantr 482	. . . . 5 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → (⦋𝑖 / 𝑘⦌𝐵 mod 𝑀) = (⦋𝑖 / 𝑘⦌𝐶 mod 𝑀))
89	60, 64, 65, 69, 73, 74, 88	modmul12d 13890	. . . 4 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → ((∏𝑘 ∈ 𝑦 𝐵 · ⦋𝑖 / 𝑘⦌𝐵) mod 𝑀) = ((∏𝑘 ∈ 𝑦 𝐶 · ⦋𝑖 / 𝑘⦌𝐶) mod 𝑀))
90		nfcsb1v 3919	. . . . . . . 8 ⊢ Ⅎ𝑘⦋𝑖 / 𝑘⦌𝐶
91	62	zcnd 12667	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ 𝑘 ∈ 𝑦) → 𝐶 ∈ ℂ)
92		csbeq1a 3908	. . . . . . . 8 ⊢ (𝑘 = 𝑖 → 𝐶 = ⦋𝑖 / 𝑘⦌𝐶)
93	68	zcnd 12667	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ⦋𝑖 / 𝑘⦌𝐶 ∈ ℂ)
94	28, 90, 35, 37, 40, 91, 92, 93	fprodsplitsn 15933	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 = (∏𝑘 ∈ 𝑦 𝐶 · ⦋𝑖 / 𝑘⦌𝐶))
95	94	oveq1d 7424	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 mod 𝑀) = ((∏𝑘 ∈ 𝑦 𝐶 · ⦋𝑖 / 𝑘⦌𝐶) mod 𝑀))
96	95	eqcomd 2739	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ((∏𝑘 ∈ 𝑦 𝐶 · ⦋𝑖 / 𝑘⦌𝐶) mod 𝑀) = (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 mod 𝑀))
97	96	adantr 482	. . . 4 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → ((∏𝑘 ∈ 𝑦 𝐶 · ⦋𝑖 / 𝑘⦌𝐶) mod 𝑀) = (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 mod 𝑀))
98	58, 89, 97	3eqtrd 2777	. . 3 ⊢ (((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) ∧ (∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀)) → (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵 mod 𝑀) = (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 mod 𝑀))
99	98	ex 414	. 2 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑖 ∈ (𝐴 ∖ 𝑦))) → ((∏𝑘 ∈ 𝑦 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝑦 𝐶 mod 𝑀) → (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐵 mod 𝑀) = (∏𝑘 ∈ (𝑦 ∪ {𝑖})𝐶 mod 𝑀)))
100	5, 10, 15, 20, 27, 99, 32	findcard2d 9166	1 ⊢ (𝜑 → (∏𝑘 ∈ 𝐴 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝐴 𝐶 mod 𝑀))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 [wsbc 3778 ⦋csb 3894 ∖ cdif 3946 ∪ cun 3947 ⊆ wss 3949 ∅c0 4323 {csn 4629 (class class class)co 7409 Fincfn 8939 1c1 11111 · cmul 11115 ℕcn 12212 ℤcz 12558 ℝ⁺crp 12974 mod cmo 13834 ∏cprod 15849

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-oi 9505 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-fz 13485 df-fzo 13628 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-hash 14291 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-clim 15432 df-prod 15850

This theorem is referenced by: gausslemma2dlem5a 26873

W3C validator