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

Theorem fprod 15824
Description: The value of a product over a nonempty finite set. (Contributed by Scott Fenton, 6-Dec-2017.)
Hypotheses
Ref Expression
fprod.1 (𝑘 = (𝐹𝑛) → 𝐵 = 𝐶)
fprod.2 (𝜑𝑀 ∈ ℕ)
fprod.3 (𝜑𝐹:(1...𝑀)–1-1-onto𝐴)
fprod.4 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
fprod.5 ((𝜑𝑛 ∈ (1...𝑀)) → (𝐺𝑛) = 𝐶)
Assertion
Ref Expression
fprod (𝜑 → ∏𝑘𝐴 𝐵 = (seq1( · , 𝐺)‘𝑀))
Distinct variable groups:   𝐴,𝑘,𝑛   𝐵,𝑛   𝐶,𝑘   𝑘,𝐹,𝑛   𝑘,𝐺,𝑛   𝜑,𝑘   𝑘,𝑀,𝑛   𝜑,𝑛
Allowed substitution hints:   𝐵(𝑘)   𝐶(𝑛)

Proof of Theorem fprod
Dummy variables 𝑓 𝑖 𝑗 𝑚 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-prod 15789 . 2 𝑘𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
2 fvex 6855 . . 3 (seq1( · , 𝐺)‘𝑀) ∈ V
3 nfcv 2907 . . . . . . . . 9 𝑗if(𝑘𝐴, 𝐵, 1)
4 nfv 1917 . . . . . . . . . 10 𝑘 𝑗𝐴
5 nfcsb1v 3880 . . . . . . . . . 10 𝑘𝑗 / 𝑘𝐵
6 nfcv 2907 . . . . . . . . . 10 𝑘1
74, 5, 6nfif 4516 . . . . . . . . 9 𝑘if(𝑗𝐴, 𝑗 / 𝑘𝐵, 1)
8 eleq1w 2820 . . . . . . . . . 10 (𝑘 = 𝑗 → (𝑘𝐴𝑗𝐴))
9 csbeq1a 3869 . . . . . . . . . 10 (𝑘 = 𝑗𝐵 = 𝑗 / 𝑘𝐵)
108, 9ifbieq1d 4510 . . . . . . . . 9 (𝑘 = 𝑗 → if(𝑘𝐴, 𝐵, 1) = if(𝑗𝐴, 𝑗 / 𝑘𝐵, 1))
113, 7, 10cbvmpt 5216 . . . . . . . 8 (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1)) = (𝑗 ∈ ℤ ↦ if(𝑗𝐴, 𝑗 / 𝑘𝐵, 1))
12 fprod.4 . . . . . . . . . 10 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
1312ralrimiva 3143 . . . . . . . . 9 (𝜑 → ∀𝑘𝐴 𝐵 ∈ ℂ)
145nfel1 2923 . . . . . . . . . 10 𝑘𝑗 / 𝑘𝐵 ∈ ℂ
159eleq1d 2822 . . . . . . . . . 10 (𝑘 = 𝑗 → (𝐵 ∈ ℂ ↔ 𝑗 / 𝑘𝐵 ∈ ℂ))
1614, 15rspc 3569 . . . . . . . . 9 (𝑗𝐴 → (∀𝑘𝐴 𝐵 ∈ ℂ → 𝑗 / 𝑘𝐵 ∈ ℂ))
1713, 16mpan9 507 . . . . . . . 8 ((𝜑𝑗𝐴) → 𝑗 / 𝑘𝐵 ∈ ℂ)
18 fveq2 6842 . . . . . . . . . . 11 (𝑛 = 𝑖 → (𝑓𝑛) = (𝑓𝑖))
1918csbeq1d 3859 . . . . . . . . . 10 (𝑛 = 𝑖(𝑓𝑛) / 𝑘𝐵 = (𝑓𝑖) / 𝑘𝐵)
20 csbcow 3870 . . . . . . . . . 10 (𝑓𝑖) / 𝑗𝑗 / 𝑘𝐵 = (𝑓𝑖) / 𝑘𝐵
2119, 20eqtr4di 2794 . . . . . . . . 9 (𝑛 = 𝑖(𝑓𝑛) / 𝑘𝐵 = (𝑓𝑖) / 𝑗𝑗 / 𝑘𝐵)
2221cbvmptv 5218 . . . . . . . 8 (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵) = (𝑖 ∈ ℕ ↦ (𝑓𝑖) / 𝑗𝑗 / 𝑘𝐵)
2311, 17, 22prodmo 15819 . . . . . . 7 (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
24 fprod.2 . . . . . . . . 9 (𝜑𝑀 ∈ ℕ)
25 fprod.3 . . . . . . . . . . . 12 (𝜑𝐹:(1...𝑀)–1-1-onto𝐴)
26 f1of 6784 . . . . . . . . . . . 12 (𝐹:(1...𝑀)–1-1-onto𝐴𝐹:(1...𝑀)⟶𝐴)
2725, 26syl 17 . . . . . . . . . . 11 (𝜑𝐹:(1...𝑀)⟶𝐴)
28 ovex 7390 . . . . . . . . . . 11 (1...𝑀) ∈ V
29 fex 7176 . . . . . . . . . . 11 ((𝐹:(1...𝑀)⟶𝐴 ∧ (1...𝑀) ∈ V) → 𝐹 ∈ V)
3027, 28, 29sylancl 586 . . . . . . . . . 10 (𝜑𝐹 ∈ V)
31 nnuz 12806 . . . . . . . . . . . . 13 ℕ = (ℤ‘1)
3224, 31eleqtrdi 2848 . . . . . . . . . . . 12 (𝜑𝑀 ∈ (ℤ‘1))
33 fprod.5 . . . . . . . . . . . . . . 15 ((𝜑𝑛 ∈ (1...𝑀)) → (𝐺𝑛) = 𝐶)
34 elfznn 13470 . . . . . . . . . . . . . . . 16 (𝑛 ∈ (1...𝑀) → 𝑛 ∈ ℕ)
35 fvex 6855 . . . . . . . . . . . . . . . . 17 (𝐺𝑛) ∈ V
3633, 35eqeltrrdi 2847 . . . . . . . . . . . . . . . 16 ((𝜑𝑛 ∈ (1...𝑀)) → 𝐶 ∈ V)
37 eqid 2736 . . . . . . . . . . . . . . . . 17 (𝑛 ∈ ℕ ↦ 𝐶) = (𝑛 ∈ ℕ ↦ 𝐶)
3837fvmpt2 6959 . . . . . . . . . . . . . . . 16 ((𝑛 ∈ ℕ ∧ 𝐶 ∈ V) → ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑛) = 𝐶)
3934, 36, 38syl2an2 684 . . . . . . . . . . . . . . 15 ((𝜑𝑛 ∈ (1...𝑀)) → ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑛) = 𝐶)
4033, 39eqtr4d 2779 . . . . . . . . . . . . . 14 ((𝜑𝑛 ∈ (1...𝑀)) → (𝐺𝑛) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑛))
4140ralrimiva 3143 . . . . . . . . . . . . 13 (𝜑 → ∀𝑛 ∈ (1...𝑀)(𝐺𝑛) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑛))
42 nffvmpt1 6853 . . . . . . . . . . . . . . 15 𝑛((𝑛 ∈ ℕ ↦ 𝐶)‘𝑘)
4342nfeq2 2924 . . . . . . . . . . . . . 14 𝑛(𝐺𝑘) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑘)
44 fveq2 6842 . . . . . . . . . . . . . . 15 (𝑛 = 𝑘 → (𝐺𝑛) = (𝐺𝑘))
45 fveq2 6842 . . . . . . . . . . . . . . 15 (𝑛 = 𝑘 → ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑛) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑘))
4644, 45eqeq12d 2752 . . . . . . . . . . . . . 14 (𝑛 = 𝑘 → ((𝐺𝑛) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑛) ↔ (𝐺𝑘) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑘)))
4743, 46rspc 3569 . . . . . . . . . . . . 13 (𝑘 ∈ (1...𝑀) → (∀𝑛 ∈ (1...𝑀)(𝐺𝑛) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑛) → (𝐺𝑘) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑘)))
4841, 47mpan9 507 . . . . . . . . . . . 12 ((𝜑𝑘 ∈ (1...𝑀)) → (𝐺𝑘) = ((𝑛 ∈ ℕ ↦ 𝐶)‘𝑘))
4932, 48seqfveq 13932 . . . . . . . . . . 11 (𝜑 → (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ 𝐶))‘𝑀))
5025, 49jca 512 . . . . . . . . . 10 (𝜑 → (𝐹:(1...𝑀)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ 𝐶))‘𝑀)))
51 f1oeq1 6772 . . . . . . . . . . 11 (𝑓 = 𝐹 → (𝑓:(1...𝑀)–1-1-onto𝐴𝐹:(1...𝑀)–1-1-onto𝐴))
52 fveq1 6841 . . . . . . . . . . . . . . . . 17 (𝑓 = 𝐹 → (𝑓𝑛) = (𝐹𝑛))
5352csbeq1d 3859 . . . . . . . . . . . . . . . 16 (𝑓 = 𝐹(𝑓𝑛) / 𝑘𝐵 = (𝐹𝑛) / 𝑘𝐵)
54 fvex 6855 . . . . . . . . . . . . . . . . 17 (𝐹𝑛) ∈ V
55 fprod.1 . . . . . . . . . . . . . . . . 17 (𝑘 = (𝐹𝑛) → 𝐵 = 𝐶)
5654, 55csbie 3891 . . . . . . . . . . . . . . . 16 (𝐹𝑛) / 𝑘𝐵 = 𝐶
5753, 56eqtrdi 2792 . . . . . . . . . . . . . . 15 (𝑓 = 𝐹(𝑓𝑛) / 𝑘𝐵 = 𝐶)
5857mpteq2dv 5207 . . . . . . . . . . . . . 14 (𝑓 = 𝐹 → (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵) = (𝑛 ∈ ℕ ↦ 𝐶))
5958seqeq3d 13914 . . . . . . . . . . . . 13 (𝑓 = 𝐹 → seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵)) = seq1( · , (𝑛 ∈ ℕ ↦ 𝐶)))
6059fveq1d 6844 . . . . . . . . . . . 12 (𝑓 = 𝐹 → (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ 𝐶))‘𝑀))
6160eqeq2d 2747 . . . . . . . . . . 11 (𝑓 = 𝐹 → ((seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀) ↔ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ 𝐶))‘𝑀)))
6251, 61anbi12d 631 . . . . . . . . . 10 (𝑓 = 𝐹 → ((𝑓:(1...𝑀)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀)) ↔ (𝐹:(1...𝑀)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ 𝐶))‘𝑀))))
6330, 50, 62spcedv 3557 . . . . . . . . 9 (𝜑 → ∃𝑓(𝑓:(1...𝑀)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀)))
64 oveq2 7365 . . . . . . . . . . . . 13 (𝑚 = 𝑀 → (1...𝑚) = (1...𝑀))
6564f1oeq2d 6780 . . . . . . . . . . . 12 (𝑚 = 𝑀 → (𝑓:(1...𝑚)–1-1-onto𝐴𝑓:(1...𝑀)–1-1-onto𝐴))
66 fveq2 6842 . . . . . . . . . . . . 13 (𝑚 = 𝑀 → (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀))
6766eqeq2d 2747 . . . . . . . . . . . 12 (𝑚 = 𝑀 → ((seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚) ↔ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀)))
6865, 67anbi12d 631 . . . . . . . . . . 11 (𝑚 = 𝑀 → ((𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) ↔ (𝑓:(1...𝑀)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀))))
6968exbidv 1924 . . . . . . . . . 10 (𝑚 = 𝑀 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑀)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀))))
7069rspcev 3581 . . . . . . . . 9 ((𝑀 ∈ ℕ ∧ ∃𝑓(𝑓:(1...𝑀)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑀))) → ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
7124, 63, 70syl2anc 584 . . . . . . . 8 (𝜑 → ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
7271olcd 872 . . . . . . 7 (𝜑 → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
73 breq2 5109 . . . . . . . . . . . . . 14 (𝑥 = (seq1( · , 𝐺)‘𝑀) → (seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥 ↔ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀)))
74733anbi3d 1442 . . . . . . . . . . . . 13 (𝑥 = (seq1( · , 𝐺)‘𝑀) → ((𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ↔ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀))))
7574rexbidv 3175 . . . . . . . . . . . 12 (𝑥 = (seq1( · , 𝐺)‘𝑀) → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ↔ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀))))
76 eqeq1 2740 . . . . . . . . . . . . . . 15 (𝑥 = (seq1( · , 𝐺)‘𝑀) → (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚) ↔ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
7776anbi2d 629 . . . . . . . . . . . . . 14 (𝑥 = (seq1( · , 𝐺)‘𝑀) → ((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
7877exbidv 1924 . . . . . . . . . . . . 13 (𝑥 = (seq1( · , 𝐺)‘𝑀) → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
7978rexbidv 3175 . . . . . . . . . . . 12 (𝑥 = (seq1( · , 𝐺)‘𝑀) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
8075, 79orbi12d 917 . . . . . . . . . . 11 (𝑥 = (seq1( · , 𝐺)‘𝑀) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))))
8180moi2 3674 . . . . . . . . . 10 ((((seq1( · , 𝐺)‘𝑀) ∈ V ∧ ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))) ∧ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))) → 𝑥 = (seq1( · , 𝐺)‘𝑀))
822, 81mpanl1 698 . . . . . . . . 9 ((∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ∧ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))) → 𝑥 = (seq1( · , 𝐺)‘𝑀))
8382ancom2s 648 . . . . . . . 8 ((∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ∧ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))) → 𝑥 = (seq1( · , 𝐺)‘𝑀))
8483expr 457 . . . . . . 7 ((∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , 𝐺)‘𝑀)) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴 ∧ (seq1( · , 𝐺)‘𝑀) = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) → 𝑥 = (seq1( · , 𝐺)‘𝑀)))
8523, 72, 84syl2anc 584 . . . . . 6 (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) → 𝑥 = (seq1( · , 𝐺)‘𝑀)))
8672, 80syl5ibrcom 246 . . . . . 6 (𝜑 → (𝑥 = (seq1( · , 𝐺)‘𝑀) → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))))
8785, 86impbid 211 . . . . 5 (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ↔ 𝑥 = (seq1( · , 𝐺)‘𝑀)))
8887adantr 481 . . . 4 ((𝜑 ∧ (seq1( · , 𝐺)‘𝑀) ∈ V) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ↔ 𝑥 = (seq1( · , 𝐺)‘𝑀)))
8988iota5 6479 . . 3 ((𝜑 ∧ (seq1( · , 𝐺)‘𝑀) ∈ V) → (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))) = (seq1( · , 𝐺)‘𝑀))
902, 89mpan2 689 . 2 (𝜑 → (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))) = (seq1( · , 𝐺)‘𝑀))
911, 90eqtrid 2788 1 (𝜑 → ∏𝑘𝐴 𝐵 = (seq1( · , 𝐺)‘𝑀))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wo 845  w3a 1087   = wceq 1541  wex 1781  wcel 2106  ∃*wmo 2536  wne 2943  wral 3064  wrex 3073  Vcvv 3445  csb 3855  wss 3910  ifcif 4486   class class class wbr 5105  cmpt 5188  cio 6446  wf 6492  1-1-ontowf1o 6495  cfv 6496  (class class class)co 7357  cc 11049  0cc0 11051  1c1 11052   · cmul 11056  cn 12153  cz 12499  cuz 12763  ...cfz 13424  seqcseq 13906  cli 15366  cprod 15788
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-inf2 9577  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128  ax-pre-sup 11129
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-se 5589  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-sup 9378  df-oi 9446  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-div 11813  df-nn 12154  df-2 12216  df-3 12217  df-n0 12414  df-z 12500  df-uz 12764  df-rp 12916  df-fz 13425  df-fzo 13568  df-seq 13907  df-exp 13968  df-hash 14231  df-cj 14984  df-re 14985  df-im 14986  df-sqrt 15120  df-abs 15121  df-clim 15370  df-prod 15789
This theorem is referenced by:  prod1  15827  fprodf1o  15829  fprodser  15832  fprodcl2lem  15833  fprodmul  15843  fproddiv  15844  prodsn  15845  prodsnf  15847  fprodconst  15861  fprodn0  15862
  Copyright terms: Public domain W3C validator