smueqlem - Metamath Proof Explorer

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

Theorem smueqlem 15839

Description: Any element of a sequence multiplication only depends on the values of the argument sequences up to and including that point. (Contributed by Mario Carneiro, 20-Sep-2016.)

**Hypotheses**
Ref	Expression
smueq.a	⊢ (𝜑 → 𝐴 ⊆ ℕ₀)
smueq.b	⊢ (𝜑 → 𝐵 ⊆ ℕ₀)
smueq.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
smueq.p	⊢ 𝑃 = seq0((𝑝 ∈ 𝒫 ℕ₀, 𝑚 ∈ ℕ₀ ↦ (𝑝 sadd {𝑛 ∈ ℕ₀ ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ 𝐵)})), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
smueq.q	⊢ 𝑄 = seq0((𝑝 ∈ 𝒫 ℕ₀, 𝑚 ∈ ℕ₀ ↦ (𝑝 sadd {𝑛 ∈ ℕ₀ ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ (𝐵 ∩ (0..^𝑁)))})), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))

**Assertion**
Ref	Expression
smueqlem	⊢ (𝜑 → ((𝐴 smul 𝐵) ∩ (0..^𝑁)) = (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁)))

Distinct variable groups: 𝑚,𝑛,𝑝,𝐴 𝐵,𝑚,𝑛,𝑝 𝑚,𝑁,𝑛,𝑝 𝜑,𝑛 Allowed substitution hints: 𝜑(𝑚,𝑝) 𝑃(𝑚,𝑛,𝑝) 𝑄(𝑚,𝑛,𝑝)

Proof of Theorem smueqlem Dummy variables 𝑘 𝑖 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		smueq.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ ℕ₀)
2	1	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝐴 ⊆ ℕ₀)
3		smueq.b	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ⊆ ℕ₀)
4	3	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝐵 ⊆ ℕ₀)
5		smueq.p	. . . . . . 7 ⊢ 𝑃 = seq0((𝑝 ∈ 𝒫 ℕ₀, 𝑚 ∈ ℕ₀ ↦ (𝑝 sadd {𝑛 ∈ ℕ₀ ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ 𝐵)})), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
6		elfzouz 13043	. . . . . . . . 9 ⊢ (𝑘 ∈ (0..^𝑁) → 𝑘 ∈ (ℤ_≥‘0))
7	6	adantl 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 ∈ (ℤ_≥‘0))
8		nn0uz 12281	. . . . . . . 8 ⊢ ℕ₀ = (ℤ_≥‘0)
9	7, 8	eleqtrrdi 2924	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 ∈ ℕ₀)
10	9	nn0zd 12086	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 ∈ ℤ)
11	10	peano2zd 12091	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 + 1) ∈ ℤ)
12		smueq.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
13	12	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑁 ∈ ℕ₀)
14	13	nn0zd 12086	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑁 ∈ ℤ)
15		elfzolt2 13048	. . . . . . . . . 10 ⊢ (𝑘 ∈ (0..^𝑁) → 𝑘 < 𝑁)
16	15	adantl 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 < 𝑁)
17		nn0ltp1le 12041	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑘 < 𝑁 ↔ (𝑘 + 1) ≤ 𝑁))
18	9, 13, 17	syl2anc 586	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 < 𝑁 ↔ (𝑘 + 1) ≤ 𝑁))
19	16, 18	mpbid 234	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 + 1) ≤ 𝑁)
20		eluz2 12250	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘(𝑘 + 1)) ↔ ((𝑘 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑘 + 1) ≤ 𝑁))
21	11, 14, 19, 20	syl3anbrc 1339	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑁 ∈ (ℤ_≥‘(𝑘 + 1)))
22	2, 4, 5, 9, 21	smuval2 15831	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝐴 smul 𝐵) ↔ 𝑘 ∈ (𝑃‘𝑁)))
23	12, 8	eleqtrdi 2923	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘0))
24		eluzfz2b 12917	. . . . . . . . . . 11 ⊢ (𝑁 ∈ (ℤ_≥‘0) ↔ 𝑁 ∈ (0...𝑁))
25	23, 24	sylib 220	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ (0...𝑁))
26		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 0 → (𝑃‘𝑥) = (𝑃‘0))
27	26	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘0) ∩ (0..^𝑁)))
28		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 0 → (𝑄‘𝑥) = (𝑄‘0))
29	28	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0 → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁)))
30	27, 29	eqeq12d 2837	. . . . . . . . . . . 12 ⊢ (𝑥 = 0 → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁))))
31	30	imbi2d 343	. . . . . . . . . . 11 ⊢ (𝑥 = 0 → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁)))))
32		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑖 → (𝑃‘𝑥) = (𝑃‘𝑖))
33	32	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑖 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘𝑖) ∩ (0..^𝑁)))
34		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑖 → (𝑄‘𝑥) = (𝑄‘𝑖))
35	34	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑖 → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)))
36	33, 35	eqeq12d 2837	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑖 → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁))))
37	36	imbi2d 343	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑖 → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)))))
38		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝑖 + 1) → (𝑃‘𝑥) = (𝑃‘(𝑖 + 1)))
39	38	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑖 + 1) → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)))
40		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝑖 + 1) → (𝑄‘𝑥) = (𝑄‘(𝑖 + 1)))
41	40	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑖 + 1) → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))
42	39, 41	eqeq12d 2837	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑖 + 1) → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁))))
43	42	imbi2d 343	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑖 + 1) → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))))
44		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑁 → (𝑃‘𝑥) = (𝑃‘𝑁))
45	44	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑁 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑃‘𝑁) ∩ (0..^𝑁)))
46		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑁 → (𝑄‘𝑥) = (𝑄‘𝑁))
47	46	ineq1d 4188	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑁 → ((𝑄‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))
48	45, 47	eqeq12d 2837	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑁 → (((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁)) ↔ ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁))))
49	48	imbi2d 343	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑁 → ((𝜑 → ((𝑃‘𝑥) ∩ (0..^𝑁)) = ((𝑄‘𝑥) ∩ (0..^𝑁))) ↔ (𝜑 → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))))
50	1, 3, 5	smup0 15828	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑃‘0) = ∅)
51		inss1 4205	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∩ (0..^𝑁)) ⊆ 𝐵
52	51, 3	sstrid 3978	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐵 ∩ (0..^𝑁)) ⊆ ℕ₀)
53		smueq.q	. . . . . . . . . . . . . . 15 ⊢ 𝑄 = seq0((𝑝 ∈ 𝒫 ℕ₀, 𝑚 ∈ ℕ₀ ↦ (𝑝 sadd {𝑛 ∈ ℕ₀ ∣ (𝑚 ∈ 𝐴 ∧ (𝑛 − 𝑚) ∈ (𝐵 ∩ (0..^𝑁)))})), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
54	1, 52, 53	smup0 15828	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑄‘0) = ∅)
55	50, 54	eqtr4d 2859	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑃‘0) = (𝑄‘0))
56	55	ineq1d 4188	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁)))
57	56	a1i 11	. . . . . . . . . . 11 ⊢ (𝑁 ∈ (ℤ_≥‘0) → (𝜑 → ((𝑃‘0) ∩ (0..^𝑁)) = ((𝑄‘0) ∩ (0..^𝑁))))
58		oveq1 7163	. . . . . . . . . . . . . . 15 ⊢ (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → (((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) = (((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))))
59	58	ineq1d 4188	. . . . . . . . . . . . . 14 ⊢ (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
60	1	adantr 483	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝐴 ⊆ ℕ₀)
61	3	adantr 483	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝐵 ⊆ ℕ₀)
62		elfzonn0 13083	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑖 ∈ (0..^𝑁) → 𝑖 ∈ ℕ₀)
63	62	adantl 484	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝑖 ∈ ℕ₀)
64	60, 61, 5, 63	smupp1 15829	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑃‘(𝑖 + 1)) = ((𝑃‘𝑖) sadd {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}))
65	64	ineq1d 4188	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = (((𝑃‘𝑖) sadd {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}) ∩ (0..^𝑁)))
66	1, 3, 5	smupf 15827	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑃:ℕ₀⟶𝒫 ℕ₀)
67		ffvelrn 6849	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑃:ℕ₀⟶𝒫 ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑃‘𝑖) ∈ 𝒫 ℕ₀)
68	66, 62, 67	syl2an 597	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑃‘𝑖) ∈ 𝒫 ℕ₀)
69	68	elpwid 4550	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑃‘𝑖) ⊆ ℕ₀)
70		ssrab2 4056	. . . . . . . . . . . . . . . . . 18 ⊢ {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ⊆ ℕ₀
71	70	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ⊆ ℕ₀)
72	12	adantr 483	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → 𝑁 ∈ ℕ₀)
73	69, 71, 72	sadeq 15821	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑃‘𝑖) sadd {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}) ∩ (0..^𝑁)) = ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
74	65, 73	eqtrd 2856	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
75	52	adantr 483	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝐵 ∩ (0..^𝑁)) ⊆ ℕ₀)
76	60, 75, 53, 63	smupp1 15829	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑄‘(𝑖 + 1)) = ((𝑄‘𝑖) sadd {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}))
77	76	ineq1d 4188	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)) = (((𝑄‘𝑖) sadd {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}) ∩ (0..^𝑁)))
78	1, 52, 53	smupf 15827	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑄:ℕ₀⟶𝒫 ℕ₀)
79		ffvelrn 6849	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑄:ℕ₀⟶𝒫 ℕ₀ ∧ 𝑖 ∈ ℕ₀) → (𝑄‘𝑖) ∈ 𝒫 ℕ₀)
80	78, 62, 79	syl2an 597	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑄‘𝑖) ∈ 𝒫 ℕ₀)
81	80	elpwid 4550	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (𝑄‘𝑖) ⊆ ℕ₀)
82		ssrab2 4056	. . . . . . . . . . . . . . . . . 18 ⊢ {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ⊆ ℕ₀
83	82	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ⊆ ℕ₀)
84	81, 83, 72	sadeq 15821	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑄‘𝑖) sadd {𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
85		elinel2 4173	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 ∈ (ℕ₀ ∩ (0..^𝑁)) → 𝑛 ∈ (0..^𝑁))
86	61	adantr 483	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝐵 ⊆ ℕ₀)
87	86	sseld 3966	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ 𝐵 → (𝑛 − 𝑖) ∈ ℕ₀))
88		elfzo0 13079	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑛 ∈ (0..^𝑁) ↔ (𝑛 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ 𝑛 < 𝑁))
89	88	simp2bi 1142	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑛 ∈ (0..^𝑁) → 𝑁 ∈ ℕ)
90	89	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑁 ∈ ℕ)
91		elfzonn0 13083	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑛 ∈ (0..^𝑁) → 𝑛 ∈ ℕ₀)
92	91	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑛 ∈ ℕ₀)
93	92	nn0red 11957	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑛 ∈ ℝ)
94	63	adantr 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑖 ∈ ℕ₀)
95	94	nn0red 11957	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑖 ∈ ℝ)
96	93, 95	resubcld 11068	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑛 − 𝑖) ∈ ℝ)
97	90	nnred 11653	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑁 ∈ ℝ)
98	94	nn0ge0d 11959	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 0 ≤ 𝑖)
99	93, 95	subge02d 11232	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (0 ≤ 𝑖 ↔ (𝑛 − 𝑖) ≤ 𝑛))
100	98, 99	mpbid 234	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑛 − 𝑖) ≤ 𝑛)
101		elfzolt2 13048	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑛 ∈ (0..^𝑁) → 𝑛 < 𝑁)
102	101	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → 𝑛 < 𝑁)
103	96, 93, 97, 100, 102	lelttrd 10798	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑛 − 𝑖) < 𝑁)
104	90, 103	jca 514	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁))
105		elfzo0 13079	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑛 − 𝑖) ∈ (0..^𝑁) ↔ ((𝑛 − 𝑖) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁))
106		3anass 1091	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝑛 − 𝑖) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁) ↔ ((𝑛 − 𝑖) ∈ ℕ₀ ∧ (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁)))
107	105, 106	bitri 277	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑛 − 𝑖) ∈ (0..^𝑁) ↔ ((𝑛 − 𝑖) ∈ ℕ₀ ∧ (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁)))
108	107	baib 538	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑛 − 𝑖) ∈ ℕ₀ → ((𝑛 − 𝑖) ∈ (0..^𝑁) ↔ (𝑁 ∈ ℕ ∧ (𝑛 − 𝑖) < 𝑁)))
109	104, 108	syl5ibrcom 249	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ ℕ₀ → (𝑛 − 𝑖) ∈ (0..^𝑁)))
110	87, 109	syld 47	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ 𝐵 → (𝑛 − 𝑖) ∈ (0..^𝑁)))
111	110	pm4.71rd 565	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ 𝐵 ↔ ((𝑛 − 𝑖) ∈ (0..^𝑁) ∧ (𝑛 − 𝑖) ∈ 𝐵)))
112		ancom 463	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 − 𝑖) ∈ (0..^𝑁) ∧ (𝑛 − 𝑖) ∈ 𝐵) ↔ ((𝑛 − 𝑖) ∈ 𝐵 ∧ (𝑛 − 𝑖) ∈ (0..^𝑁)))
113		elin 4169	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)) ↔ ((𝑛 − 𝑖) ∈ 𝐵 ∧ (𝑛 − 𝑖) ∈ (0..^𝑁)))
114	112, 113	bitr4i 280	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 − 𝑖) ∈ (0..^𝑁) ∧ (𝑛 − 𝑖) ∈ 𝐵) ↔ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))
115	111, 114	syl6rbb 290	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)) ↔ (𝑛 − 𝑖) ∈ 𝐵))
116	115	anbi2d 630	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (0..^𝑁)) → ((𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁))) ↔ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)))
117	85, 116	sylan2 594	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) ∧ 𝑛 ∈ (ℕ₀ ∩ (0..^𝑁))) → ((𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁))) ↔ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)))
118	117	rabbidva 3478	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → {𝑛 ∈ (ℕ₀ ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} = {𝑛 ∈ (ℕ₀ ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)})
119		inrab2 4276	. . . . . . . . . . . . . . . . . . 19 ⊢ ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁)) = {𝑛 ∈ (ℕ₀ ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))}
120		inrab2 4276	. . . . . . . . . . . . . . . . . . 19 ⊢ ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁)) = {𝑛 ∈ (ℕ₀ ∩ (0..^𝑁)) ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)}
121	118, 119, 120	3eqtr4g 2881	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁)) = ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁)))
122	121	oveq2d 7172	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁))) = (((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))))
123	122	ineq1d 4188	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ (𝐵 ∩ (0..^𝑁)))} ∩ (0..^𝑁))) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
124	77, 84, 123	3eqtrd 2860	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)))
125	74, 124	eqeq12d 2837	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)) ↔ ((((𝑃‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁)) = ((((𝑄‘𝑖) ∩ (0..^𝑁)) sadd ({𝑛 ∈ ℕ₀ ∣ (𝑖 ∈ 𝐴 ∧ (𝑛 − 𝑖) ∈ 𝐵)} ∩ (0..^𝑁))) ∩ (0..^𝑁))))
126	59, 125	syl5ibr 248	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁))))
127	126	expcom 416	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ (0..^𝑁) → (𝜑 → (((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁)) → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))))
128	127	a2d 29	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (0..^𝑁) → ((𝜑 → ((𝑃‘𝑖) ∩ (0..^𝑁)) = ((𝑄‘𝑖) ∩ (0..^𝑁))) → (𝜑 → ((𝑃‘(𝑖 + 1)) ∩ (0..^𝑁)) = ((𝑄‘(𝑖 + 1)) ∩ (0..^𝑁)))))
129	31, 37, 43, 49, 57, 128	fzind2 13156	. . . . . . . . . 10 ⊢ (𝑁 ∈ (0...𝑁) → (𝜑 → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁))))
130	25, 129	mpcom 38	. . . . . . . . 9 ⊢ (𝜑 → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))
131	130	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ((𝑃‘𝑁) ∩ (0..^𝑁)) = ((𝑄‘𝑁) ∩ (0..^𝑁)))
132	131	eleq2d 2898	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁))))
133		elin 4169	. . . . . . . . 9 ⊢ (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ (𝑘 ∈ (𝑃‘𝑁) ∧ 𝑘 ∈ (0..^𝑁)))
134	133	rbaib 541	. . . . . . . 8 ⊢ (𝑘 ∈ (0..^𝑁) → (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑃‘𝑁)))
135	134	adantl 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ ((𝑃‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑃‘𝑁)))
136		elin 4169	. . . . . . . . 9 ⊢ (𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁)) ↔ (𝑘 ∈ (𝑄‘𝑁) ∧ 𝑘 ∈ (0..^𝑁)))
137	136	rbaib 541	. . . . . . . 8 ⊢ (𝑘 ∈ (0..^𝑁) → (𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑄‘𝑁)))
138	137	adantl 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ ((𝑄‘𝑁) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (𝑄‘𝑁)))
139	132, 135, 138	3bitr3d 311	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝑃‘𝑁) ↔ 𝑘 ∈ (𝑄‘𝑁)))
140	52	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝐵 ∩ (0..^𝑁)) ⊆ ℕ₀)
141	2, 140, 53, 13	smupval 15837	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑄‘𝑁) = ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))))
142	141	eleq2d 2898	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝑄‘𝑁) ↔ 𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁)))))
143	22, 139, 142	3bitrd 307	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 ∈ (𝐴 smul 𝐵) ↔ 𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁)))))
144	143	ex 415	. . . 4 ⊢ (𝜑 → (𝑘 ∈ (0..^𝑁) → (𝑘 ∈ (𝐴 smul 𝐵) ↔ 𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))))))
145	144	pm5.32rd 580	. . 3 ⊢ (𝜑 → ((𝑘 ∈ (𝐴 smul 𝐵) ∧ 𝑘 ∈ (0..^𝑁)) ↔ (𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∧ 𝑘 ∈ (0..^𝑁))))
146		elin 4169	. . 3 ⊢ (𝑘 ∈ ((𝐴 smul 𝐵) ∩ (0..^𝑁)) ↔ (𝑘 ∈ (𝐴 smul 𝐵) ∧ 𝑘 ∈ (0..^𝑁)))
147		elin 4169	. . 3 ⊢ (𝑘 ∈ (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁)) ↔ (𝑘 ∈ ((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∧ 𝑘 ∈ (0..^𝑁)))
148	145, 146, 147	3bitr4g 316	. 2 ⊢ (𝜑 → (𝑘 ∈ ((𝐴 smul 𝐵) ∩ (0..^𝑁)) ↔ 𝑘 ∈ (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁))))
149	148	eqrdv 2819	1 ⊢ (𝜑 → ((𝐴 smul 𝐵) ∩ (0..^𝑁)) = (((𝐴 ∩ (0..^𝑁)) smul (𝐵 ∩ (0..^𝑁))) ∩ (0..^𝑁)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 {crab 3142 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 ifcif 4467 𝒫 cpw 4539 class class class wbr 5066 ↦ cmpt 5146 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 ∈ cmpo 7158 0cc0 10537 1c1 10538 + caddc 10540 < clt 10675 ≤ cle 10676 − cmin 10870 ℕcn 11638 ℕ₀cn0 11898 ℤcz 11982 ℤ_≥cuz 12244 ...cfz 12893 ..^cfzo 13034 seqcseq 13370 sadd csad 15769 smul csmu 15770

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-inf2 9104 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-xor 1502 df-tru 1540 df-fal 1550 df-had 1594 df-cad 1608 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-disj 5032 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-se 5515 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-isom 6364 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-2o 8103 df-oadd 8106 df-er 8289 df-map 8408 df-pm 8409 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-sup 8906 df-inf 8907 df-oi 8974 df-dju 9330 df-card 9368 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-n0 11899 df-xnn0 11969 df-z 11983 df-uz 12245 df-rp 12391 df-fz 12894 df-fzo 13035 df-fl 13163 df-mod 13239 df-seq 13371 df-exp 13431 df-hash 13692 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 df-clim 14845 df-sum 15043 df-dvds 15608 df-bits 15771 df-sad 15800 df-smu 15825

This theorem is referenced by: smueq 15840

W3C validator