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

Theorem summodc 11339
Description: A sum has at most one limit. (Contributed by Mario Carneiro, 3-Apr-2014.) (Revised by Jim Kingdon, 4-May-2023.)
Hypotheses
Ref Expression
isummo.1 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 0))
isummo.2 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
summodclem2.g 𝐺 = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0))
summodc.3 𝐺 = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0))
Assertion
Ref Expression
summodc (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))))
Distinct variable groups:   𝑘,𝑛,𝐴   𝑛,𝐹   𝜑,𝑘,𝑛   𝐴,𝑓,𝑗,𝑚,𝑘,𝑛   𝐵,𝑛   𝑓,𝐹,𝑘,𝑚   𝜑,𝑓,𝑚,𝑥,𝑘,𝑛   𝑥,𝐴,𝑗   𝐵,𝑓,𝑗,𝑚   𝑗,𝐹,𝑥   𝑛,𝐺,𝑥   𝜑,𝑗,𝑥
Allowed substitution hints:   𝐵(𝑥,𝑘)   𝐺(𝑓,𝑗,𝑘,𝑚)

Proof of Theorem summodc
Dummy variables 𝑎 𝑔 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 5494 . . . . . . . . . 10 (𝑚 = 𝑛 → (ℤ𝑚) = (ℤ𝑛))
21sseq2d 3177 . . . . . . . . 9 (𝑚 = 𝑛 → (𝐴 ⊆ (ℤ𝑚) ↔ 𝐴 ⊆ (ℤ𝑛)))
31raleqdv 2671 . . . . . . . . 9 (𝑚 = 𝑛 → (∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ↔ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴))
4 seqeq1 10397 . . . . . . . . . 10 (𝑚 = 𝑛 → seq𝑚( + , 𝐹) = seq𝑛( + , 𝐹))
54breq1d 3997 . . . . . . . . 9 (𝑚 = 𝑛 → (seq𝑚( + , 𝐹) ⇝ 𝑦 ↔ seq𝑛( + , 𝐹) ⇝ 𝑦))
62, 3, 53anbi123d 1307 . . . . . . . 8 (𝑚 = 𝑛 → ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ↔ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)))
76cbvrexv 2697 . . . . . . 7 (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ↔ ∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))
8 reeanv 2639 . . . . . . . . 9 (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ ∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)))
9 simprl3 1039 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → seq𝑚( + , 𝐹) ⇝ 𝑥)
10 isummo.1 . . . . . . . . . . . . . 14 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘𝐴, 𝐵, 0))
11 simpll 524 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝜑)
12 isummo.2 . . . . . . . . . . . . . . 15 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
1311, 12sylan 281 . . . . . . . . . . . . . 14 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘𝐴) → 𝐵 ∈ ℂ)
14 simplrl 530 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝑚 ∈ ℤ)
15 simplrr 531 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝑛 ∈ ℤ)
16 simprl1 1037 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝐴 ⊆ (ℤ𝑚))
17 simprr1 1040 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝐴 ⊆ (ℤ𝑛))
18 eleq1w 2231 . . . . . . . . . . . . . . . 16 (𝑗 = 𝑘 → (𝑗𝐴𝑘𝐴))
1918dcbid 833 . . . . . . . . . . . . . . 15 (𝑗 = 𝑘 → (DECID 𝑗𝐴DECID 𝑘𝐴))
20 simprl2 1038 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴)
2120adantr 274 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘 ∈ (ℤ𝑚)) → ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴)
22 simpr 109 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘 ∈ (ℤ𝑚)) → 𝑘 ∈ (ℤ𝑚))
2319, 21, 22rspcdva 2839 . . . . . . . . . . . . . 14 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘 ∈ (ℤ𝑚)) → DECID 𝑘𝐴)
24 simprr2 1041 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴)
2524adantr 274 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘 ∈ (ℤ𝑛)) → ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴)
26 simpr 109 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘 ∈ (ℤ𝑛)) → 𝑘 ∈ (ℤ𝑛))
2719, 25, 26rspcdva 2839 . . . . . . . . . . . . . 14 ((((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) ∧ 𝑘 ∈ (ℤ𝑛)) → DECID 𝑘𝐴)
2810, 13, 14, 15, 16, 17, 23, 27sumrbdc 11335 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → (seq𝑚( + , 𝐹) ⇝ 𝑥 ↔ seq𝑛( + , 𝐹) ⇝ 𝑥))
299, 28mpbid 146 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → seq𝑛( + , 𝐹) ⇝ 𝑥)
30 simprr3 1042 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → seq𝑛( + , 𝐹) ⇝ 𝑦)
31 climuni 11249 . . . . . . . . . . . 12 ((seq𝑛( + , 𝐹) ⇝ 𝑥 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦)
3229, 30, 31syl2anc 409 . . . . . . . . . . 11 (((𝜑 ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) ∧ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦))) → 𝑥 = 𝑦)
3332exp31 362 . . . . . . . . . 10 (𝜑 → ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) → (((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) → 𝑥 = 𝑦)))
3433rexlimdvv 2594 . . . . . . . . 9 (𝜑 → (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) → 𝑥 = 𝑦))
358, 34syl5bir 152 . . . . . . . 8 (𝜑 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∧ ∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦)) → 𝑥 = 𝑦))
3635expdimp 257 . . . . . . 7 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → (∃𝑛 ∈ ℤ (𝐴 ⊆ (ℤ𝑛) ∧ ∀𝑗 ∈ (ℤ𝑛)DECID 𝑗𝐴 ∧ seq𝑛( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦))
377, 36syl5bi 151 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦))
38 summodc.3 . . . . . . 7 𝐺 = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0))
3910, 12, 38summodclem2 11338 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) → 𝑥 = 𝑦))
4037, 39jaod 712 . . . . 5 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥)) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))) → 𝑥 = 𝑦))
4110, 12, 38summodclem2 11338 . . . . . . . 8 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) → 𝑦 = 𝑥))
42 equcom 1699 . . . . . . . 8 (𝑦 = 𝑥𝑥 = 𝑦)
4341, 42syl6ib 160 . . . . . . 7 ((𝜑 ∧ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) → 𝑥 = 𝑦))
4443impancom 258 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) → 𝑥 = 𝑦))
45 oveq2 5859 . . . . . . . . . . . 12 (𝑚 = 𝑛 → (1...𝑚) = (1...𝑛))
46 f1oeq2 5430 . . . . . . . . . . . 12 ((1...𝑚) = (1...𝑛) → (𝑓:(1...𝑚)–1-1-onto𝐴𝑓:(1...𝑛)–1-1-onto𝐴))
4745, 46syl 14 . . . . . . . . . . 11 (𝑚 = 𝑛 → (𝑓:(1...𝑚)–1-1-onto𝐴𝑓:(1...𝑛)–1-1-onto𝐴))
48 fveq2 5494 . . . . . . . . . . . 12 (𝑚 = 𝑛 → (seq1( + , 𝐺)‘𝑚) = (seq1( + , 𝐺)‘𝑛))
4948eqeq2d 2182 . . . . . . . . . . 11 (𝑚 = 𝑛 → (𝑦 = (seq1( + , 𝐺)‘𝑚) ↔ 𝑦 = (seq1( + , 𝐺)‘𝑛)))
5047, 49anbi12d 470 . . . . . . . . . 10 (𝑚 = 𝑛 → ((𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ (𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛))))
5150exbidv 1818 . . . . . . . . 9 (𝑚 = 𝑛 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛))))
52 f1oeq1 5429 . . . . . . . . . . 11 (𝑓 = 𝑔 → (𝑓:(1...𝑛)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴))
53 breq1 3990 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑎 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑎 ≤ (♯‘𝐴)))
54 fveq2 5494 . . . . . . . . . . . . . . . . . . 19 (𝑛 = 𝑎 → (𝑓𝑛) = (𝑓𝑎))
5554csbeq1d 3056 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑎(𝑓𝑛) / 𝑘𝐵 = (𝑓𝑎) / 𝑘𝐵)
5653, 55ifbieq1d 3547 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑎 → if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0) = if(𝑎 ≤ (♯‘𝐴), (𝑓𝑎) / 𝑘𝐵, 0))
5756cbvmptv 4083 . . . . . . . . . . . . . . . 16 (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0)) = (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑓𝑎) / 𝑘𝐵, 0))
58 fveq1 5493 . . . . . . . . . . . . . . . . . . 19 (𝑓 = 𝑔 → (𝑓𝑎) = (𝑔𝑎))
5958csbeq1d 3056 . . . . . . . . . . . . . . . . . 18 (𝑓 = 𝑔(𝑓𝑎) / 𝑘𝐵 = (𝑔𝑎) / 𝑘𝐵)
6059ifeq1d 3542 . . . . . . . . . . . . . . . . 17 (𝑓 = 𝑔 → if(𝑎 ≤ (♯‘𝐴), (𝑓𝑎) / 𝑘𝐵, 0) = if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0))
6160mpteq2dv 4078 . . . . . . . . . . . . . . . 16 (𝑓 = 𝑔 → (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑓𝑎) / 𝑘𝐵, 0)) = (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))
6257, 61eqtrid 2215 . . . . . . . . . . . . . . 15 (𝑓 = 𝑔 → (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0)) = (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))
6338, 62eqtrid 2215 . . . . . . . . . . . . . 14 (𝑓 = 𝑔𝐺 = (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))
6463seqeq3d 10402 . . . . . . . . . . . . 13 (𝑓 = 𝑔 → seq1( + , 𝐺) = seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0))))
6564fveq1d 5496 . . . . . . . . . . . 12 (𝑓 = 𝑔 → (seq1( + , 𝐺)‘𝑛) = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))
6665eqeq2d 2182 . . . . . . . . . . 11 (𝑓 = 𝑔 → (𝑦 = (seq1( + , 𝐺)‘𝑛) ↔ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)))
6752, 66anbi12d 470 . . . . . . . . . 10 (𝑓 = 𝑔 → ((𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛)) ↔ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))))
6867cbvexv 1911 . . . . . . . . 9 (∃𝑓(𝑓:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑛)) ↔ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)))
6951, 68bitrdi 195 . . . . . . . 8 (𝑚 = 𝑛 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))))
7069cbvrexv 2697 . . . . . . 7 (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)))
71 reeanv 2639 . . . . . . . . 9 (∃𝑚 ∈ ℕ ∃𝑛 ∈ ℕ (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) ↔ (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))))
72 eeanv 1925 . . . . . . . . . . 11 (∃𝑓𝑔((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) ↔ (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))))
73 an4 581 . . . . . . . . . . . . 13 (((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) ↔ ((𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴) ∧ (𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))))
74 1zzd 9232 . . . . . . . . . . . . . . . . . . . . . . . . 25 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 1 ∈ ℤ)
75 simplrr 531 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑛 ∈ ℕ)
7675nnzd 9326 . . . . . . . . . . . . . . . . . . . . . . . . 25 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑛 ∈ ℤ)
7774, 76fzfigd 10380 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (1...𝑛) ∈ Fin)
78 simprr 527 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑔:(1...𝑛)–1-1-onto𝐴)
7977, 78fihasheqf1od 10717 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (♯‘(1...𝑛)) = (♯‘𝐴))
8075nnnn0d 9181 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑛 ∈ ℕ0)
81 hashfz1 10710 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑛 ∈ ℕ0 → (♯‘(1...𝑛)) = 𝑛)
8280, 81syl 14 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (♯‘(1...𝑛)) = 𝑛)
8379, 82eqtr3d 2205 . . . . . . . . . . . . . . . . . . . . . 22 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (♯‘𝐴) = 𝑛)
8483breq2d 3999 . . . . . . . . . . . . . . . . . . . . 21 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (𝑎 ≤ (♯‘𝐴) ↔ 𝑎𝑛))
8584ifbid 3546 . . . . . . . . . . . . . . . . . . . 20 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0) = if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0))
8685mpteq2dv 4078 . . . . . . . . . . . . . . . . . . 19 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)) = (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))
8786seqeq3d 10402 . . . . . . . . . . . . . . . . . 18 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0))) = seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0))))
8887fveq1d 5496 . . . . . . . . . . . . . . . . 17 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛) = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))
8988eqeq2d 2182 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛) ↔ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)))
9089anbi2d 461 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → ((𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)) ↔ (𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))))
91 simplrl 530 . . . . . . . . . . . . . . . . . . . . 21 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑚 ∈ ℕ)
9291nnnn0d 9181 . . . . . . . . . . . . . . . . . . . 20 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑚 ∈ ℕ0)
93 hashfz1 10710 . . . . . . . . . . . . . . . . . . . 20 (𝑚 ∈ ℕ0 → (♯‘(1...𝑚)) = 𝑚)
9492, 93syl 14 . . . . . . . . . . . . . . . . . . 19 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (♯‘(1...𝑚)) = 𝑚)
9591nnzd 9326 . . . . . . . . . . . . . . . . . . . . 21 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑚 ∈ ℤ)
9674, 95fzfigd 10380 . . . . . . . . . . . . . . . . . . . 20 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (1...𝑚) ∈ Fin)
97 simprl 526 . . . . . . . . . . . . . . . . . . . 20 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑓:(1...𝑚)–1-1-onto𝐴)
9896, 97fihasheqf1od 10717 . . . . . . . . . . . . . . . . . . 19 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (♯‘(1...𝑚)) = (♯‘𝐴))
9994, 98eqtr3d 2205 . . . . . . . . . . . . . . . . . 18 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑚 = (♯‘𝐴))
10099fveq2d 5498 . . . . . . . . . . . . . . . . 17 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (seq1( + , 𝐺)‘𝑚) = (seq1( + , 𝐺)‘(♯‘𝐴)))
101 simpll 524 . . . . . . . . . . . . . . . . . . 19 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝜑)
102101, 12sylan 281 . . . . . . . . . . . . . . . . . 18 ((((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) ∧ 𝑘𝐴) → 𝐵 ∈ ℂ)
10399, 91eqeltrrd 2248 . . . . . . . . . . . . . . . . . . 19 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (♯‘𝐴) ∈ ℕ)
104103, 75jca 304 . . . . . . . . . . . . . . . . . 18 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → ((♯‘𝐴) ∈ ℕ ∧ 𝑛 ∈ ℕ))
10599oveq2d 5867 . . . . . . . . . . . . . . . . . . . 20 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (1...𝑚) = (1...(♯‘𝐴)))
106 f1oeq2 5430 . . . . . . . . . . . . . . . . . . . 20 ((1...𝑚) = (1...(♯‘𝐴)) → (𝑓:(1...𝑚)–1-1-onto𝐴𝑓:(1...(♯‘𝐴))–1-1-onto𝐴))
107105, 106syl 14 . . . . . . . . . . . . . . . . . . 19 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (𝑓:(1...𝑚)–1-1-onto𝐴𝑓:(1...(♯‘𝐴))–1-1-onto𝐴))
10897, 107mpbid 146 . . . . . . . . . . . . . . . . . 18 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)
109 breq1 3990 . . . . . . . . . . . . . . . . . . . . 21 (𝑛 = 𝑗 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑗 ≤ (♯‘𝐴)))
110 fveq2 5494 . . . . . . . . . . . . . . . . . . . . . 22 (𝑛 = 𝑗 → (𝑓𝑛) = (𝑓𝑗))
111110csbeq1d 3056 . . . . . . . . . . . . . . . . . . . . 21 (𝑛 = 𝑗(𝑓𝑛) / 𝑘𝐵 = (𝑓𝑗) / 𝑘𝐵)
112109, 111ifbieq1d 3547 . . . . . . . . . . . . . . . . . . . 20 (𝑛 = 𝑗 → if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0) = if(𝑗 ≤ (♯‘𝐴), (𝑓𝑗) / 𝑘𝐵, 0))
113112cbvmptv 4083 . . . . . . . . . . . . . . . . . . 19 (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (𝑓𝑛) / 𝑘𝐵, 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (𝑓𝑗) / 𝑘𝐵, 0))
11438, 113eqtri 2191 . . . . . . . . . . . . . . . . . 18 𝐺 = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (𝑓𝑗) / 𝑘𝐵, 0))
115 breq1 3990 . . . . . . . . . . . . . . . . . . . 20 (𝑎 = 𝑗 → (𝑎𝑛𝑗𝑛))
116 fveq2 5494 . . . . . . . . . . . . . . . . . . . . 21 (𝑎 = 𝑗 → (𝑔𝑎) = (𝑔𝑗))
117116csbeq1d 3056 . . . . . . . . . . . . . . . . . . . 20 (𝑎 = 𝑗(𝑔𝑎) / 𝑘𝐵 = (𝑔𝑗) / 𝑘𝐵)
118115, 117ifbieq1d 3547 . . . . . . . . . . . . . . . . . . 19 (𝑎 = 𝑗 → if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0) = if(𝑗𝑛, (𝑔𝑗) / 𝑘𝐵, 0))
119118cbvmptv 4083 . . . . . . . . . . . . . . . . . 18 (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)) = (𝑗 ∈ ℕ ↦ if(𝑗𝑛, (𝑔𝑗) / 𝑘𝐵, 0))
12010, 102, 104, 108, 78, 114, 119summodclem3 11336 . . . . . . . . . . . . . . . . 17 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (seq1( + , 𝐺)‘(♯‘𝐴)) = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))
121100, 120eqtrd 2203 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → (seq1( + , 𝐺)‘𝑚) = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))
122 eqeq12 2183 . . . . . . . . . . . . . . . 16 ((𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)) → (𝑥 = 𝑦 ↔ (seq1( + , 𝐺)‘𝑚) = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)))
123121, 122syl5ibrcom 156 . . . . . . . . . . . . . . 15 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → ((𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎𝑛, (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)) → 𝑥 = 𝑦))
12490, 123sylbid 149 . . . . . . . . . . . . . 14 (((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) ∧ (𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴)) → ((𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)) → 𝑥 = 𝑦))
125124expimpd 361 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → (((𝑓:(1...𝑚)–1-1-onto𝐴𝑔:(1...𝑛)–1-1-onto𝐴) ∧ (𝑥 = (seq1( + , 𝐺)‘𝑚) ∧ 𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) → 𝑥 = 𝑦))
12673, 125syl5bi 151 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → (((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) → 𝑥 = 𝑦))
127126exlimdvv 1890 . . . . . . . . . . 11 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → (∃𝑓𝑔((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ (𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) → 𝑥 = 𝑦))
12872, 127syl5bir 152 . . . . . . . . . 10 ((𝜑 ∧ (𝑚 ∈ ℕ ∧ 𝑛 ∈ ℕ)) → ((∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) → 𝑥 = 𝑦))
129128rexlimdvva 2595 . . . . . . . . 9 (𝜑 → (∃𝑚 ∈ ℕ ∃𝑛 ∈ ℕ (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) → 𝑥 = 𝑦))
13071, 129syl5bir 152 . . . . . . . 8 (𝜑 → ((∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ∧ ∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛))) → 𝑥 = 𝑦))
131130expdimp 257 . . . . . . 7 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → (∃𝑛 ∈ ℕ ∃𝑔(𝑔:(1...𝑛)–1-1-onto𝐴𝑦 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (𝑔𝑎) / 𝑘𝐵, 0)))‘𝑛)) → 𝑥 = 𝑦))
13270, 131syl5bi 151 . . . . . 6 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)) → 𝑥 = 𝑦))
13344, 132jaod 712 . . . . 5 ((𝜑 ∧ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))) → 𝑥 = 𝑦))
13440, 133jaodan 792 . . . 4 ((𝜑 ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)))) → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))) → 𝑥 = 𝑦))
135134expimpd 361 . . 3 (𝜑 → (((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))) → 𝑥 = 𝑦))
136135alrimivv 1868 . 2 (𝜑 → ∀𝑥𝑦(((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))) → 𝑥 = 𝑦))
137 breq2 3991 . . . . . 6 (𝑥 = 𝑦 → (seq𝑚( + , 𝐹) ⇝ 𝑥 ↔ seq𝑚( + , 𝐹) ⇝ 𝑦))
1381373anbi3d 1313 . . . . 5 (𝑥 = 𝑦 → ((𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ↔ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)))
139138rexbidv 2471 . . . 4 (𝑥 = 𝑦 → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ↔ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦)))
140 eqeq1 2177 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = (seq1( + , 𝐺)‘𝑚) ↔ 𝑦 = (seq1( + , 𝐺)‘𝑚)))
141140anbi2d 461 . . . . . 6 (𝑥 = 𝑦 → ((𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))))
142141exbidv 1818 . . . . 5 (𝑥 = 𝑦 → (∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))))
143142rexbidv 2471 . . . 4 (𝑥 = 𝑦 → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚))))
144139, 143orbi12d 788 . . 3 (𝑥 = 𝑦 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))))
145144mo4 2080 . 2 (∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ↔ ∀𝑥𝑦(((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))) ∧ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑦) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑦 = (seq1( + , 𝐺)‘𝑚)))) → 𝑥 = 𝑦))
146136, 145sylibr 133 1 (𝜑 → ∃*𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , 𝐹) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , 𝐺)‘𝑚))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wo 703  DECID wdc 829  w3a 973  wal 1346   = wceq 1348  wex 1485  ∃*wmo 2020  wcel 2141  wral 2448  wrex 2449  csb 3049  wss 3121  ifcif 3525   class class class wbr 3987  cmpt 4048  1-1-ontowf1o 5195  cfv 5196  (class class class)co 5851  cc 7765  0cc0 7767  1c1 7768   + caddc 7770  cle 7948  cn 8871  0cn0 9128  cz 9205  cuz 9480  ...cfz 9958  seqcseq 10394  chash 10702  cli 11234
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4102  ax-sep 4105  ax-nul 4113  ax-pow 4158  ax-pr 4192  ax-un 4416  ax-setind 4519  ax-iinf 4570  ax-cnex 7858  ax-resscn 7859  ax-1cn 7860  ax-1re 7861  ax-icn 7862  ax-addcl 7863  ax-addrcl 7864  ax-mulcl 7865  ax-mulrcl 7866  ax-addcom 7867  ax-mulcom 7868  ax-addass 7869  ax-mulass 7870  ax-distr 7871  ax-i2m1 7872  ax-0lt1 7873  ax-1rid 7874  ax-0id 7875  ax-rnegex 7876  ax-precex 7877  ax-cnre 7878  ax-pre-ltirr 7879  ax-pre-ltwlin 7880  ax-pre-lttrn 7881  ax-pre-apti 7882  ax-pre-ltadd 7883  ax-pre-mulgt0 7884  ax-pre-mulext 7885  ax-arch 7886  ax-caucvg 7887
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3526  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-int 3830  df-iun 3873  df-br 3988  df-opab 4049  df-mpt 4050  df-tr 4086  df-id 4276  df-po 4279  df-iso 4280  df-iord 4349  df-on 4351  df-ilim 4352  df-suc 4354  df-iom 4573  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-rn 4620  df-res 4621  df-ima 4622  df-iota 5158  df-fun 5198  df-fn 5199  df-f 5200  df-f1 5201  df-fo 5202  df-f1o 5203  df-fv 5204  df-isom 5205  df-riota 5807  df-ov 5854  df-oprab 5855  df-mpo 5856  df-1st 6117  df-2nd 6118  df-recs 6282  df-irdg 6347  df-frec 6368  df-1o 6393  df-oadd 6397  df-er 6511  df-en 6717  df-dom 6718  df-fin 6719  df-pnf 7949  df-mnf 7950  df-xr 7951  df-ltxr 7952  df-le 7953  df-sub 8085  df-neg 8086  df-reap 8487  df-ap 8494  df-div 8583  df-inn 8872  df-2 8930  df-3 8931  df-4 8932  df-n0 9129  df-z 9206  df-uz 9481  df-q 9572  df-rp 9604  df-fz 9959  df-fzo 10092  df-seqfrec 10395  df-exp 10469  df-ihash 10703  df-cj 10799  df-re 10800  df-im 10801  df-rsqrt 10955  df-abs 10956  df-clim 11235
This theorem is referenced by:  fsum3  11343
  Copyright terms: Public domain W3C validator