Theorem prodmo 15973

Description: A product has at most one limit. (Contributed by Scott Fenton, 4-Dec-2017.)

Hypotheses

Ref	Expression
prodmo.1	⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))
prodmo.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
prodmo.3	⊢ 𝐺 = (𝑗 ∈ ℕ ↦ ⦋(𝑓‘𝑗) / 𝑘⦌𝐵)

Assertion

Ref	Expression
prodmo	⊢ (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))))

Distinct variable groups:   𝐴,𝑘,𝑛   𝑘,𝐹,𝑛   𝜑,𝑘,𝑛   𝐴,𝑓,𝑗,𝑚   𝐵,𝑓,𝑗,𝑚   𝑗,𝐹   𝜑,𝑗,𝑥,𝑚   𝑗,𝐺,𝑥   𝑥,𝑛   𝑓,𝑘,𝑗,𝑚,𝜑,𝑥   𝑥,𝑦   𝑥,𝐴   𝑓,𝐹,𝑚,𝑥

Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑦)   𝐵(𝑥,𝑦,𝑘,𝑛)   𝐹(𝑦)   𝐺(𝑦,𝑓,𝑘,𝑚,𝑛)

Proof of Theorem prodmo

Dummy variables 𝑎 𝑔 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		3simpb 1149	. . . . . . 7 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) → (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥))
2	1	reximi 3083	. . . . . 6 ⊢ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) → ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥))
3		3simpb 1149	. . . . . . 7 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) → (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧))
4	3	reximi 3083	. . . . . 6 ⊢ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) → ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧))
5		fveq2 6905	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑤 → (ℤ≥‘𝑚) = (ℤ≥‘𝑤))
6	5	sseq2d 4015	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑤 → (𝐴 ⊆ (ℤ≥‘𝑚) ↔ 𝐴 ⊆ (ℤ≥‘𝑤)))
7		seqeq1 14046	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑤 → seq𝑚( · , 𝐹) = seq𝑤( · , 𝐹))
8	7	breq1d 5152	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑤 → (seq𝑚( · , 𝐹) ⇝ 𝑧 ↔ seq𝑤( · , 𝐹) ⇝ 𝑧))
9	6, 8	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑚 = 𝑤 → ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ↔ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))
10	9	cbvrexvw 3237	. . . . . . . . 9 ⊢ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ↔ ∃𝑤 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧))
11	10	anbi2i 623	. . . . . . . 8 ⊢ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑤 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))
12		reeanv 3228	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℤ ∃𝑤 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑤 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))
13	11, 12	bitr4i 278	. . . . . . 7 ⊢ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)) ↔ ∃𝑚 ∈ ℤ ∃𝑤 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))
14		simprlr 779	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧))) → seq𝑚( · , 𝐹) ⇝ 𝑥)
15	14	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → seq𝑚( · , 𝐹) ⇝ 𝑥)
16		prodmo.1	. . . . . . . . . . . . 13 ⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 1))
17		prodmo.2	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
18	17	adantlr 715	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
19		simprll 778	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → 𝑚 ∈ ℤ)
20		simprlr 779	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → 𝑤 ∈ ℤ)
21		simprll 778	. . . . . . . . . . . . . 14 ⊢ (((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧))) → 𝐴 ⊆ (ℤ≥‘𝑚))
22	21	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → 𝐴 ⊆ (ℤ≥‘𝑚))
23		simprrl 780	. . . . . . . . . . . . . 14 ⊢ (((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧))) → 𝐴 ⊆ (ℤ≥‘𝑤))
24	23	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → 𝐴 ⊆ (ℤ≥‘𝑤))
25	16, 18, 19, 20, 22, 24	prodrb 15969	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → (seq𝑚( · , 𝐹) ⇝ 𝑥 ↔ seq𝑤( · , 𝐹) ⇝ 𝑥))
26	15, 25	mpbid 232	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → seq𝑤( · , 𝐹) ⇝ 𝑥)
27		simprrr 781	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧))) → seq𝑤( · , 𝐹) ⇝ 𝑧)
28	27	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → seq𝑤( · , 𝐹) ⇝ 𝑧)
29		climuni 15589	. . . . . . . . . . 11 ⊢ ((seq𝑤( · , 𝐹) ⇝ 𝑥 ∧ seq𝑤( · , 𝐹) ⇝ 𝑧) → 𝑥 = 𝑧)
30	26, 28, 29	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)))) → 𝑥 = 𝑧)
31	30	expcom 413	. . . . . . . . 9 ⊢ (((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) ∧ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧))) → (𝜑 → 𝑥 = 𝑧))
32	31	ex 412	. . . . . . . 8 ⊢ ((𝑚 ∈ ℤ ∧ 𝑤 ∈ ℤ) → (((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)) → (𝜑 → 𝑥 = 𝑧)))
33	32	rexlimivv 3200	. . . . . . 7 ⊢ (∃𝑚 ∈ ℤ ∃𝑤 ∈ ℤ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ≥‘𝑤) ∧ seq𝑤( · , 𝐹) ⇝ 𝑧)) → (𝜑 → 𝑥 = 𝑧))
34	13, 33	sylbi 217	. . . . . 6 ⊢ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)) → (𝜑 → 𝑥 = 𝑧))
35	2, 4, 34	syl2an 596	. . . . 5 ⊢ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)) → (𝜑 → 𝑥 = 𝑧))
36		prodmo.3	. . . . . . . . . 10 ⊢ 𝐺 = (𝑗 ∈ ℕ ↦ ⦋(𝑓‘𝑗) / 𝑘⦌𝐵)
37	16, 17, 36	prodmolem2 15972	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) → 𝑧 = 𝑥))
38		equcomi 2015	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → 𝑥 = 𝑧)
39	37, 38	syl6 35	. . . . . . . 8 ⊢ ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) → 𝑥 = 𝑧))
40	39	expimpd 453	. . . . . . 7 ⊢ (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) → 𝑥 = 𝑧))
41	40	com12 32	. . . . . 6 ⊢ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) → (𝜑 → 𝑥 = 𝑧))
42	41	ancoms 458	. . . . 5 ⊢ ((∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)) → (𝜑 → 𝑥 = 𝑧))
43	16, 17, 36	prodmolem2 15972	. . . . . . 7 ⊢ ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)) → 𝑥 = 𝑧))
44	43	expimpd 453	. . . . . 6 ⊢ (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))) → 𝑥 = 𝑧))
45	44	com12 32	. . . . 5 ⊢ ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))) → (𝜑 → 𝑥 = 𝑧))
46		reeanv 3228	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℕ ∃𝑤 ∈ ℕ (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) ↔ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑤 ∈ ℕ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))))
47		exdistrv 1954	. . . . . . . . 9 ⊢ (∃𝑓∃𝑔((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) ↔ (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))))
48	47	2rexbii 3128	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℕ ∃𝑤 ∈ ℕ ∃𝑓∃𝑔((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) ↔ ∃𝑚 ∈ ℕ ∃𝑤 ∈ ℕ (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))))
49		oveq2 7440	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑤 → (1...𝑚) = (1...𝑤))
50	49	f1oeq2d 6843	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑤 → (𝑓:(1...𝑚)–1-1-onto→𝐴 ↔ 𝑓:(1...𝑤)–1-1-onto→𝐴))
51		fveq2 6905	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑤 → (seq1( · , 𝐺)‘𝑚) = (seq1( · , 𝐺)‘𝑤))
52	51	eqeq2d 2747	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑤 → (𝑧 = (seq1( · , 𝐺)‘𝑚) ↔ 𝑧 = (seq1( · , 𝐺)‘𝑤)))
53	50, 52	anbi12d 632	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑤 → ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)) ↔ (𝑓:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑤))))
54	53	exbidv 1920	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑤 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑤))))
55		f1oeq1 6835	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → (𝑓:(1...𝑤)–1-1-onto→𝐴 ↔ 𝑔:(1...𝑤)–1-1-onto→𝐴))
56		fveq1 6904	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑗) = (𝑔‘𝑗))
57	56	csbeq1d 3902	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 = 𝑔 → ⦋(𝑓‘𝑗) / 𝑘⦌𝐵 = ⦋(𝑔‘𝑗) / 𝑘⦌𝐵)
58	57	mpteq2dv 5243	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = 𝑔 → (𝑗 ∈ ℕ ↦ ⦋(𝑓‘𝑗) / 𝑘⦌𝐵) = (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))
59	36, 58	eqtrid 2788	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑔 → 𝐺 = (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))
60	59	seqeq3d 14051	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑔 → seq1( · , 𝐺) = seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵)))
61	60	fveq1d 6907	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑔 → (seq1( · , 𝐺)‘𝑤) = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))
62	61	eqeq2d 2747	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → (𝑧 = (seq1( · , 𝐺)‘𝑤) ↔ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤)))
63	55, 62	anbi12d 632	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((𝑓:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑤)) ↔ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))))
64	63	cbvexvw 2035	. . . . . . . . . . 11 ⊢ (∃𝑓(𝑓:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑤)) ↔ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤)))
65	54, 64	bitrdi 287	. . . . . . . . . 10 ⊢ (𝑚 = 𝑤 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)) ↔ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))))
66	65	cbvrexvw 3237	. . . . . . . . 9 ⊢ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)) ↔ ∃𝑤 ∈ ℕ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤)))
67	66	anbi2i 623	. . . . . . . 8 ⊢ ((∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))) ↔ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑤 ∈ ℕ ∃𝑔(𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))))
68	46, 48, 67	3bitr4i 303	. . . . . . 7 ⊢ (∃𝑚 ∈ ℕ ∃𝑤 ∈ ℕ ∃𝑓∃𝑔((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) ↔ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))))
69		an4 656	. . . . . . . . . 10 ⊢ (((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) ↔ ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴) ∧ (𝑥 = (seq1( · , 𝐺)‘𝑚) ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))))
70	17	ad4ant14 752	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴)) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
71		fveq2 6905	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑎 → (𝑓‘𝑗) = (𝑓‘𝑎))
72	71	csbeq1d 3902	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑎 → ⦋(𝑓‘𝑗) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑎) / 𝑘⦌𝐵)
73	72	cbvmptv 5254	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ ℕ ↦ ⦋(𝑓‘𝑗) / 𝑘⦌𝐵) = (𝑎 ∈ ℕ ↦ ⦋(𝑓‘𝑎) / 𝑘⦌𝐵)
74	36, 73	eqtri 2764	. . . . . . . . . . . . 13 ⊢ 𝐺 = (𝑎 ∈ ℕ ↦ ⦋(𝑓‘𝑎) / 𝑘⦌𝐵)
75		fveq2 6905	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑎 → (𝑔‘𝑗) = (𝑔‘𝑎))
76	75	csbeq1d 3902	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑎 → ⦋(𝑔‘𝑗) / 𝑘⦌𝐵 = ⦋(𝑔‘𝑎) / 𝑘⦌𝐵)
77	76	cbvmptv 5254	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵) = (𝑎 ∈ ℕ ↦ ⦋(𝑔‘𝑎) / 𝑘⦌𝐵)
78		simplr 768	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴)) → (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ))
79		simprl 770	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴)) → 𝑓:(1...𝑚)–1-1-onto→𝐴)
80		simprr 772	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴)) → 𝑔:(1...𝑤)–1-1-onto→𝐴)
81	16, 70, 74, 77, 78, 79, 80	prodmolem3 15970	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴)) → (seq1( · , 𝐺)‘𝑚) = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))
82		eqeq12 2753	. . . . . . . . . . . 12 ⊢ ((𝑥 = (seq1( · , 𝐺)‘𝑚) ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤)) → (𝑥 = 𝑧 ↔ (seq1( · , 𝐺)‘𝑚) = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤)))
83	81, 82	syl5ibrcom 247	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴)) → ((𝑥 = (seq1( · , 𝐺)‘𝑚) ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤)) → 𝑥 = 𝑧))
84	83	expimpd 453	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) → (((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑔:(1...𝑤)–1-1-onto→𝐴) ∧ (𝑥 = (seq1( · , 𝐺)‘𝑚) ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) → 𝑥 = 𝑧))
85	69, 84	biimtrid 242	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) → (((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) → 𝑥 = 𝑧))
86	85	exlimdvv 1933	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑤 ∈ ℕ)) → (∃𝑓∃𝑔((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) → 𝑥 = 𝑧))
87	86	rexlimdvva 3212	. . . . . . 7 ⊢ (𝜑 → (∃𝑚 ∈ ℕ ∃𝑤 ∈ ℕ ∃𝑓∃𝑔((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑤)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , (𝑗 ∈ ℕ ↦ ⦋(𝑔‘𝑗) / 𝑘⦌𝐵))‘𝑤))) → 𝑥 = 𝑧))
88	68, 87	biimtrrid 243	. . . . . 6 ⊢ (𝜑 → ((∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))) → 𝑥 = 𝑧))
89	88	com12 32	. . . . 5 ⊢ ((∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))) → (𝜑 → 𝑥 = 𝑧))
90	35, 42, 45, 89	ccase 1037	. . . 4 ⊢ (((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)))) → (𝜑 → 𝑥 = 𝑧))
91	90	com12 32	. . 3 ⊢ (𝜑 → (((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)))) → 𝑥 = 𝑧))
92	91	alrimivv 1927	. 2 ⊢ (𝜑 → ∀𝑥∀𝑧(((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)))) → 𝑥 = 𝑧))
93		breq2 5146	. . . . . 6 ⊢ (𝑥 = 𝑧 → (seq𝑚( · , 𝐹) ⇝ 𝑥 ↔ seq𝑚( · , 𝐹) ⇝ 𝑧))
94	93	3anbi3d 1443	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ↔ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)))
95	94	rexbidv 3178	. . . 4 ⊢ (𝑥 = 𝑧 → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ↔ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧)))
96		eqeq1 2740	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = (seq1( · , 𝐺)‘𝑚) ↔ 𝑧 = (seq1( · , 𝐺)‘𝑚)))
97	96	anbi2d 630	. . . . . 6 ⊢ (𝑥 = 𝑧 → ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))))
98	97	exbidv 1920	. . . . 5 ⊢ (𝑥 = 𝑧 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))))
99	98	rexbidv 3178	. . . 4 ⊢ (𝑥 = 𝑧 → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚))))
100	95, 99	orbi12d 918	. . 3 ⊢ (𝑥 = 𝑧 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)))))
101	100	mo4 2565	. 2 ⊢ (∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) ↔ ∀𝑥∀𝑧(((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑧 = (seq1( · , 𝐺)‘𝑚)))) → 𝑥 = 𝑧))
102	92, 101	sylibr 234	1 ⊢ (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∃𝑛 ∈ (ℤ≥‘𝑚)∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦) ∧ seq𝑚( · , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( · , 𝐺)‘𝑚))))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   ∧ w3a 1086  ∀wal 1537   = wceq 1539  ∃wex 1778   ∈ wcel 2107  ∃*wmo 2537   ≠ wne 2939  ∃wrex 3069  ⦋csb 3898   ⊆ wss 3950  ifcif 4524   class class class wbr 5142   ↦ cmpt 5224  –1-1-onto→wf1o 6559  ‘cfv 6560  (class class class)co 7432  ℂcc 11154  0cc0 11156  1c1 11157   · cmul 11161  ℕcn 12267  ℤcz 12615  ℤ_≥cuz 12879  ...cfz 13548  seqcseq 14043   ⇝ cli 15521

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-inf2 9682  ax-cnex 11212  ax-resscn 11213  ax-1cn 11214  ax-icn 11215  ax-addcl 11216  ax-addrcl 11217  ax-mulcl 11218  ax-mulrcl 11219  ax-mulcom 11220  ax-addass 11221  ax-mulass 11222  ax-distr 11223  ax-i2m1 11224  ax-1ne0 11225  ax-1rid 11226  ax-rnegex 11227  ax-rrecex 11228  ax-cnre 11229  ax-pre-lttri 11230  ax-pre-lttrn 11231  ax-pre-ltadd 11232  ax-pre-mulgt0 11233  ax-pre-sup 11234

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3379  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-se 5637  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-isom 6569  df-riota 7389  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-1o 8507  df-er 8746  df-en 8987  df-dom 8988  df-sdom 8989  df-fin 8990  df-sup 9483  df-oi 9551  df-card 9980  df-pnf 11298  df-mnf 11299  df-xr 11300  df-ltxr 11301  df-le 11302  df-sub 11495  df-neg 11496  df-div 11922  df-nn 12268  df-2 12330  df-3 12331  df-n0 12529  df-z 12616  df-uz 12880  df-rp 13036  df-fz 13549  df-fzo 13696  df-seq 14044  df-exp 14104  df-hash 14371  df-cj 15139  df-re 15140  df-im 15141  df-sqrt 15275  df-abs 15276  df-clim 15525

This theorem is referenced by:  fprod  15978