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

Theorem zprod 14648
Description: Series product with index set a subset of the upper integers. (Contributed by Scott Fenton, 5-Dec-2017.)
Hypotheses
Ref Expression
zprod.1 𝑍 = (ℤ𝑀)
zprod.2 (𝜑𝑀 ∈ ℤ)
zprod.3 (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))
zprod.4 (𝜑𝐴𝑍)
zprod.5 ((𝜑𝑘𝑍) → (𝐹𝑘) = if(𝑘𝐴, 𝐵, 1))
zprod.6 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
Assertion
Ref Expression
zprod (𝜑 → ∏𝑘𝐴 𝐵 = ( ⇝ ‘seq𝑀( · , 𝐹)))
Distinct variable groups:   𝐴,𝑘,𝑛,𝑦   𝐵,𝑛,𝑦   𝑘,𝐹   𝑘,𝑛,𝜑,𝑦   𝑘,𝑀,𝑦   𝜑,𝑛,𝑦   𝑛,𝑍
Allowed substitution hints:   𝐵(𝑘)   𝐹(𝑦,𝑛)   𝑀(𝑛)   𝑍(𝑦,𝑘)

Proof of Theorem zprod
Dummy variables 𝑓 𝑔 𝑖 𝑗 𝑚 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 3simpb 1057 . . . . . . . 8 ((𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
2 nfcv 2762 . . . . . . . . . . . 12 𝑖if(𝑘𝐴, 𝐵, 1)
3 nfv 1841 . . . . . . . . . . . . 13 𝑘 𝑖𝐴
4 nfcsb1v 3542 . . . . . . . . . . . . 13 𝑘𝑖 / 𝑘𝐵
5 nfcv 2762 . . . . . . . . . . . . 13 𝑘1
63, 4, 5nfif 4106 . . . . . . . . . . . 12 𝑘if(𝑖𝐴, 𝑖 / 𝑘𝐵, 1)
7 eleq1 2687 . . . . . . . . . . . . 13 (𝑘 = 𝑖 → (𝑘𝐴𝑖𝐴))
8 csbeq1a 3535 . . . . . . . . . . . . 13 (𝑘 = 𝑖𝐵 = 𝑖 / 𝑘𝐵)
97, 8ifbieq1d 4100 . . . . . . . . . . . 12 (𝑘 = 𝑖 → if(𝑘𝐴, 𝐵, 1) = if(𝑖𝐴, 𝑖 / 𝑘𝐵, 1))
102, 6, 9cbvmpt 4740 . . . . . . . . . . 11 (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1)) = (𝑖 ∈ ℤ ↦ if(𝑖𝐴, 𝑖 / 𝑘𝐵, 1))
11 simpll 789 . . . . . . . . . . . 12 (((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) → 𝜑)
12 zprod.6 . . . . . . . . . . . . . 14 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
1312ralrimiva 2963 . . . . . . . . . . . . 13 (𝜑 → ∀𝑘𝐴 𝐵 ∈ ℂ)
144nfel1 2776 . . . . . . . . . . . . . 14 𝑘𝑖 / 𝑘𝐵 ∈ ℂ
158eleq1d 2684 . . . . . . . . . . . . . 14 (𝑘 = 𝑖 → (𝐵 ∈ ℂ ↔ 𝑖 / 𝑘𝐵 ∈ ℂ))
1614, 15rspc 3298 . . . . . . . . . . . . 13 (𝑖𝐴 → (∀𝑘𝐴 𝐵 ∈ ℂ → 𝑖 / 𝑘𝐵 ∈ ℂ))
1713, 16syl5 34 . . . . . . . . . . . 12 (𝑖𝐴 → (𝜑𝑖 / 𝑘𝐵 ∈ ℂ))
1811, 17mpan9 486 . . . . . . . . . . 11 ((((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) ∧ 𝑖𝐴) → 𝑖 / 𝑘𝐵 ∈ ℂ)
19 simplr 791 . . . . . . . . . . 11 (((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) → 𝑚 ∈ ℤ)
20 zprod.2 . . . . . . . . . . . 12 (𝜑𝑀 ∈ ℤ)
2120ad2antrr 761 . . . . . . . . . . 11 (((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) → 𝑀 ∈ ℤ)
22 simpr 477 . . . . . . . . . . 11 (((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) → 𝐴 ⊆ (ℤ𝑚))
23 zprod.4 . . . . . . . . . . . . 13 (𝜑𝐴𝑍)
24 zprod.1 . . . . . . . . . . . . 13 𝑍 = (ℤ𝑀)
2523, 24syl6sseq 3643 . . . . . . . . . . . 12 (𝜑𝐴 ⊆ (ℤ𝑀))
2625ad2antrr 761 . . . . . . . . . . 11 (((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) → 𝐴 ⊆ (ℤ𝑀))
2710, 18, 19, 21, 22, 26prodrb 14643 . . . . . . . . . 10 (((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) → (seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥 ↔ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
2827biimpd 219 . . . . . . . . 9 (((𝜑𝑚 ∈ ℤ) ∧ 𝐴 ⊆ (ℤ𝑚)) → (seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥 → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
2928expimpd 628 . . . . . . . 8 ((𝜑𝑚 ∈ ℤ) → ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
301, 29syl5 34 . . . . . . 7 ((𝜑𝑚 ∈ ℤ) → ((𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
3130rexlimdva 3027 . . . . . 6 (𝜑 → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
32 uzssz 11692 . . . . . . . . . . . . . . . . 17 (ℤ𝑀) ⊆ ℤ
33 zssre 11369 . . . . . . . . . . . . . . . . 17 ℤ ⊆ ℝ
3432, 33sstri 3604 . . . . . . . . . . . . . . . 16 (ℤ𝑀) ⊆ ℝ
3524, 34eqsstri 3627 . . . . . . . . . . . . . . 15 𝑍 ⊆ ℝ
3623, 35syl6ss 3607 . . . . . . . . . . . . . 14 (𝜑𝐴 ⊆ ℝ)
3736ad2antrr 761 . . . . . . . . . . . . 13 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → 𝐴 ⊆ ℝ)
38 ltso 10103 . . . . . . . . . . . . 13 < Or ℝ
39 soss 5043 . . . . . . . . . . . . 13 (𝐴 ⊆ ℝ → ( < Or ℝ → < Or 𝐴))
4037, 38, 39mpisyl 21 . . . . . . . . . . . 12 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → < Or 𝐴)
41 fzfi 12754 . . . . . . . . . . . . 13 (1...𝑚) ∈ Fin
42 ovex 6663 . . . . . . . . . . . . . . . 16 (1...𝑚) ∈ V
4342f1oen 7961 . . . . . . . . . . . . . . 15 (𝑓:(1...𝑚)–1-1-onto𝐴 → (1...𝑚) ≈ 𝐴)
4443adantl 482 . . . . . . . . . . . . . 14 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → (1...𝑚) ≈ 𝐴)
4544ensymd 7992 . . . . . . . . . . . . 13 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → 𝐴 ≈ (1...𝑚))
46 enfii 8162 . . . . . . . . . . . . 13 (((1...𝑚) ∈ Fin ∧ 𝐴 ≈ (1...𝑚)) → 𝐴 ∈ Fin)
4741, 45, 46sylancr 694 . . . . . . . . . . . 12 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → 𝐴 ∈ Fin)
48 fz1iso 13229 . . . . . . . . . . . 12 (( < Or 𝐴𝐴 ∈ Fin) → ∃𝑔 𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))
4940, 47, 48syl2anc 692 . . . . . . . . . . 11 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → ∃𝑔 𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))
50 simpll 789 . . . . . . . . . . . . . . 15 (((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) → 𝜑)
5150, 17mpan9 486 . . . . . . . . . . . . . 14 ((((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) ∧ 𝑖𝐴) → 𝑖 / 𝑘𝐵 ∈ ℂ)
52 fveq2 6178 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑗 → (𝑓𝑛) = (𝑓𝑗))
5352csbeq1d 3533 . . . . . . . . . . . . . . . 16 (𝑛 = 𝑗(𝑓𝑛) / 𝑘𝐵 = (𝑓𝑗) / 𝑘𝐵)
54 csbco 3536 . . . . . . . . . . . . . . . 16 (𝑓𝑗) / 𝑖𝑖 / 𝑘𝐵 = (𝑓𝑗) / 𝑘𝐵
5553, 54syl6eqr 2672 . . . . . . . . . . . . . . 15 (𝑛 = 𝑗(𝑓𝑛) / 𝑘𝐵 = (𝑓𝑗) / 𝑖𝑖 / 𝑘𝐵)
5655cbvmptv 4741 . . . . . . . . . . . . . 14 (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵) = (𝑗 ∈ ℕ ↦ (𝑓𝑗) / 𝑖𝑖 / 𝑘𝐵)
57 eqid 2620 . . . . . . . . . . . . . 14 (𝑗 ∈ ℕ ↦ (𝑔𝑗) / 𝑖𝑖 / 𝑘𝐵) = (𝑗 ∈ ℕ ↦ (𝑔𝑗) / 𝑖𝑖 / 𝑘𝐵)
58 simplr 791 . . . . . . . . . . . . . 14 (((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) → 𝑚 ∈ ℕ)
5920ad2antrr 761 . . . . . . . . . . . . . 14 (((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) → 𝑀 ∈ ℤ)
6025ad2antrr 761 . . . . . . . . . . . . . 14 (((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) → 𝐴 ⊆ (ℤ𝑀))
61 simprl 793 . . . . . . . . . . . . . 14 (((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) → 𝑓:(1...𝑚)–1-1-onto𝐴)
62 simprr 795 . . . . . . . . . . . . . 14 (((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) → 𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))
6310, 51, 56, 57, 58, 59, 60, 61, 62prodmolem2a 14645 . . . . . . . . . . . . 13 (((𝜑𝑚 ∈ ℕ) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴))) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
6463expr 642 . . . . . . . . . . . 12 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → (𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
6564exlimdv 1859 . . . . . . . . . . 11 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → (∃𝑔 𝑔 Isom < , < ((1...(#‘𝐴)), 𝐴) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
6649, 65mpd 15 . . . . . . . . . 10 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
67 breq2 4648 . . . . . . . . . 10 (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚) → (seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥 ↔ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
6866, 67syl5ibrcom 237 . . . . . . . . 9 (((𝜑𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto𝐴) → (𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
6968expimpd 628 . . . . . . . 8 ((𝜑𝑚 ∈ ℕ) → ((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
7069exlimdv 1859 . . . . . . 7 ((𝜑𝑚 ∈ ℕ) → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
7170rexlimdva 3027 . . . . . 6 (𝜑 → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
7231, 71jaod 395 . . . . 5 (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
7320adantr 481 . . . . . . . 8 ((𝜑 ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → 𝑀 ∈ ℤ)
7423adantr 481 . . . . . . . 8 ((𝜑 ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → 𝐴𝑍)
75 zprod.3 . . . . . . . . . 10 (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))
7624eleq2i 2691 . . . . . . . . . . . 12 (𝑛𝑍𝑛 ∈ (ℤ𝑀))
77 eluzelz 11682 . . . . . . . . . . . . . . . . 17 (𝑛 ∈ (ℤ𝑀) → 𝑛 ∈ ℤ)
7877adantl 482 . . . . . . . . . . . . . . . 16 ((𝜑𝑛 ∈ (ℤ𝑀)) → 𝑛 ∈ ℤ)
79 uztrn 11689 . . . . . . . . . . . . . . . . . . 19 ((𝑧 ∈ (ℤ𝑛) ∧ 𝑛 ∈ (ℤ𝑀)) → 𝑧 ∈ (ℤ𝑀))
8079ancoms 469 . . . . . . . . . . . . . . . . . 18 ((𝑛 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (ℤ𝑛)) → 𝑧 ∈ (ℤ𝑀))
8124eleq2i 2691 . . . . . . . . . . . . . . . . . . . . 21 (𝑘𝑍𝑘 ∈ (ℤ𝑀))
82 zprod.5 . . . . . . . . . . . . . . . . . . . . . 22 ((𝜑𝑘𝑍) → (𝐹𝑘) = if(𝑘𝐴, 𝐵, 1))
8324, 32eqsstri 3627 . . . . . . . . . . . . . . . . . . . . . . . 24 𝑍 ⊆ ℤ
8483sseli 3591 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑘𝑍𝑘 ∈ ℤ)
85 iftrue 4083 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (𝑘𝐴 → if(𝑘𝐴, 𝐵, 1) = 𝐵)
8685adantl 482 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((𝜑𝑘𝐴) → if(𝑘𝐴, 𝐵, 1) = 𝐵)
8786, 12eqeltrd 2699 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝜑𝑘𝐴) → if(𝑘𝐴, 𝐵, 1) ∈ ℂ)
8887ex 450 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝜑 → (𝑘𝐴 → if(𝑘𝐴, 𝐵, 1) ∈ ℂ))
89 iffalse 4086 . . . . . . . . . . . . . . . . . . . . . . . . 25 𝑘𝐴 → if(𝑘𝐴, 𝐵, 1) = 1)
90 ax-1cn 9979 . . . . . . . . . . . . . . . . . . . . . . . . 25 1 ∈ ℂ
9189, 90syl6eqel 2707 . . . . . . . . . . . . . . . . . . . . . . . 24 𝑘𝐴 → if(𝑘𝐴, 𝐵, 1) ∈ ℂ)
9288, 91pm2.61d1 171 . . . . . . . . . . . . . . . . . . . . . . 23 (𝜑 → if(𝑘𝐴, 𝐵, 1) ∈ ℂ)
93 eqid 2620 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1)) = (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))
9493fvmpt2 6278 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑘 ∈ ℤ ∧ if(𝑘𝐴, 𝐵, 1) ∈ ℂ) → ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = if(𝑘𝐴, 𝐵, 1))
9584, 92, 94syl2anr 495 . . . . . . . . . . . . . . . . . . . . . 22 ((𝜑𝑘𝑍) → ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = if(𝑘𝐴, 𝐵, 1))
9682, 95eqtr4d 2657 . . . . . . . . . . . . . . . . . . . . 21 ((𝜑𝑘𝑍) → (𝐹𝑘) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘))
9781, 96sylan2br 493 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑘 ∈ (ℤ𝑀)) → (𝐹𝑘) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘))
9897ralrimiva 2963 . . . . . . . . . . . . . . . . . . 19 (𝜑 → ∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘))
99 nffvmpt1 6186 . . . . . . . . . . . . . . . . . . . . 21 𝑘((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧)
10099nfeq2 2777 . . . . . . . . . . . . . . . . . . . 20 𝑘(𝐹𝑧) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧)
101 fveq2 6178 . . . . . . . . . . . . . . . . . . . . 21 (𝑘 = 𝑧 → (𝐹𝑘) = (𝐹𝑧))
102 fveq2 6178 . . . . . . . . . . . . . . . . . . . . 21 (𝑘 = 𝑧 → ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧))
103101, 102eqeq12d 2635 . . . . . . . . . . . . . . . . . . . 20 (𝑘 = 𝑧 → ((𝐹𝑘) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) ↔ (𝐹𝑧) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧)))
104100, 103rspc 3298 . . . . . . . . . . . . . . . . . . 19 (𝑧 ∈ (ℤ𝑀) → (∀𝑘 ∈ (ℤ𝑀)(𝐹𝑘) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) → (𝐹𝑧) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧)))
10598, 104mpan9 486 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑧 ∈ (ℤ𝑀)) → (𝐹𝑧) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧))
10680, 105sylan2 491 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ (𝑛 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (ℤ𝑛))) → (𝐹𝑧) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧))
107106anassrs 679 . . . . . . . . . . . . . . . 16 (((𝜑𝑛 ∈ (ℤ𝑀)) ∧ 𝑧 ∈ (ℤ𝑛)) → (𝐹𝑧) = ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧))
10878, 107seqfeq 12809 . . . . . . . . . . . . . . 15 ((𝜑𝑛 ∈ (ℤ𝑀)) → seq𝑛( · , 𝐹) = seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))))
109108breq1d 4654 . . . . . . . . . . . . . 14 ((𝜑𝑛 ∈ (ℤ𝑀)) → (seq𝑛( · , 𝐹) ⇝ 𝑦 ↔ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦))
110109anbi2d 739 . . . . . . . . . . . . 13 ((𝜑𝑛 ∈ (ℤ𝑀)) → ((𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ (𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)))
111110exbidv 1848 . . . . . . . . . . . 12 ((𝜑𝑛 ∈ (ℤ𝑀)) → (∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)))
11276, 111sylan2b 492 . . . . . . . . . . 11 ((𝜑𝑛𝑍) → (∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)))
113112rexbidva 3045 . . . . . . . . . 10 (𝜑 → (∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ↔ ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)))
11475, 113mpbid 222 . . . . . . . . 9 (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦))
115114adantr 481 . . . . . . . 8 ((𝜑 ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦))
116 simpr 477 . . . . . . . 8 ((𝜑 ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥)
117 fveq2 6178 . . . . . . . . . . . 12 (𝑚 = 𝑀 → (ℤ𝑚) = (ℤ𝑀))
118117, 24syl6eqr 2672 . . . . . . . . . . 11 (𝑚 = 𝑀 → (ℤ𝑚) = 𝑍)
119118sseq2d 3625 . . . . . . . . . 10 (𝑚 = 𝑀 → (𝐴 ⊆ (ℤ𝑚) ↔ 𝐴𝑍))
120118rexeqdv 3140 . . . . . . . . . 10 (𝑚 = 𝑀 → (∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ↔ ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦)))
121 seqeq1 12787 . . . . . . . . . . 11 (𝑚 = 𝑀 → seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) = seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))))
122121breq1d 4654 . . . . . . . . . 10 (𝑚 = 𝑀 → (seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥 ↔ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
123119, 120, 1223anbi123d 1397 . . . . . . . . 9 (𝑚 = 𝑀 → ((𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ↔ (𝐴𝑍 ∧ ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥)))
124123rspcev 3304 . . . . . . . 8 ((𝑀 ∈ ℤ ∧ (𝐴𝑍 ∧ ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥)) → ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
12573, 74, 115, 116, 124syl13anc 1326 . . . . . . 7 ((𝜑 ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
126125orcd 407 . . . . . 6 ((𝜑 ∧ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
127126ex 450 . . . . 5 (𝜑 → (seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥 → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))))
12872, 127impbid 202 . . . 4 (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ↔ seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥))
12995, 82eqtr4d 2657 . . . . . . . . 9 ((𝜑𝑘𝑍) → ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = (𝐹𝑘))
13081, 129sylan2br 493 . . . . . . . 8 ((𝜑𝑘 ∈ (ℤ𝑀)) → ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = (𝐹𝑘))
131130ralrimiva 2963 . . . . . . 7 (𝜑 → ∀𝑘 ∈ (ℤ𝑀)((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = (𝐹𝑘))
13299nfeq1 2775 . . . . . . . 8 𝑘((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧) = (𝐹𝑧)
133102, 101eqeq12d 2635 . . . . . . . 8 (𝑘 = 𝑧 → (((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = (𝐹𝑘) ↔ ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧) = (𝐹𝑧)))
134132, 133rspc 3298 . . . . . . 7 (𝑧 ∈ (ℤ𝑀) → (∀𝑘 ∈ (ℤ𝑀)((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑘) = (𝐹𝑘) → ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧) = (𝐹𝑧)))
135131, 134mpan9 486 . . . . . 6 ((𝜑𝑧 ∈ (ℤ𝑀)) → ((𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))‘𝑧) = (𝐹𝑧))
13620, 135seqfeq 12809 . . . . 5 (𝜑 → seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) = seq𝑀( · , 𝐹))
137136breq1d 4654 . . . 4 (𝜑 → (seq𝑀( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥 ↔ seq𝑀( · , 𝐹) ⇝ 𝑥))
138128, 137bitrd 268 . . 3 (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))) ↔ seq𝑀( · , 𝐹) ⇝ 𝑥))
139138iotabidv 5860 . 2 (𝜑 → (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))) = (℩𝑥seq𝑀( · , 𝐹) ⇝ 𝑥))
140 df-prod 14617 . 2 𝑘𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∃𝑛 ∈ (ℤ𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑦) ∧ seq𝑚( · , (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 1))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( · , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
141 df-fv 5884 . 2 ( ⇝ ‘seq𝑀( · , 𝐹)) = (℩𝑥seq𝑀( · , 𝐹) ⇝ 𝑥)
142139, 140, 1413eqtr4g 2679 1 (𝜑 → ∏𝑘𝐴 𝐵 = ( ⇝ ‘seq𝑀( · , 𝐹)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wo 383  wa 384  w3a 1036   = wceq 1481  wex 1702  wcel 1988  wne 2791  wral 2909  wrex 2910  csb 3526  wss 3567  ifcif 4077   class class class wbr 4644  cmpt 4720   Or wor 5024  cio 5837  1-1-ontowf1o 5875  cfv 5876   Isom wiso 5877  (class class class)co 6635  cen 7937  Fincfn 7940  cc 9919  cr 9920  0cc0 9921  1c1 9922   · cmul 9926   < clt 10059  cn 11005  cz 11362  cuz 11672  ...cfz 12311  seqcseq 12784  #chash 13100  cli 14196  cprod 14616
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-rep 4762  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897  ax-un 6934  ax-inf2 8523  ax-cnex 9977  ax-resscn 9978  ax-1cn 9979  ax-icn 9980  ax-addcl 9981  ax-addrcl 9982  ax-mulcl 9983  ax-mulrcl 9984  ax-mulcom 9985  ax-addass 9986  ax-mulass 9987  ax-distr 9988  ax-i2m1 9989  ax-1ne0 9990  ax-1rid 9991  ax-rnegex 9992  ax-rrecex 9993  ax-cnre 9994  ax-pre-lttri 9995  ax-pre-lttrn 9996  ax-pre-ltadd 9997  ax-pre-mulgt0 9998
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-nel 2895  df-ral 2914  df-rex 2915  df-reu 2916  df-rmo 2917  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-pss 3583  df-nul 3908  df-if 4078  df-pw 4151  df-sn 4169  df-pr 4171  df-tp 4173  df-op 4175  df-uni 4428  df-int 4467  df-iun 4513  df-br 4645  df-opab 4704  df-mpt 4721  df-tr 4744  df-id 5014  df-eprel 5019  df-po 5025  df-so 5026  df-fr 5063  df-se 5064  df-we 5065  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-pred 5668  df-ord 5714  df-on 5715  df-lim 5716  df-suc 5717  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-f1 5881  df-fo 5882  df-f1o 5883  df-fv 5884  df-isom 5885  df-riota 6596  df-ov 6638  df-oprab 6639  df-mpt2 6640  df-om 7051  df-1st 7153  df-2nd 7154  df-wrecs 7392  df-recs 7453  df-rdg 7491  df-1o 7545  df-oadd 7549  df-er 7727  df-en 7941  df-dom 7942  df-sdom 7943  df-fin 7944  df-oi 8400  df-card 8750  df-pnf 10061  df-mnf 10062  df-xr 10063  df-ltxr 10064  df-le 10065  df-sub 10253  df-neg 10254  df-div 10670  df-nn 11006  df-2 11064  df-n0 11278  df-z 11363  df-uz 11673  df-rp 11818  df-fz 12312  df-fzo 12450  df-seq 12785  df-exp 12844  df-hash 13101  df-cj 13820  df-re 13821  df-im 13822  df-sqrt 13956  df-abs 13957  df-clim 14200  df-prod 14617
This theorem is referenced by:  iprod  14649  zprodn0  14650  prodss  14658
  Copyright terms: Public domain W3C validator