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

Theorem fsumcl2lem 10755
Description: - Lemma for finite sum closures. (The "-" before "Lemma" forces the math content to be displayed in the Statement List - NM 11-Feb-2008.) (Contributed by Mario Carneiro, 3-Jun-2014.)
Hypotheses
Ref Expression
fsumcllem.1 (𝜑𝑆 ⊆ ℂ)
fsumcllem.2 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
fsumcllem.3 (𝜑𝐴 ∈ Fin)
fsumcllem.4 ((𝜑𝑘𝐴) → 𝐵𝑆)
fsumcl2lem.5 (𝜑𝐴 ≠ ∅)
Assertion
Ref Expression
fsumcl2lem (𝜑 → Σ𝑘𝐴 𝐵𝑆)
Distinct variable groups:   𝐴,𝑘,𝑥,𝑦   𝑥,𝐵,𝑦   𝑆,𝑘,𝑥,𝑦   𝜑,𝑘,𝑥,𝑦
Allowed substitution hint:   𝐵(𝑘)

Proof of Theorem fsumcl2lem
Dummy variables 𝑎 𝑓 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fsumcl2lem.5 . . . 4 (𝜑𝐴 ≠ ∅)
21neneqd 2276 . . 3 (𝜑 → ¬ 𝐴 = ∅)
32pm2.21d 584 . 2 (𝜑 → (𝐴 = ∅ → Σ𝑘𝐴 𝐵𝑆))
4 fsumcllem.1 . . . . . . . . . . . 12 (𝜑𝑆 ⊆ ℂ)
54adantr 270 . . . . . . . . . . 11 ((𝜑𝑘𝐴) → 𝑆 ⊆ ℂ)
6 fsumcllem.4 . . . . . . . . . . 11 ((𝜑𝑘𝐴) → 𝐵𝑆)
75, 6sseldd 3024 . . . . . . . . . 10 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
87ralrimiva 2446 . . . . . . . . 9 (𝜑 → ∀𝑘𝐴 𝐵 ∈ ℂ)
9 sumfct 10727 . . . . . . . . 9 (∀𝑘𝐴 𝐵 ∈ ℂ → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = Σ𝑘𝐴 𝐵)
108, 9syl 14 . . . . . . . 8 (𝜑 → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = Σ𝑘𝐴 𝐵)
1110adantr 270 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = Σ𝑘𝐴 𝐵)
12 fveq2 5289 . . . . . . . 8 (𝑚 = (𝑓𝑎) → ((𝑘𝐴𝐵)‘𝑚) = ((𝑘𝐴𝐵)‘(𝑓𝑎)))
13 simprl 498 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (♯‘𝐴) ∈ ℕ)
14 simprr 499 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)
154ad2antrr 472 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → 𝑆 ⊆ ℂ)
166fmpttd 5437 . . . . . . . . . . 11 (𝜑 → (𝑘𝐴𝐵):𝐴𝑆)
1716adantr 270 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐵):𝐴𝑆)
1817ffvelrnda 5418 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐵)‘𝑚) ∈ 𝑆)
1915, 18sseldd 3024 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐵)‘𝑚) ∈ ℂ)
20 f1of 5237 . . . . . . . . . 10 (𝑓:(1...(♯‘𝐴))–1-1-onto𝐴𝑓:(1...(♯‘𝐴))⟶𝐴)
2114, 20syl 14 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
22 fvco3 5359 . . . . . . . . 9 ((𝑓:(1...(♯‘𝐴))⟶𝐴𝑎 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎) = ((𝑘𝐴𝐵)‘(𝑓𝑎)))
2321, 22sylan 277 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑎 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎) = ((𝑘𝐴𝐵)‘(𝑓𝑎)))
2412, 13, 14, 19, 23fsum3 10743 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)))‘(♯‘𝐴)))
2511, 24eqtr3d 2122 . . . . . 6 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑘𝐴 𝐵 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)))‘(♯‘𝐴)))
26 nnuz 9023 . . . . . . . 8 ℕ = (ℤ‘1)
2713, 26syl6eleq 2180 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (♯‘𝐴) ∈ (ℤ‘1))
28 elnnuz 9024 . . . . . . . . . . 11 (𝑥 ∈ ℕ ↔ 𝑥 ∈ (ℤ‘1))
2928biimpri 131 . . . . . . . . . 10 (𝑥 ∈ (ℤ‘1) → 𝑥 ∈ ℕ)
3029adantl 271 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → 𝑥 ∈ ℕ)
314ad3antrrr 476 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑆 ⊆ ℂ)
3217ad2antrr 472 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (𝑘𝐴𝐵):𝐴𝑆)
3321ad2antrr 472 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
34 fco 5161 . . . . . . . . . . . . . 14 (((𝑘𝐴𝐵):𝐴𝑆𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶𝑆)
3532, 33, 34syl2anc 403 . . . . . . . . . . . . 13 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶𝑆)
36 1zzd 8747 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
3713ad2antrr 472 . . . . . . . . . . . . . . . 16 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
3837nnzd 8837 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
39 simpr 108 . . . . . . . . . . . . . . . . 17 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℕ)
4039adantr 270 . . . . . . . . . . . . . . . 16 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ ℕ)
4140nnzd 8837 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ ℤ)
4236, 38, 413jca 1123 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑥 ∈ ℤ))
4340nnge1d 8436 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ≤ 𝑥)
44 simpr 108 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ≤ (♯‘𝐴))
4543, 44jca 300 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ≤ 𝑥𝑥 ≤ (♯‘𝐴)))
46 elfz2 9400 . . . . . . . . . . . . . 14 (𝑥 ∈ (1...(♯‘𝐴)) ↔ ((1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑥 ∈ ℤ) ∧ (1 ≤ 𝑥𝑥 ≤ (♯‘𝐴))))
4742, 45, 46sylanbrc 408 . . . . . . . . . . . . 13 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ (1...(♯‘𝐴)))
4835, 47ffvelrnd 5419 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ 𝑆)
4931, 48sseldd 3024 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ ℂ)
50 0cnd 7460 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ≤ (♯‘𝐴)) → 0 ∈ ℂ)
5139nnzd 8837 . . . . . . . . . . . 12 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℤ)
5213adantr 270 . . . . . . . . . . . . 13 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → (♯‘𝐴) ∈ ℕ)
5352nnzd 8837 . . . . . . . . . . . 12 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → (♯‘𝐴) ∈ ℤ)
54 zdcle 8793 . . . . . . . . . . . 12 ((𝑥 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑥 ≤ (♯‘𝐴))
5551, 53, 54syl2anc 403 . . . . . . . . . . 11 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → DECID 𝑥 ≤ (♯‘𝐴))
5649, 50, 55ifcldadc 3416 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ)
5730, 56syldan 276 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ)
58 breq1 3840 . . . . . . . . . . 11 (𝑎 = 𝑥 → (𝑎 ≤ (♯‘𝐴) ↔ 𝑥 ≤ (♯‘𝐴)))
59 fveq2 5289 . . . . . . . . . . 11 (𝑎 = 𝑥 → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎) = (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥))
6058, 59ifbieq1d 3409 . . . . . . . . . 10 (𝑎 = 𝑥 → if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
61 eqid 2088 . . . . . . . . . 10 (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)) = (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))
6260, 61fvmptg 5364 . . . . . . . . 9 ((𝑥 ∈ ℕ ∧ if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
6330, 57, 62syl2anc 403 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
644adantr 270 . . . . . . . . . . . . 13 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑆 ⊆ ℂ)
6517, 64fssd 5158 . . . . . . . . . . . 12 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐵):𝐴⟶ℂ)
6665ad2antrr 472 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (𝑘𝐴𝐵):𝐴⟶ℂ)
6721ad2antrr 472 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
68 fco 5161 . . . . . . . . . . 11 (((𝑘𝐴𝐵):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
6966, 67, 68syl2anc 403 . . . . . . . . . 10 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
70 1zzd 8747 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
7113ad2antrr 472 . . . . . . . . . . . . 13 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
7271nnzd 8837 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
73 eluzelz 8997 . . . . . . . . . . . . 13 (𝑥 ∈ (ℤ‘1) → 𝑥 ∈ ℤ)
7473ad2antlr 473 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ ℤ)
7570, 72, 743jca 1123 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑥 ∈ ℤ))
7629nnge1d 8436 . . . . . . . . . . . . 13 (𝑥 ∈ (ℤ‘1) → 1 ≤ 𝑥)
7776ad2antlr 473 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ≤ 𝑥)
78 simpr 108 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ≤ (♯‘𝐴))
7977, 78jca 300 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ≤ 𝑥𝑥 ≤ (♯‘𝐴)))
8075, 79, 46sylanbrc 408 . . . . . . . . . 10 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ (1...(♯‘𝐴)))
8169, 80ffvelrnd 5419 . . . . . . . . 9 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ ℂ)
82 0cnd 7460 . . . . . . . . 9 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ ¬ 𝑥 ≤ (♯‘𝐴)) → 0 ∈ ℂ)
8330, 55syldan 276 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → DECID 𝑥 ≤ (♯‘𝐴))
8481, 82, 83ifcldadc 3416 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ)
8563, 84eqeltrd 2164 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ ℂ)
86 elfzle2 9411 . . . . . . . . . . 11 (𝑥 ∈ (1...(♯‘𝐴)) → 𝑥 ≤ (♯‘𝐴))
8786adantl 271 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → 𝑥 ≤ (♯‘𝐴))
8887iftrued 3396 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) = (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥))
89 elfznn 9437 . . . . . . . . . . 11 (𝑥 ∈ (1...(♯‘𝐴)) → 𝑥 ∈ ℕ)
9089anim2i 334 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ))
9190, 87, 48syl2anc 403 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ 𝑆)
9288, 91eqeltrd 2164 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ 𝑆)
9339, 56, 62syl2anc 403 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
9493eleq1d 2156 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → (((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ 𝑆 ↔ if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ 𝑆))
9590, 94syl 14 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → (((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ 𝑆 ↔ if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ 𝑆))
9692, 95mpbird 165 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ 𝑆)
97 fsumcllem.2 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
9897adantlr 461 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
99 addcl 7446 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ)
10099adantl 271 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 + 𝑦) ∈ ℂ)
10127, 85, 96, 98, 64, 100seq3clss 9852 . . . . . 6 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)))‘(♯‘𝐴)) ∈ 𝑆)
10225, 101eqeltrd 2164 . . . . 5 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑘𝐴 𝐵𝑆)
103102expr 367 . . . 4 ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto𝐴 → Σ𝑘𝐴 𝐵𝑆))
104103exlimdv 1747 . . 3 ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴 → Σ𝑘𝐴 𝐵𝑆))
105104expimpd 355 . 2 (𝜑 → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴) → Σ𝑘𝐴 𝐵𝑆))
106 fsumcllem.3 . . 3 (𝜑𝐴 ∈ Fin)
107 fz1f1o 10728 . . 3 (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)))
108106, 107syl 14 . 2 (𝜑 → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)))
1093, 105, 108mpjaod 673 1 (𝜑 → Σ𝑘𝐴 𝐵𝑆)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wb 103  wo 664  DECID wdc 780  w3a 924   = wceq 1289  wex 1426  wcel 1438  wne 2255  wral 2359  wss 2997  c0 3284  ifcif 3389   class class class wbr 3837  cmpt 3891  ccom 4432  wf 4998  1-1-ontowf1o 5001  cfv 5002  (class class class)co 5634  Fincfn 6437  cc 7327  0cc0 7329  1c1 7330   + caddc 7332  cle 7502  cn 8394  cz 8720  cuz 8988  ...cfz 9393  seqcseq 9817  chash 10148  Σcsu 10706
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3946  ax-sep 3949  ax-nul 3957  ax-pow 4001  ax-pr 4027  ax-un 4251  ax-setind 4343  ax-iinf 4393  ax-cnex 7415  ax-resscn 7416  ax-1cn 7417  ax-1re 7418  ax-icn 7419  ax-addcl 7420  ax-addrcl 7421  ax-mulcl 7422  ax-mulrcl 7423  ax-addcom 7424  ax-mulcom 7425  ax-addass 7426  ax-mulass 7427  ax-distr 7428  ax-i2m1 7429  ax-0lt1 7430  ax-1rid 7431  ax-0id 7432  ax-rnegex 7433  ax-precex 7434  ax-cnre 7435  ax-pre-ltirr 7436  ax-pre-ltwlin 7437  ax-pre-lttrn 7438  ax-pre-apti 7439  ax-pre-ltadd 7440  ax-pre-mulgt0 7441  ax-pre-mulext 7442  ax-arch 7443  ax-caucvg 7444
This theorem depends on definitions:  df-bi 115  df-dc 781  df-3or 925  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-nel 2351  df-ral 2364  df-rex 2365  df-reu 2366  df-rmo 2367  df-rab 2368  df-v 2621  df-sbc 2839  df-csb 2932  df-dif 2999  df-un 3001  df-in 3003  df-ss 3010  df-nul 3285  df-if 3390  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450  df-uni 3649  df-int 3684  df-iun 3727  df-br 3838  df-opab 3892  df-mpt 3893  df-tr 3929  df-id 4111  df-po 4114  df-iso 4115  df-iord 4184  df-on 4186  df-ilim 4187  df-suc 4189  df-iom 4396  df-xp 4434  df-rel 4435  df-cnv 4436  df-co 4437  df-dm 4438  df-rn 4439  df-res 4440  df-ima 4441  df-iota 4967  df-fun 5004  df-fn 5005  df-f 5006  df-f1 5007  df-fo 5008  df-f1o 5009  df-fv 5010  df-isom 5011  df-riota 5590  df-ov 5637  df-oprab 5638  df-mpt2 5639  df-1st 5893  df-2nd 5894  df-recs 6052  df-irdg 6117  df-frec 6138  df-1o 6163  df-oadd 6167  df-er 6272  df-en 6438  df-dom 6439  df-fin 6440  df-pnf 7503  df-mnf 7504  df-xr 7505  df-ltxr 7506  df-le 7507  df-sub 7634  df-neg 7635  df-reap 8028  df-ap 8035  df-div 8114  df-inn 8395  df-2 8452  df-3 8453  df-4 8454  df-n0 8644  df-z 8721  df-uz 8989  df-q 9074  df-rp 9104  df-fz 9394  df-fzo 9519  df-iseq 9818  df-seq3 9819  df-exp 9920  df-ihash 10149  df-cj 10241  df-re 10242  df-im 10243  df-rsqrt 10396  df-abs 10397  df-clim 10631  df-isum 10707
This theorem is referenced by:  fsumcllem  10756  fsumrpcl  10761
  Copyright terms: Public domain W3C validator