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

Theorem summo 15631
Description: A sum has at most one limit. (Contributed by Mario Carneiro, 3-Apr-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
Hypotheses
Ref Expression
summo.1 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 0))
summo.2 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
summo.3 𝐺 = (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵)
Assertion
Ref Expression
summo (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))))
Distinct variable groups:   𝑓,𝑘,𝑚,𝑛,𝑥,𝐴   𝑓,𝐹,𝑘,𝑚,𝑛,𝑥   𝑘,𝐺,𝑚,𝑛,𝑥   𝜑,𝑘,𝑚,𝑛   𝐵,𝑓,𝑚,𝑛,𝑥   𝜑,𝑥,𝑓
Allowed substitution hints:   𝐵(𝑘)   𝐺(𝑓)

Proof of Theorem summo
Dummy variables 𝑔 𝑗 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6831 . . . . . . . . . 10 (𝑚 = 𝑛 → (ℤ𝑚) = (ℤ𝑛))
21sseq2d 3963 . . . . . . . . 9 (𝑚 = 𝑛 → (𝐴 ⊆ (ℤ𝑚) ↔ 𝐴 ⊆ (ℤ𝑛)))
3 seqeq1 13918 . . . . . . . . . 10 (𝑚 = 𝑛 → seq𝑚( + , 𝐹) = seq𝑛( + , 𝐹))
43breq1d 5105 . . . . . . . . 9 (𝑚 = 𝑛 → (seq𝑚( + , 𝐹) ⇝ 𝑦 ↔ seq𝑛( + , 𝐹) ⇝ 𝑦))
52, 4anbi12d 632 . . . . . . . 8 (𝑚 = 𝑛 → ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ↔ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)))
65cbvrexvw 3212 . . . . . . 7 (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ↔ ∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))
7 reeanv 3205 . . . . . . . . 9 (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ ∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)))
8 simprlr 779 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → seq𝑚( + , 𝐹) ⇝ 𝑥)
9 summo.1 . . . . . . . . . . . . . 14 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 0))
10 summo.2 . . . . . . . . . . . . . . 15 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
1110ad4ant14 752 . . . . . . . . . . . . . 14 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘𝐴) → 𝐵 ∈ ℂ)
12 simplrl 776 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝑚 ∈ ℤ)
13 simplrr 777 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝑛 ∈ ℤ)
14 simprll 778 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝐴 ⊆ (ℤ𝑚))
15 simprrl 780 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝐴 ⊆ (ℤ𝑛))
169, 11, 12, 13, 14, 15sumrb 15627 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → (seq𝑚( + , 𝐹) ⇝ 𝑥 ↔ seq𝑛( + , 𝐹) ⇝ 𝑥))
178, 16mpbid 232 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → seq𝑛( + , 𝐹) ⇝ 𝑥)
18 simprrr 781 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → seq𝑛( + , 𝐹) ⇝ 𝑦)
19 climuni 15466 . . . . . . . . . . . 12 ((seq𝑛( + , 𝐹) ⇝ 𝑥 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦)
2017, 18, 19syl2anc 584 . . . . . . . . . . 11 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝑥 = 𝑦)
2120exp31 419 . . . . . . . . . 10 (𝜑 → ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) → (((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) → 𝑥 = 𝑦)))
2221rexlimdvv 3189 . . . . . . . . 9 (𝜑 → (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) → 𝑥 = 𝑦))
237, 22biimtrrid 243 . . . . . . . 8 (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ ∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) → 𝑥 = 𝑦))
2423expdimp 452 . . . . . . 7 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → (∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ seq𝑛( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦))
256, 24biimtrid 242 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦))
26 summo.3 . . . . . . 7 𝐺 = (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵)
279, 10, 26summolem2 15630 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) → 𝑥 = 𝑦))
2825, 27jaod 859 . . . . 5 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))) → 𝑥 = 𝑦))
299, 10, 26summolem2 15630 . . . . . . . 8 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) → 𝑦 = 𝑥))
30 equcom 2019 . . . . . . . 8 (𝑦 = 𝑥𝑥 = 𝑦)
3129, 30imbitrdi 251 . . . . . . 7 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) → 𝑥 = 𝑦))
3231impancom 451 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦))
33 oveq2 7363 . . . . . . . . . . . 12 (𝑚 = 𝑛 → (1...𝑚) = (1...𝑛))
3433f1oeq2d 6767 . . . . . . . . . . 11 (𝑚 = 𝑛 → (𝑓:(1...𝑚)–1-1-onto𝐴𝑓:(1...𝑛)–1-1-onto𝐴))
35 fveq2 6831 . . . . . . . . . . . 12 (𝑚 = 𝑛 → (seq1( + , 𝐺)‘𝑚) = (seq1( + , 𝐺)‘𝑛))
3635eqeq2d 2744 . . . . . . . . . . 11 (𝑚 = 𝑛 → (𝑦 = (seq1( + , 𝐺)‘𝑚) ↔ 𝑦 = (seq1( + , 𝐺)‘𝑛)))
3734, 36anbi12d 632 . . . . . . . . . 10 (𝑚 = 𝑛 → ((𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ (𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛))))
3837exbidv 1922 . . . . . . . . 9 (𝑚 = 𝑛 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛))))
39 f1oeq1 6759 . . . . . . . . . . 11 (𝑓 = 𝑔 → (𝑓:(1...𝑛)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴))
40 fveq1 6830 . . . . . . . . . . . . . . . . 17 (𝑓 = 𝑔 → (𝑓𝑛) = (𝑔𝑛))
4140csbeq1d 3850 . . . . . . . . . . . . . . . 16 (𝑓 = 𝑔(𝑓𝑛) / 𝑘𝐵 = (𝑔𝑛) / 𝑘𝐵)
4241mpteq2dv 5189 . . . . . . . . . . . . . . 15 (𝑓 = 𝑔 → (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵) = (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))
4326, 42eqtrid 2780 . . . . . . . . . . . . . 14 (𝑓 = 𝑔𝐺 = (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))
4443seqeq3d 13923 . . . . . . . . . . . . 13 (𝑓 = 𝑔 → seq1( + , 𝐺) = seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵)))
4544fveq1d 6833 . . . . . . . . . . . 12 (𝑓 = 𝑔 → (seq1( + , 𝐺)‘𝑛) = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))
4645eqeq2d 2744 . . . . . . . . . . 11 (𝑓 = 𝑔 → (𝑦 = (seq1( + , 𝐺)‘𝑛) ↔ 𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛)))
4739, 46anbi12d 632 . . . . . . . . . 10 (𝑓 = 𝑔 → ((𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛)) ↔ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))))
4847cbvexvw 2038 . . . . . . . . 9 (∃𝑓(𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛)) ↔ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛)))
4938, 48bitrdi 287 . . . . . . . 8 (𝑚 = 𝑛 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))))
5049cbvrexvw 3212 . . . . . . 7 (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛)))
51 reeanv 3205 . . . . . . . . 9 (∃𝑚 ∈ ℕ ∃𝑛 ∈ ℕ (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) ↔ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))))
52 exdistrv 1956 . . . . . . . . . . 11 (∃𝑓𝑔((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) ↔ (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))))
53 an4 656 . . . . . . . . . . . . 13 (((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) ↔ ((𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴) ∧ (𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))))
5410ad4ant14 752 . . . . . . . . . . . . . . . 16 ((((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) ∧ 𝑘𝐴) → 𝐵 ∈ ℂ)
55 fveq2 6831 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑗 → (𝑓𝑛) = (𝑓𝑗))
5655csbeq1d 3850 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑗(𝑓𝑛) / 𝑘𝐵 = (𝑓𝑗) / 𝑘𝐵)
5756cbvmptv 5199 . . . . . . . . . . . . . . . . 17 (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵) = (𝑗 ∈ ℕ ↦ (𝑓𝑗) / 𝑘𝐵)
5826, 57eqtri 2756 . . . . . . . . . . . . . . . 16 𝐺 = (𝑗 ∈ ℕ ↦ (𝑓𝑗) / 𝑘𝐵)
59 fveq2 6831 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑗 → (𝑔𝑛) = (𝑔𝑗))
6059csbeq1d 3850 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑗(𝑔𝑛) / 𝑘𝐵 = (𝑔𝑗) / 𝑘𝐵)
6160cbvmptv 5199 . . . . . . . . . . . . . . . 16 (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵) = (𝑗 ∈ ℕ ↦ (𝑔𝑗) / 𝑘𝐵)
62 simplr 768 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ))
63 simprl 770 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑓:(1...𝑚)–1-1-onto𝐴)
64 simprr 772 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑔:(1...𝑛)–1-1-onto𝐴)
659, 54, 58, 61, 62, 63, 64summolem3 15628 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (seq1( + , 𝐺)‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))
66 eqeq12 2750 . . . . . . . . . . . . . . 15 ((𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛)) → (𝑥 = 𝑦 ↔ (seq1( + , 𝐺)‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛)))
6765, 66syl5ibrcom 247 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → ((𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛)) → 𝑥 = 𝑦))
6867expimpd 453 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → (((𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴) ∧ (𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) → 𝑥 = 𝑦))
6953, 68biimtrid 242 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → (((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) → 𝑥 = 𝑦))
7069exlimdvv 1935 . . . . . . . . . . 11 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → (∃𝑓𝑔((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) → 𝑥 = 𝑦))
7152, 70biimtrrid 243 . . . . . . . . . 10 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → ((∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) → 𝑥 = 𝑦))
7271rexlimdvva 3190 . . . . . . . . 9 (𝜑 → (∃𝑚 ∈ ℕ ∃𝑛 ∈ ℕ (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) → 𝑥 = 𝑦))
7351, 72biimtrrid 243 . . . . . . . 8 (𝜑 → ((∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛))) → 𝑥 = 𝑦))
7473expdimp 452 . . . . . . 7 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → (∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑔𝑛) / 𝑘𝐵))‘𝑛)) → 𝑥 = 𝑦))
7550, 74biimtrid 242 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) → 𝑥 = 𝑦))
7632, 75jaod 859 . . . . 5 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))) → 𝑥 = 𝑦))
7728, 76jaodan 959 . . . 4 ((𝜑 ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)))) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))) → 𝑥 = 𝑦))
7877expimpd 453 . . 3 (𝜑 → (((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))) → 𝑥 = 𝑦))
7978alrimivv 1929 . 2 (𝜑 → ∀𝑥𝑦(((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))) → 𝑥 = 𝑦))
80 breq2 5099 . . . . . 6 (𝑥 = 𝑦 → (seq𝑚( + , 𝐹) ⇝ 𝑥 ↔ seq𝑚( + , 𝐹) ⇝ 𝑦))
8180anbi2d 630 . . . . 5 (𝑥 = 𝑦 → ((𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ↔ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)))
8281rexbidv 3157 . . . 4 (𝑥 = 𝑦 → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ↔ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)))
83 eqeq1 2737 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = (seq1( + , 𝐺)‘𝑚) ↔ 𝑦 = (seq1( + , 𝐺)‘𝑚)))
8483anbi2d 630 . . . . . 6 (𝑥 = 𝑦 → ((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))))
8584exbidv 1922 . . . . 5 (𝑥 = 𝑦 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))))
8685rexbidv 3157 . . . 4 (𝑥 = 𝑦 → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))))
8782, 86orbi12d 918 . . 3 (𝑥 = 𝑦 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))))
8887mo4 2563 . 2 (∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ↔ ∀𝑥𝑦(((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))) → 𝑥 = 𝑦))
8979, 88sylibr 234 1 (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 847  wal 1539   = wceq 1541  wex 1780  wcel 2113  ∃*wmo 2535  wrex 3057  csb 3846  wss 3898  ifcif 4476   class class class wbr 5095  cmpt 5176  1-1-ontowf1o 6488  cfv 6489  (class class class)co 7355  cc 11015  0cc0 11017  1c1 11018   + caddc 11020  cn 12136  cz 12479  cuz 12742  ...cfz 13414  seqcseq 13915  cli 15398
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-inf2 9542  ax-cnex 11073  ax-resscn 11074  ax-1cn 11075  ax-icn 11076  ax-addcl 11077  ax-addrcl 11078  ax-mulcl 11079  ax-mulrcl 11080  ax-mulcom 11081  ax-addass 11082  ax-mulass 11083  ax-distr 11084  ax-i2m1 11085  ax-1ne0 11086  ax-1rid 11087  ax-rnegex 11088  ax-rrecex 11089  ax-cnre 11090  ax-pre-lttri 11091  ax-pre-lttrn 11092  ax-pre-ltadd 11093  ax-pre-mulgt0 11094  ax-pre-sup 11095
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-se 5575  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-isom 6498  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-er 8631  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-sup 9337  df-oi 9407  df-card 9843  df-pnf 11159  df-mnf 11160  df-xr 11161  df-ltxr 11162  df-le 11163  df-sub 11357  df-neg 11358  df-div 11786  df-nn 12137  df-2 12199  df-3 12200  df-n0 12393  df-z 12480  df-uz 12743  df-rp 12897  df-fz 13415  df-fzo 13562  df-seq 13916  df-exp 13976  df-hash 14245  df-cj 15013  df-re 15014  df-im 15015  df-sqrt 15149  df-abs 15150  df-clim 15402
This theorem is referenced by:  fsum  15634
  Copyright terms: Public domain W3C validator