![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sumpair | Structured version Visualization version GIF version |
Description: Sum of two distinct complex values. The class expression for 𝐴 and 𝐵 normally contain free variable 𝑘 to index it. (Contributed by Glauco Siliprandi, 20-Apr-2017.) |
Ref | Expression |
---|---|
sumpair.1 | ⊢ (𝜑 → Ⅎ𝑘𝐷) |
sumpair.3 | ⊢ (𝜑 → Ⅎ𝑘𝐸) |
sumupair.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
sumupair.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
sumupair.3 | ⊢ (𝜑 → 𝐷 ∈ ℂ) |
sumupair.4 | ⊢ (𝜑 → 𝐸 ∈ ℂ) |
sumupair.5 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
sumupair.8 | ⊢ ((𝜑 ∧ 𝑘 = 𝐴) → 𝐶 = 𝐷) |
sumupair.9 | ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐶 = 𝐸) |
Ref | Expression |
---|---|
sumpair | ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵}𝐶 = (𝐷 + 𝐸)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sumupair.5 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
2 | disjsn2 4479 | . . . 4 ⊢ (𝐴 ≠ 𝐵 → ({𝐴} ∩ {𝐵}) = ∅) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ (𝜑 → ({𝐴} ∩ {𝐵}) = ∅) |
4 | df-pr 4401 | . . . 4 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
5 | 4 | a1i 11 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})) |
6 | prfi 8525 | . . . 4 ⊢ {𝐴, 𝐵} ∈ Fin | |
7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵} ∈ Fin) |
8 | elpri 4420 | . . . 4 ⊢ (𝑘 ∈ {𝐴, 𝐵} → (𝑘 = 𝐴 ∨ 𝑘 = 𝐵)) | |
9 | sumupair.8 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝐴) → 𝐶 = 𝐷) | |
10 | sumupair.3 | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
11 | 10 | adantr 474 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝐴) → 𝐷 ∈ ℂ) |
12 | 9, 11 | eqeltrd 2859 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 𝐴) → 𝐶 ∈ ℂ) |
13 | sumupair.9 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐶 = 𝐸) | |
14 | sumupair.4 | . . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ℂ) | |
15 | 14 | adantr 474 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐸 ∈ ℂ) |
16 | 13, 15 | eqeltrd 2859 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 = 𝐵) → 𝐶 ∈ ℂ) |
17 | 12, 16 | jaodan 943 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 = 𝐴 ∨ 𝑘 = 𝐵)) → 𝐶 ∈ ℂ) |
18 | 8, 17 | sylan2 586 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝐴, 𝐵}) → 𝐶 ∈ ℂ) |
19 | 3, 5, 7, 18 | fsumsplit 14887 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵}𝐶 = (Σ𝑘 ∈ {𝐴}𝐶 + Σ𝑘 ∈ {𝐵}𝐶)) |
20 | sumpair.1 | . . . 4 ⊢ (𝜑 → Ⅎ𝑘𝐷) | |
21 | nfv 1957 | . . . 4 ⊢ Ⅎ𝑘𝜑 | |
22 | sumupair.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
23 | 20, 21, 9, 22, 10 | sumsnd 40132 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴}𝐶 = 𝐷) |
24 | sumpair.3 | . . . 4 ⊢ (𝜑 → Ⅎ𝑘𝐸) | |
25 | sumupair.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
26 | 24, 21, 13, 25, 14 | sumsnd 40132 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐵}𝐶 = 𝐸) |
27 | 23, 26 | oveq12d 6942 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ {𝐴}𝐶 + Σ𝑘 ∈ {𝐵}𝐶) = (𝐷 + 𝐸)) |
28 | 19, 27 | eqtrd 2814 | 1 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵}𝐶 = (𝐷 + 𝐸)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∨ wo 836 = wceq 1601 ∈ wcel 2107 Ⅎwnfc 2919 ≠ wne 2969 ∪ cun 3790 ∩ cin 3791 ∅c0 4141 {csn 4398 {cpr 4400 (class class class)co 6924 Fincfn 8243 ℂcc 10272 + caddc 10277 Σcsu 14833 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5008 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 ax-inf2 8837 ax-cnex 10330 ax-resscn 10331 ax-1cn 10332 ax-icn 10333 ax-addcl 10334 ax-addrcl 10335 ax-mulcl 10336 ax-mulrcl 10337 ax-mulcom 10338 ax-addass 10339 ax-mulass 10340 ax-distr 10341 ax-i2m1 10342 ax-1ne0 10343 ax-1rid 10344 ax-rnegex 10345 ax-rrecex 10346 ax-cnre 10347 ax-pre-lttri 10348 ax-pre-lttrn 10349 ax-pre-ltadd 10350 ax-pre-mulgt0 10351 ax-pre-sup 10352 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-fal 1615 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-int 4713 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-se 5317 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-pred 5935 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-isom 6146 df-riota 6885 df-ov 6927 df-oprab 6928 df-mpt2 6929 df-om 7346 df-1st 7447 df-2nd 7448 df-wrecs 7691 df-recs 7753 df-rdg 7791 df-1o 7845 df-oadd 7849 df-er 8028 df-en 8244 df-dom 8245 df-sdom 8246 df-fin 8247 df-sup 8638 df-oi 8706 df-card 9100 df-pnf 10415 df-mnf 10416 df-xr 10417 df-ltxr 10418 df-le 10419 df-sub 10610 df-neg 10611 df-div 11036 df-nn 11380 df-2 11443 df-3 11444 df-n0 11648 df-z 11734 df-uz 11998 df-rp 12143 df-fz 12649 df-fzo 12790 df-seq 13125 df-exp 13184 df-hash 13442 df-cj 14252 df-re 14253 df-im 14254 df-sqrt 14388 df-abs 14389 df-clim 14636 df-sum 14834 |
This theorem is referenced by: refsum2cnlem1 40143 |
Copyright terms: Public domain | W3C validator |