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

Theorem fsumcl2lem 11118
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 2304 . . 3 (𝜑 → ¬ 𝐴 = ∅)
32pm2.21d 591 . 2 (𝜑 → (𝐴 = ∅ → Σ𝑘𝐴 𝐵𝑆))
4 fsumcllem.1 . . . . . . . . . . . 12 (𝜑𝑆 ⊆ ℂ)
54adantr 272 . . . . . . . . . . 11 ((𝜑𝑘𝐴) → 𝑆 ⊆ ℂ)
6 fsumcllem.4 . . . . . . . . . . 11 ((𝜑𝑘𝐴) → 𝐵𝑆)
75, 6sseldd 3066 . . . . . . . . . 10 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
87ralrimiva 2480 . . . . . . . . 9 (𝜑 → ∀𝑘𝐴 𝐵 ∈ ℂ)
9 sumfct 11094 . . . . . . . . 9 (∀𝑘𝐴 𝐵 ∈ ℂ → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = Σ𝑘𝐴 𝐵)
108, 9syl 14 . . . . . . . 8 (𝜑 → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = Σ𝑘𝐴 𝐵)
1110adantr 272 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = Σ𝑘𝐴 𝐵)
12 fveq2 5387 . . . . . . . 8 (𝑚 = (𝑓𝑎) → ((𝑘𝐴𝐵)‘𝑚) = ((𝑘𝐴𝐵)‘(𝑓𝑎)))
13 simprl 503 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (♯‘𝐴) ∈ ℕ)
14 simprr 504 . . . . . . . 8 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)
154ad2antrr 477 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → 𝑆 ⊆ ℂ)
166fmpttd 5541 . . . . . . . . . . 11 (𝜑 → (𝑘𝐴𝐵):𝐴𝑆)
1716adantr 272 . . . . . . . . . 10 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐵):𝐴𝑆)
1817ffvelrnda 5521 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐵)‘𝑚) ∈ 𝑆)
1915, 18sseldd 3066 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐵)‘𝑚) ∈ ℂ)
20 f1of 5333 . . . . . . . . . 10 (𝑓:(1...(♯‘𝐴))–1-1-onto𝐴𝑓:(1...(♯‘𝐴))⟶𝐴)
2114, 20syl 14 . . . . . . . . 9 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
22 fvco3 5458 . . . . . . . . 9 ((𝑓:(1...(♯‘𝐴))⟶𝐴𝑎 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎) = ((𝑘𝐴𝐵)‘(𝑓𝑎)))
2321, 22sylan 279 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑎 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎) = ((𝑘𝐴𝐵)‘(𝑓𝑎)))
2412, 13, 14, 19, 23fsum3 11107 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)))‘(♯‘𝐴)))
2511, 24eqtr3d 2150 . . . . . 6 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑘𝐴 𝐵 = (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)))‘(♯‘𝐴)))
26 nnuz 9313 . . . . . . . 8 ℕ = (ℤ‘1)
2713, 26syl6eleq 2208 . . . . . . 7 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (♯‘𝐴) ∈ (ℤ‘1))
28 elnnuz 9314 . . . . . . . . . . 11 (𝑥 ∈ ℕ ↔ 𝑥 ∈ (ℤ‘1))
2928biimpri 132 . . . . . . . . . 10 (𝑥 ∈ (ℤ‘1) → 𝑥 ∈ ℕ)
3029adantl 273 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → 𝑥 ∈ ℕ)
314ad3antrrr 481 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑆 ⊆ ℂ)
3217ad2antrr 477 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (𝑘𝐴𝐵):𝐴𝑆)
3321ad2antrr 477 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
34 fco 5256 . . . . . . . . . . . . . 14 (((𝑘𝐴𝐵):𝐴𝑆𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶𝑆)
3532, 33, 34syl2anc 406 . . . . . . . . . . . . 13 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶𝑆)
36 1zzd 9035 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
3713ad2antrr 477 . . . . . . . . . . . . . . . 16 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
3837nnzd 9126 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
39 simpr 109 . . . . . . . . . . . . . . . . 17 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℕ)
4039adantr 272 . . . . . . . . . . . . . . . 16 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ ℕ)
4140nnzd 9126 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ ℤ)
4236, 38, 413jca 1144 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑥 ∈ ℤ))
4340nnge1d 8723 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ≤ 𝑥)
44 simpr 109 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ≤ (♯‘𝐴))
4543, 44jca 302 . . . . . . . . . . . . . 14 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ≤ 𝑥𝑥 ≤ (♯‘𝐴)))
46 elfz2 9748 . . . . . . . . . . . . . 14 (𝑥 ∈ (1...(♯‘𝐴)) ↔ ((1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑥 ∈ ℤ) ∧ (1 ≤ 𝑥𝑥 ≤ (♯‘𝐴))))
4742, 45, 46sylanbrc 411 . . . . . . . . . . . . 13 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ (1...(♯‘𝐴)))
4835, 47ffvelrnd 5522 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ 𝑆)
4931, 48sseldd 3066 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ 𝑥 ≤ (♯‘𝐴)) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ ℂ)
50 0cnd 7723 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) ∧ ¬ 𝑥 ≤ (♯‘𝐴)) → 0 ∈ ℂ)
5139nnzd 9126 . . . . . . . . . . . 12 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℤ)
5213adantr 272 . . . . . . . . . . . . 13 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → (♯‘𝐴) ∈ ℕ)
5352nnzd 9126 . . . . . . . . . . . 12 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → (♯‘𝐴) ∈ ℤ)
54 zdcle 9081 . . . . . . . . . . . 12 ((𝑥 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑥 ≤ (♯‘𝐴))
5551, 53, 54syl2anc 406 . . . . . . . . . . 11 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → DECID 𝑥 ≤ (♯‘𝐴))
5649, 50, 55ifcldadc 3469 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ)
5730, 56syldan 278 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ)
58 breq1 3900 . . . . . . . . . . 11 (𝑎 = 𝑥 → (𝑎 ≤ (♯‘𝐴) ↔ 𝑥 ≤ (♯‘𝐴)))
59 fveq2 5387 . . . . . . . . . . 11 (𝑎 = 𝑥 → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎) = (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥))
6058, 59ifbieq1d 3462 . . . . . . . . . 10 (𝑎 = 𝑥 → if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
61 eqid 2115 . . . . . . . . . 10 (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)) = (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))
6260, 61fvmptg 5463 . . . . . . . . 9 ((𝑥 ∈ ℕ ∧ if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
6330, 57, 62syl2anc 406 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
644adantr 272 . . . . . . . . . . . . 13 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → 𝑆 ⊆ ℂ)
6517, 64fssd 5253 . . . . . . . . . . . 12 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐵):𝐴⟶ℂ)
6665ad2antrr 477 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (𝑘𝐴𝐵):𝐴⟶ℂ)
6721ad2antrr 477 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
68 fco 5256 . . . . . . . . . . 11 (((𝑘𝐴𝐵):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
6966, 67, 68syl2anc 406 . . . . . . . . . 10 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
70 1zzd 9035 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
7113ad2antrr 477 . . . . . . . . . . . . 13 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
7271nnzd 9126 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
73 eluzelz 9287 . . . . . . . . . . . . 13 (𝑥 ∈ (ℤ‘1) → 𝑥 ∈ ℤ)
7473ad2antlr 478 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ ℤ)
7570, 72, 743jca 1144 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑥 ∈ ℤ))
7629nnge1d 8723 . . . . . . . . . . . . 13 (𝑥 ∈ (ℤ‘1) → 1 ≤ 𝑥)
7776ad2antlr 478 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 1 ≤ 𝑥)
78 simpr 109 . . . . . . . . . . . 12 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ≤ (♯‘𝐴))
7977, 78jca 302 . . . . . . . . . . 11 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (1 ≤ 𝑥𝑥 ≤ (♯‘𝐴)))
8075, 79, 46sylanbrc 411 . . . . . . . . . 10 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → 𝑥 ∈ (1...(♯‘𝐴)))
8169, 80ffvelrnd 5522 . . . . . . . . 9 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ 𝑥 ≤ (♯‘𝐴)) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ ℂ)
82 0cnd 7723 . . . . . . . . 9 ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) ∧ ¬ 𝑥 ≤ (♯‘𝐴)) → 0 ∈ ℂ)
8330, 55syldan 278 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → DECID 𝑥 ≤ (♯‘𝐴))
8481, 82, 83ifcldadc 3469 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ ℂ)
8563, 84eqeltrd 2192 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (ℤ‘1)) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ ℂ)
86 elfzle2 9759 . . . . . . . . . . 11 (𝑥 ∈ (1...(♯‘𝐴)) → 𝑥 ≤ (♯‘𝐴))
8786adantl 273 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → 𝑥 ≤ (♯‘𝐴))
8887iftrued 3449 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) = (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥))
89 elfznn 9785 . . . . . . . . . . 11 (𝑥 ∈ (1...(♯‘𝐴)) → 𝑥 ∈ ℕ)
9089anim2i 337 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ))
9190, 87, 48syl2anc 406 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥) ∈ 𝑆)
9288, 91eqeltrd 2192 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ 𝑆)
9339, 56, 62syl2anc 406 . . . . . . . . . 10 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) = if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0))
9493eleq1d 2184 . . . . . . . . 9 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ ℕ) → (((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ 𝑆 ↔ if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ 𝑆))
9590, 94syl 14 . . . . . . . 8 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → (((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ 𝑆 ↔ if(𝑥 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑥), 0) ∈ 𝑆))
9692, 95mpbird 166 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ 𝑥 ∈ (1...(♯‘𝐴))) → ((𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0))‘𝑥) ∈ 𝑆)
97 fsumcllem.2 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
9897adantlr 466 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
99 addcl 7709 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ)
10099adantl 273 . . . . . . 7 (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 + 𝑦) ∈ ℂ)
10127, 85, 96, 98, 64, 100seq3clss 10191 . . . . . 6 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → (seq1( + , (𝑎 ∈ ℕ ↦ if(𝑎 ≤ (♯‘𝐴), (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑎), 0)))‘(♯‘𝐴)) ∈ 𝑆)
10225, 101eqeltrd 2192 . . . . 5 ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)) → Σ𝑘𝐴 𝐵𝑆)
103102expr 370 . . . 4 ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto𝐴 → Σ𝑘𝐴 𝐵𝑆))
104103exlimdv 1773 . . 3 ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴 → Σ𝑘𝐴 𝐵𝑆))
105104expimpd 358 . 2 (𝜑 → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴) → Σ𝑘𝐴 𝐵𝑆))
106 fsumcllem.3 . . 3 (𝜑𝐴 ∈ Fin)
107 fz1f1o 11095 . . 3 (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)))
108106, 107syl 14 . 2 (𝜑 → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto𝐴)))
1093, 105, 108mpjaod 690 1 (𝜑 → Σ𝑘𝐴 𝐵𝑆)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wo 680  DECID wdc 802  w3a 945   = wceq 1314  wex 1451  wcel 1463  wne 2283  wral 2391  wss 3039  c0 3331  ifcif 3442   class class class wbr 3897  cmpt 3957  ccom 4511  wf 5087  1-1-ontowf1o 5090  cfv 5091  (class class class)co 5740  Fincfn 6600  cc 7582  0cc0 7584  1c1 7585   + caddc 7587  cle 7765  cn 8680  cz 9008  cuz 9278  ...cfz 9741  seqcseq 10169  chash 10472  Σcsu 11073
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 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4011  ax-sep 4014  ax-nul 4022  ax-pow 4066  ax-pr 4099  ax-un 4323  ax-setind 4420  ax-iinf 4470  ax-cnex 7675  ax-resscn 7676  ax-1cn 7677  ax-1re 7678  ax-icn 7679  ax-addcl 7680  ax-addrcl 7681  ax-mulcl 7682  ax-mulrcl 7683  ax-addcom 7684  ax-mulcom 7685  ax-addass 7686  ax-mulass 7687  ax-distr 7688  ax-i2m1 7689  ax-0lt1 7690  ax-1rid 7691  ax-0id 7692  ax-rnegex 7693  ax-precex 7694  ax-cnre 7695  ax-pre-ltirr 7696  ax-pre-ltwlin 7697  ax-pre-lttrn 7698  ax-pre-apti 7699  ax-pre-ltadd 7700  ax-pre-mulgt0 7701  ax-pre-mulext 7702  ax-arch 7703  ax-caucvg 7704
This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ne 2284  df-nel 2379  df-ral 2396  df-rex 2397  df-reu 2398  df-rmo 2399  df-rab 2400  df-v 2660  df-sbc 2881  df-csb 2974  df-dif 3041  df-un 3043  df-in 3045  df-ss 3052  df-nul 3332  df-if 3443  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-int 3740  df-iun 3783  df-br 3898  df-opab 3958  df-mpt 3959  df-tr 3995  df-id 4183  df-po 4186  df-iso 4187  df-iord 4256  df-on 4258  df-ilim 4259  df-suc 4261  df-iom 4473  df-xp 4513  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-rn 4518  df-res 4519  df-ima 4520  df-iota 5056  df-fun 5093  df-fn 5094  df-f 5095  df-f1 5096  df-fo 5097  df-f1o 5098  df-fv 5099  df-isom 5100  df-riota 5696  df-ov 5743  df-oprab 5744  df-mpo 5745  df-1st 6004  df-2nd 6005  df-recs 6168  df-irdg 6233  df-frec 6254  df-1o 6279  df-oadd 6283  df-er 6395  df-en 6601  df-dom 6602  df-fin 6603  df-pnf 7766  df-mnf 7767  df-xr 7768  df-ltxr 7769  df-le 7770  df-sub 7899  df-neg 7900  df-reap 8300  df-ap 8307  df-div 8396  df-inn 8681  df-2 8739  df-3 8740  df-4 8741  df-n0 8932  df-z 9009  df-uz 9279  df-q 9364  df-rp 9394  df-fz 9742  df-fzo 9871  df-seqfrec 10170  df-exp 10244  df-ihash 10473  df-cj 10565  df-re 10566  df-im 10567  df-rsqrt 10721  df-abs 10722  df-clim 10999  df-sumdc 11074
This theorem is referenced by:  fsumcllem  11119  fsumrpcl  11124
  Copyright terms: Public domain W3C validator