fprodssdc - Intuitionistic Logic Explorer

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

Theorem fprodssdc 11611

Description: Change the index set to a subset in a finite sum. (Contributed by Scott Fenton, 16-Dec-2017.)

**Hypotheses**
Ref	Expression
fprodss.1	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
fprodss.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
fprodssdc.a	⊢ (𝜑 → ∀𝑗 ∈ 𝐵 DECID 𝑗 ∈ 𝐴)
fprodss.3	⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 1)
fprodss.4	⊢ (𝜑 → 𝐵 ∈ Fin)

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

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

Proof of Theorem fprodssdc Dummy variables 𝑓 𝑝 𝑚 𝑛 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fprodss.1	. . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
2		sseq2 3191	. . . . 5 ⊢ (𝐵 = ∅ → (𝐴 ⊆ 𝐵 ↔ 𝐴 ⊆ ∅))
3		ss0 3475	. . . . 5 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅)
4	2, 3	biimtrdi 163	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 ⊆ 𝐵 → 𝐴 = ∅))
5		prodeq1 11574	. . . . . 6 ⊢ (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
6		prodeq1 11574	. . . . . . 7 ⊢ (𝐵 = ∅ → ∏𝑘 ∈ 𝐵 𝐶 = ∏𝑘 ∈ ∅ 𝐶)
7	6	eqcomd 2193	. . . . . 6 ⊢ (𝐵 = ∅ → ∏𝑘 ∈ ∅ 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)
8	5, 7	sylan9eq 2240	. . . . 5 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)
9	8	expcom 116	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 = ∅ → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
10	4, 9	syld 45	. . 3 ⊢ (𝐵 = ∅ → (𝐴 ⊆ 𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
11	1, 10	syl5com 29	. 2 ⊢ (𝜑 → (𝐵 = ∅ → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
12		cnvimass 5003	. . . . . . . . 9 ⊢ (^◡𝑓 “ 𝐴) ⊆ dom 𝑓
13		simprr 531	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)
14		f1of 5473	. . . . . . . . . 10 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓:(1...(♯‘𝐵))⟶𝐵)
15	13, 14	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))⟶𝐵)
16	12, 15	fssdm 5392	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (^◡𝑓 “ 𝐴) ⊆ (1...(♯‘𝐵)))
17		f1ofn 5474	. . . . . . . . . . . 12 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓 Fn (1...(♯‘𝐵)))
18		elpreima 5648	. . . . . . . . . . . 12 ⊢ (𝑓 Fn (1...(♯‘𝐵)) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴)))
19	13, 17, 18	3syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴)))
20	15	ffvelcdmda 5664	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑛) ∈ 𝐵)
21	20	ex 115	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑛 ∈ (1...(♯‘𝐵)) → (𝑓‘𝑛) ∈ 𝐵))
22	21	adantrd 279	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ((𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴) → (𝑓‘𝑛) ∈ 𝐵))
23	19, 22	sylbid 150	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑛 ∈ (^◡𝑓 “ 𝐴) → (𝑓‘𝑛) ∈ 𝐵))
24	23	imp 124	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (^◡𝑓 “ 𝐴)) → (𝑓‘𝑛) ∈ 𝐵)
25		fprodss.2	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
26	25	ex 115	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
27	26	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
28		eldif 3150	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (𝐵 ∖ 𝐴) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ 𝐴))
29		fprodss.3	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 = 1)
30		ax-1cn 7917	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℂ
31	29, 30	eqeltrdi 2278	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ ℂ)
32	28, 31	sylan2br 288	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ 𝐴)) → 𝐶 ∈ ℂ)
33	32	expr 375	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (¬ 𝑘 ∈ 𝐴 → 𝐶 ∈ ℂ))
34		eleq1 2250	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴))
35	34	dcbid 839	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑘 → (DECID 𝑗 ∈ 𝐴 ↔ DECID 𝑘 ∈ 𝐴))
36		fprodssdc.a	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑗 ∈ 𝐵 DECID 𝑗 ∈ 𝐴)
37	36	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ∀𝑗 ∈ 𝐵 DECID 𝑗 ∈ 𝐴)
38		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝑘 ∈ 𝐵)
39	35, 37, 38	rspcdva 2858	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → DECID 𝑘 ∈ 𝐴)
40		exmiddc 837	. . . . . . . . . . . . . 14 ⊢ (DECID 𝑘 ∈ 𝐴 → (𝑘 ∈ 𝐴 ∨ ¬ 𝑘 ∈ 𝐴))
41	39, 40	syl 14	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → (𝑘 ∈ 𝐴 ∨ ¬ 𝑘 ∈ 𝐴))
42	27, 33, 41	mpjaod 719	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → 𝐶 ∈ ℂ)
43	42	adantlr 477	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑘 ∈ 𝐵) → 𝐶 ∈ ℂ)
44	43	fmpttd 5684	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑘 ∈ 𝐵 ↦ 𝐶):𝐵⟶ℂ)
45	44	ffvelcdmda 5664	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐵) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) ∈ ℂ)
46	24, 45	syldan 282	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (^◡𝑓 “ 𝐴)) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) ∈ ℂ)
47		eqid 2187	. . . . . . . . 9 ⊢ (ℤ_≥‘1) = (ℤ_≥‘1)
48		simprl 529	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (♯‘𝐵) ∈ ℕ)
49		nnuz 9576	. . . . . . . . . 10 ⊢ ℕ = (ℤ_≥‘1)
50	48, 49	eleqtrdi 2280	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (♯‘𝐵) ∈ (ℤ_≥‘1))
51		ssidd 3188	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (1...(♯‘𝐵)) ⊆ (1...(♯‘𝐵)))
52	47, 50, 51	fprodntrivap 11605	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∃𝑚 ∈ (ℤ_≥‘1)∃𝑦(𝑦 # 0 ∧ seq𝑚( · , (𝑛 ∈ (ℤ_≥‘1) ↦ if(𝑛 ∈ (1...(♯‘𝐵)), ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)), 1))) ⇝ 𝑦))
53		eleq1 2250	. . . . . . . . . . . . 13 ⊢ (𝑗 = (𝑓‘𝑝) → (𝑗 ∈ 𝐴 ↔ (𝑓‘𝑝) ∈ 𝐴))
54	53	dcbid 839	. . . . . . . . . . . 12 ⊢ (𝑗 = (𝑓‘𝑝) → (DECID 𝑗 ∈ 𝐴 ↔ DECID (𝑓‘𝑝) ∈ 𝐴))
55	36	ad3antrrr 492	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → ∀𝑗 ∈ 𝐵 DECID 𝑗 ∈ 𝐴)
56	13	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)
57	56, 14	syl 14	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → 𝑓:(1...(♯‘𝐵))⟶𝐵)
58		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → 𝑝 ∈ (1...(♯‘𝐵)))
59	57, 58	ffvelcdmd 5665	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑝) ∈ 𝐵)
60	54, 55, 59	rspcdva 2858	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → DECID (𝑓‘𝑝) ∈ 𝐴)
61		f1ocnv 5486	. . . . . . . . . . . . . . 15 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → ^◡𝑓:𝐵–1-1-onto→(1...(♯‘𝐵)))
62		f1of1 5472	. . . . . . . . . . . . . . 15 ⊢ (^◡𝑓:𝐵–1-1-onto→(1...(♯‘𝐵)) → ^◡𝑓:𝐵–1-1→(1...(♯‘𝐵)))
63	56, 61, 62	3syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → ^◡𝑓:𝐵–1-1→(1...(♯‘𝐵)))
64	1	ad3antrrr 492	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → 𝐴 ⊆ 𝐵)
65		f1elima 5787	. . . . . . . . . . . . . 14 ⊢ ((^◡𝑓:𝐵–1-1→(1...(♯‘𝐵)) ∧ (𝑓‘𝑝) ∈ 𝐵 ∧ 𝐴 ⊆ 𝐵) → ((^◡𝑓‘(𝑓‘𝑝)) ∈ (^◡𝑓 “ 𝐴) ↔ (𝑓‘𝑝) ∈ 𝐴))
66	63, 59, 64, 65	syl3anc 1248	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → ((^◡𝑓‘(𝑓‘𝑝)) ∈ (^◡𝑓 “ 𝐴) ↔ (𝑓‘𝑝) ∈ 𝐴))
67		f1ocnvfv1 5791	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 ∧ 𝑝 ∈ (1...(♯‘𝐵))) → (^◡𝑓‘(𝑓‘𝑝)) = 𝑝)
68	56, 58, 67	syl2anc 411	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → (^◡𝑓‘(𝑓‘𝑝)) = 𝑝)
69	68	eleq1d 2256	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → ((^◡𝑓‘(𝑓‘𝑝)) ∈ (^◡𝑓 “ 𝐴) ↔ 𝑝 ∈ (^◡𝑓 “ 𝐴)))
70	66, 69	bitr3d 190	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → ((𝑓‘𝑝) ∈ 𝐴 ↔ 𝑝 ∈ (^◡𝑓 “ 𝐴)))
71	70	dcbid 839	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → (DECID (𝑓‘𝑝) ∈ 𝐴 ↔ DECID 𝑝 ∈ (^◡𝑓 “ 𝐴)))
72	60, 71	mpbid 147	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ 𝑝 ∈ (1...(♯‘𝐵))) → DECID 𝑝 ∈ (^◡𝑓 “ 𝐴))
73	16	ad2antrr 488	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ∈ (1...(♯‘𝐵))) → (^◡𝑓 “ 𝐴) ⊆ (1...(♯‘𝐵)))
74		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ∈ (1...(♯‘𝐵))) → ¬ 𝑝 ∈ (1...(♯‘𝐵)))
75	73, 74	ssneldd 3170	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ∈ (1...(♯‘𝐵))) → ¬ 𝑝 ∈ (^◡𝑓 “ 𝐴))
76	75	olcd 735	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ∈ (1...(♯‘𝐵))) → (𝑝 ∈ (^◡𝑓 “ 𝐴) ∨ ¬ 𝑝 ∈ (^◡𝑓 “ 𝐴)))
77		df-dc 836	. . . . . . . . . . 11 ⊢ (DECID 𝑝 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑝 ∈ (^◡𝑓 “ 𝐴) ∨ ¬ 𝑝 ∈ (^◡𝑓 “ 𝐴)))
78	76, 77	sylibr 134	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑝 ∈ (1...(♯‘𝐵))) → DECID 𝑝 ∈ (^◡𝑓 “ 𝐴))
79		eluzelz 9550	. . . . . . . . . . . . 13 ⊢ (𝑝 ∈ (ℤ_≥‘1) → 𝑝 ∈ ℤ)
80	79	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → 𝑝 ∈ ℤ)
81		1zzd 9293	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → 1 ∈ ℤ)
82	48	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → (♯‘𝐵) ∈ ℕ)
83	82	nnzd 9387	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → (♯‘𝐵) ∈ ℤ)
84		fzdcel 10053	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℤ ∧ 1 ∈ ℤ ∧ (♯‘𝐵) ∈ ℤ) → DECID 𝑝 ∈ (1...(♯‘𝐵)))
85	80, 81, 83, 84	syl3anc 1248	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → DECID 𝑝 ∈ (1...(♯‘𝐵)))
86		exmiddc 837	. . . . . . . . . . 11 ⊢ (DECID 𝑝 ∈ (1...(♯‘𝐵)) → (𝑝 ∈ (1...(♯‘𝐵)) ∨ ¬ 𝑝 ∈ (1...(♯‘𝐵))))
87	85, 86	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → (𝑝 ∈ (1...(♯‘𝐵)) ∨ ¬ 𝑝 ∈ (1...(♯‘𝐵))))
88	72, 78, 87	mpjaodan 799	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑝 ∈ (ℤ_≥‘1)) → DECID 𝑝 ∈ (^◡𝑓 “ 𝐴))
89	88	ralrimiva 2560	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∀𝑝 ∈ (ℤ_≥‘1)DECID 𝑝 ∈ (^◡𝑓 “ 𝐴))
90		1zzd 9293	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 1 ∈ ℤ)
91		eldifi 3269	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴)) → 𝑛 ∈ (1...(♯‘𝐵)))
92	91, 20	sylan2 286	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑓‘𝑛) ∈ 𝐵)
93		eldifn 3270	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴)) → ¬ 𝑛 ∈ (^◡𝑓 “ 𝐴))
94	93	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ¬ 𝑛 ∈ (^◡𝑓 “ 𝐴))
95	91	adantl 277	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → 𝑛 ∈ (1...(♯‘𝐵)))
96	19	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑛 ∈ (1...(♯‘𝐵)) ∧ (𝑓‘𝑛) ∈ 𝐴)))
97	95, 96	mpbirand 441	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑛 ∈ (^◡𝑓 “ 𝐴) ↔ (𝑓‘𝑛) ∈ 𝐴))
98	94, 97	mtbid 673	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ¬ (𝑓‘𝑛) ∈ 𝐴)
99	92, 98	eldifd 3151	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑓‘𝑛) ∈ (𝐵 ∖ 𝐴))
100		difss 3273	. . . . . . . . . . . . 13 ⊢ (𝐵 ∖ 𝐴) ⊆ 𝐵
101		resmpt 4967	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∖ 𝐴) ⊆ 𝐵 → ((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴)) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶))
102	100, 101	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴)) = (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)
103	102	fveq1i 5528	. . . . . . . . . . 11 ⊢ (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴))‘(𝑓‘𝑛)) = ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛))
104		fvres 5551	. . . . . . . . . . 11 ⊢ ((𝑓‘𝑛) ∈ (𝐵 ∖ 𝐴) → (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ (𝐵 ∖ 𝐴))‘(𝑓‘𝑛)) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
105	103, 104	eqtr3id 2234	. . . . . . . . . 10 ⊢ ((𝑓‘𝑛) ∈ (𝐵 ∖ 𝐴) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
106	99, 105	syl 14	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
107		1ex 7965	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ V
108	107	elsn2 3638	. . . . . . . . . . . . . 14 ⊢ (𝐶 ∈ {1} ↔ 𝐶 = 1)
109	29, 108	sylibr 134	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ 𝐴)) → 𝐶 ∈ {1})
110	109	fmpttd 5684	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶):(𝐵 ∖ 𝐴)⟶{1})
111	110	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → (𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶):(𝐵 ∖ 𝐴)⟶{1})
112	111, 99	ffvelcdmd 5665	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) ∈ {1})
113		elsni 3622	. . . . . . . . . 10 ⊢ (((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) ∈ {1} → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = 1)
114	112, 113	syl 14	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ (𝐵 ∖ 𝐴) ↦ 𝐶)‘(𝑓‘𝑛)) = 1)
115	106, 114	eqtr3d 2222	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ ((1...(♯‘𝐵)) ∖ (^◡𝑓 “ 𝐴))) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) = 1)
116		fzssuz 10078	. . . . . . . . 9 ⊢ (1...(♯‘𝐵)) ⊆ (ℤ_≥‘1)
117	116	a1i 9	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (1...(♯‘𝐵)) ⊆ (ℤ_≥‘1))
118	85	ralrimiva 2560	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∀𝑝 ∈ (ℤ_≥‘1)DECID 𝑝 ∈ (1...(♯‘𝐵)))
119	16, 46, 52, 89, 90, 115, 117, 118	prodssdc 11610	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑛 ∈ (^◡𝑓 “ 𝐴)((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)) = ∏𝑛 ∈ (1...(♯‘𝐵))((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
120	1	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝐴 ⊆ 𝐵)
121	120	resmptd 4970	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) = (𝑘 ∈ 𝐴 ↦ 𝐶))
122	121	fveq1d 5529	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚))
123		fvres 5551	. . . . . . . . . 10 ⊢ (𝑚 ∈ 𝐴 → (((𝑘 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴)‘𝑚) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
124	122, 123	sylan9req 2241	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
125	124	prodeq2dv 11587	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
126		fveq2 5527	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
127		fprodss.4	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ Fin)
128	127	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝐵 ∈ Fin)
129	36	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∀𝑗 ∈ 𝐵 DECID 𝑗 ∈ 𝐴)
130		ssfidc 6947	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ Fin ∧ 𝐴 ⊆ 𝐵 ∧ ∀𝑗 ∈ 𝐵 DECID 𝑗 ∈ 𝐴) → 𝐴 ∈ Fin)
131	128, 120, 129, 130	syl3anc 1248	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝐴 ∈ Fin)
132	120, 13, 131	preimaf1ofi 6963	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (^◡𝑓 “ 𝐴) ∈ Fin)
133		f1of1 5472	. . . . . . . . . . . 12 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓:(1...(♯‘𝐵))–1-1→𝐵)
134	13, 133	syl 14	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))–1-1→𝐵)
135		f1ores 5488	. . . . . . . . . . 11 ⊢ ((𝑓:(1...(♯‘𝐵))–1-1→𝐵 ∧ (^◡𝑓 “ 𝐴) ⊆ (1...(♯‘𝐵))) → (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→(𝑓 “ (^◡𝑓 “ 𝐴)))
136	134, 16, 135	syl2anc 411	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→(𝑓 “ (^◡𝑓 “ 𝐴)))
137		f1ofo 5480	. . . . . . . . . . . . 13 ⊢ (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → 𝑓:(1...(♯‘𝐵))–onto→𝐵)
138	13, 137	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → 𝑓:(1...(♯‘𝐵))–onto→𝐵)
139		foimacnv 5491	. . . . . . . . . . . 12 ⊢ ((𝑓:(1...(♯‘𝐵))–onto→𝐵 ∧ 𝐴 ⊆ 𝐵) → (𝑓 “ (^◡𝑓 “ 𝐴)) = 𝐴)
140	138, 120, 139	syl2anc 411	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑓 “ (^◡𝑓 “ 𝐴)) = 𝐴)
141	140	f1oeq3d 5470	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ((𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→(𝑓 “ (^◡𝑓 “ 𝐴)) ↔ (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→𝐴))
142	136, 141	mpbid 147	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (𝑓 ↾ (^◡𝑓 “ 𝐴)):(^◡𝑓 “ 𝐴)–1-1-onto→𝐴)
143		fvres 5551	. . . . . . . . . 10 ⊢ (𝑛 ∈ (^◡𝑓 “ 𝐴) → ((𝑓 ↾ (^◡𝑓 “ 𝐴))‘𝑛) = (𝑓‘𝑛))
144	143	adantl 277	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (^◡𝑓 “ 𝐴)) → ((𝑓 ↾ (^◡𝑓 “ 𝐴))‘𝑛) = (𝑓‘𝑛))
145	120	sselda 3167	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ 𝐵)
146	44	ffvelcdmda 5664	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐵) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) ∈ ℂ)
147	145, 146	syldan 282	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) ∈ ℂ)
148	126, 132, 142, 144, 147	fprodf1o 11609	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑛 ∈ (^◡𝑓 “ 𝐴)((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
149	125, 148	eqtrd 2220	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑛 ∈ (^◡𝑓 “ 𝐴)((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
150	48	nnzd 9387	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (♯‘𝐵) ∈ ℤ)
151	90, 150	fzfigd 10444	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → (1...(♯‘𝐵)) ∈ Fin)
152		eqidd 2188	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) ∧ 𝑛 ∈ (1...(♯‘𝐵))) → (𝑓‘𝑛) = (𝑓‘𝑛))
153	126, 151, 13, 152, 146	fprodf1o 11609	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑛 ∈ (1...(♯‘𝐵))((𝑘 ∈ 𝐵 ↦ 𝐶)‘(𝑓‘𝑛)))
154	119, 149, 153	3eqtr4d 2230	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚))
155	25	ralrimiva 2560	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ)
156	155	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ)
157		prodfct 11608	. . . . . . 7 ⊢ (∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐶)
158	156, 157	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐴 𝐶)
159	43	ralrimiva 2560	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∀𝑘 ∈ 𝐵 𝐶 ∈ ℂ)
160		prodfct 11608	. . . . . . 7 ⊢ (∀𝑘 ∈ 𝐵 𝐶 ∈ ℂ → ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐵 𝐶)
161	159, 160	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑚 ∈ 𝐵 ((𝑘 ∈ 𝐵 ↦ 𝐶)‘𝑚) = ∏𝑘 ∈ 𝐵 𝐶)
162	154, 158, 161	3eqtr3d 2228	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐵) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)) → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)
163	162	expr 375	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐵) ∈ ℕ) → (𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
164	163	exlimdv 1829	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐵) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
165	164	expimpd 363	. 2 ⊢ (𝜑 → (((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵) → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶))
166		fz1f1o 11396	. . 3 ⊢ (𝐵 ∈ Fin → (𝐵 = ∅ ∨ ((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)))
167	127, 166	syl 14	. 2 ⊢ (𝜑 → (𝐵 = ∅ ∨ ((♯‘𝐵) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐵))–1-1-onto→𝐵)))
168	11, 165, 167	mpjaod 719	1 ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 = wceq 1363 ∃wex 1502 ∈ wcel 2158 ∀wral 2465 ∖ cdif 3138 ⊆ wss 3141 ∅c0 3434 {csn 3604 ↦ cmpt 4076 ^◡ccnv 4637 ↾ cres 4640 “ cima 4641 Fn wfn 5223 ⟶wf 5224 –1-1→wf1 5225 –onto→wfo 5226 –1-1-onto→wf1o 5227 ‘cfv 5228 (class class class)co 5888 Fincfn 6753 ℂcc 7822 1c1 7825 ℕcn 8932 ℤcz 9266 ℤ_≥cuz 9541 ...cfz 10021 ♯chash 10768 ∏cprod 11571

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 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-nul 4141 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-iinf 4599 ax-cnex 7915 ax-resscn 7916 ax-1cn 7917 ax-1re 7918 ax-icn 7919 ax-addcl 7920 ax-addrcl 7921 ax-mulcl 7922 ax-mulrcl 7923 ax-addcom 7924 ax-mulcom 7925 ax-addass 7926 ax-mulass 7927 ax-distr 7928 ax-i2m1 7929 ax-0lt1 7930 ax-1rid 7931 ax-0id 7932 ax-rnegex 7933 ax-precex 7934 ax-cnre 7935 ax-pre-ltirr 7936 ax-pre-ltwlin 7937 ax-pre-lttrn 7938 ax-pre-apti 7939 ax-pre-ltadd 7940 ax-pre-mulgt0 7941 ax-pre-mulext 7942 ax-arch 7943 ax-caucvg 7944

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rmo 2473 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-nul 3435 df-if 3547 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-tr 4114 df-id 4305 df-po 4308 df-iso 4309 df-iord 4378 df-on 4380 df-ilim 4381 df-suc 4383 df-iom 4602 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-isom 5237 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-1st 6154 df-2nd 6155 df-recs 6319 df-irdg 6384 df-frec 6405 df-1o 6430 df-oadd 6434 df-er 6548 df-en 6754 df-dom 6755 df-fin 6756 df-pnf 8007 df-mnf 8008 df-xr 8009 df-ltxr 8010 df-le 8011 df-sub 8143 df-neg 8144 df-reap 8545 df-ap 8552 df-div 8643 df-inn 8933 df-2 8991 df-3 8992 df-4 8993 df-n0 9190 df-z 9267 df-uz 9542 df-q 9633 df-rp 9667 df-fz 10022 df-fzo 10156 df-seqfrec 10459 df-exp 10533 df-ihash 10769 df-cj 10864 df-re 10865 df-im 10866 df-rsqrt 11020 df-abs 11021 df-clim 11300 df-proddc 11572

This theorem is referenced by: fprodsplitdc 11617

W3C validator