![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > sumtp | GIF version |
Description: A sum over a triple is the sum of the elements. (Contributed by AV, 24-Jul-2020.) |
Ref | Expression |
---|---|
sumtp.e | ⊢ (𝑘 = 𝐴 → 𝐷 = 𝐸) |
sumtp.f | ⊢ (𝑘 = 𝐵 → 𝐷 = 𝐹) |
sumtp.g | ⊢ (𝑘 = 𝐶 → 𝐷 = 𝐺) |
sumtp.c | ⊢ (𝜑 → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ)) |
sumtp.v | ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋)) |
sumtp.1 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
sumtp.2 | ⊢ (𝜑 → 𝐴 ≠ 𝐶) |
sumtp.3 | ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
Ref | Expression |
---|---|
sumtp | ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 = ((𝐸 + 𝐹) + 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sumtp.2 | . . . . . 6 ⊢ (𝜑 → 𝐴 ≠ 𝐶) | |
2 | 1 | necomd 2446 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
3 | sumtp.3 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
4 | 3 | necomd 2446 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
5 | 2, 4 | nelprd 3633 | . . . 4 ⊢ (𝜑 → ¬ 𝐶 ∈ {𝐴, 𝐵}) |
6 | disjsn 3669 | . . . 4 ⊢ (({𝐴, 𝐵} ∩ {𝐶}) = ∅ ↔ ¬ 𝐶 ∈ {𝐴, 𝐵}) | |
7 | 5, 6 | sylibr 134 | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ∩ {𝐶}) = ∅) |
8 | df-tp 3615 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
9 | 8 | a1i 9 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})) |
10 | sumtp.v | . . . . 5 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋)) | |
11 | 10 | simp1d 1011 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
12 | 10 | simp2d 1012 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
13 | 10 | simp3d 1013 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑋) |
14 | sumtp.1 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
15 | 11, 12, 13, 14, 1, 3 | tpfidisj 6945 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} ∈ Fin) |
16 | sumtp.c | . . . . 5 ⊢ (𝜑 → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ)) | |
17 | sumtp.e | . . . . . . . 8 ⊢ (𝑘 = 𝐴 → 𝐷 = 𝐸) | |
18 | 17 | eleq1d 2258 | . . . . . . 7 ⊢ (𝑘 = 𝐴 → (𝐷 ∈ ℂ ↔ 𝐸 ∈ ℂ)) |
19 | sumtp.f | . . . . . . . 8 ⊢ (𝑘 = 𝐵 → 𝐷 = 𝐹) | |
20 | 19 | eleq1d 2258 | . . . . . . 7 ⊢ (𝑘 = 𝐵 → (𝐷 ∈ ℂ ↔ 𝐹 ∈ ℂ)) |
21 | sumtp.g | . . . . . . . 8 ⊢ (𝑘 = 𝐶 → 𝐷 = 𝐺) | |
22 | 21 | eleq1d 2258 | . . . . . . 7 ⊢ (𝑘 = 𝐶 → (𝐷 ∈ ℂ ↔ 𝐺 ∈ ℂ)) |
23 | 18, 20, 22 | raltpg 3660 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ ↔ (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ))) |
24 | 10, 23 | syl 14 | . . . . 5 ⊢ (𝜑 → (∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ ↔ (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ))) |
25 | 16, 24 | mpbird 167 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ) |
26 | 25 | r19.21bi 2578 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝐴, 𝐵, 𝐶}) → 𝐷 ∈ ℂ) |
27 | 7, 9, 15, 26 | fsumsplit 11433 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 = (Σ𝑘 ∈ {𝐴, 𝐵}𝐷 + Σ𝑘 ∈ {𝐶}𝐷)) |
28 | 3simpa 996 | . . . . 5 ⊢ ((𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ) → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ)) | |
29 | 16, 28 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ)) |
30 | 3simpa 996 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) | |
31 | 10, 30 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) |
32 | 17, 19, 29, 31, 14 | sumpr 11439 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵}𝐷 = (𝐸 + 𝐹)) |
33 | 16 | simp3d 1013 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ ℂ) |
34 | 21 | sumsn 11437 | . . . 4 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐺 ∈ ℂ) → Σ𝑘 ∈ {𝐶}𝐷 = 𝐺) |
35 | 13, 33, 34 | syl2anc 411 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐶}𝐷 = 𝐺) |
36 | 32, 35 | oveq12d 5909 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ {𝐴, 𝐵}𝐷 + Σ𝑘 ∈ {𝐶}𝐷) = ((𝐸 + 𝐹) + 𝐺)) |
37 | 27, 36 | eqtrd 2222 | 1 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 = ((𝐸 + 𝐹) + 𝐺)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 ≠ wne 2360 ∀wral 2468 ∪ cun 3142 ∩ cin 3143 ∅c0 3437 {csn 3607 {cpr 3608 {ctp 3609 (class class class)co 5891 ℂcc 7827 + caddc 7832 Σcsu 11379 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-setind 4551 ax-iinf 4602 ax-cnex 7920 ax-resscn 7921 ax-1cn 7922 ax-1re 7923 ax-icn 7924 ax-addcl 7925 ax-addrcl 7926 ax-mulcl 7927 ax-mulrcl 7928 ax-addcom 7929 ax-mulcom 7930 ax-addass 7931 ax-mulass 7932 ax-distr 7933 ax-i2m1 7934 ax-0lt1 7935 ax-1rid 7936 ax-0id 7937 ax-rnegex 7938 ax-precex 7939 ax-cnre 7940 ax-pre-ltirr 7941 ax-pre-ltwlin 7942 ax-pre-lttrn 7943 ax-pre-apti 7944 ax-pre-ltadd 7945 ax-pre-mulgt0 7946 ax-pre-mulext 7947 ax-arch 7948 ax-caucvg 7949 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-if 3550 df-pw 3592 df-sn 3613 df-pr 3614 df-tp 3615 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-id 4308 df-po 4311 df-iso 4312 df-iord 4381 df-on 4383 df-ilim 4384 df-suc 4386 df-iom 4605 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-ima 4654 df-iota 5193 df-fun 5233 df-fn 5234 df-f 5235 df-f1 5236 df-fo 5237 df-f1o 5238 df-fv 5239 df-isom 5240 df-riota 5847 df-ov 5894 df-oprab 5895 df-mpo 5896 df-1st 6159 df-2nd 6160 df-recs 6324 df-irdg 6389 df-frec 6410 df-1o 6435 df-oadd 6439 df-er 6553 df-en 6759 df-dom 6760 df-fin 6761 df-pnf 8012 df-mnf 8013 df-xr 8014 df-ltxr 8015 df-le 8016 df-sub 8148 df-neg 8149 df-reap 8550 df-ap 8557 df-div 8648 df-inn 8938 df-2 8996 df-3 8997 df-4 8998 df-n0 9195 df-z 9272 df-uz 9547 df-q 9638 df-rp 9672 df-fz 10027 df-fzo 10161 df-seqfrec 10464 df-exp 10538 df-ihash 10774 df-cj 10869 df-re 10870 df-im 10871 df-rsqrt 11025 df-abs 11026 df-clim 11305 df-sumdc 11380 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |