![]() |
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 2450 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
3 | sumtp.3 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
4 | 3 | necomd 2450 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
5 | 2, 4 | nelprd 3645 | . . . 4 ⊢ (𝜑 → ¬ 𝐶 ∈ {𝐴, 𝐵}) |
6 | disjsn 3681 | . . . 4 ⊢ (({𝐴, 𝐵} ∩ {𝐶}) = ∅ ↔ ¬ 𝐶 ∈ {𝐴, 𝐵}) | |
7 | 5, 6 | sylibr 134 | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ∩ {𝐶}) = ∅) |
8 | df-tp 3627 | . . . 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 6986 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} ∈ Fin) |
16 | sumtp.c | . . . . 5 ⊢ (𝜑 → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ)) | |
17 | sumtp.e | . . . . . . . 8 ⊢ (𝑘 = 𝐴 → 𝐷 = 𝐸) | |
18 | 17 | eleq1d 2262 | . . . . . . 7 ⊢ (𝑘 = 𝐴 → (𝐷 ∈ ℂ ↔ 𝐸 ∈ ℂ)) |
19 | sumtp.f | . . . . . . . 8 ⊢ (𝑘 = 𝐵 → 𝐷 = 𝐹) | |
20 | 19 | eleq1d 2262 | . . . . . . 7 ⊢ (𝑘 = 𝐵 → (𝐷 ∈ ℂ ↔ 𝐹 ∈ ℂ)) |
21 | sumtp.g | . . . . . . . 8 ⊢ (𝑘 = 𝐶 → 𝐷 = 𝐺) | |
22 | 21 | eleq1d 2262 | . . . . . . 7 ⊢ (𝑘 = 𝐶 → (𝐷 ∈ ℂ ↔ 𝐺 ∈ ℂ)) |
23 | 18, 20, 22 | raltpg 3672 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ ↔ (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ))) |
24 | 10, 23 | syl 14 | . . . . 5 ⊢ (𝜑 → (∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ ↔ (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ))) |
25 | 16, 24 | mpbird 167 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ) |
26 | 25 | r19.21bi 2582 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝐴, 𝐵, 𝐶}) → 𝐷 ∈ ℂ) |
27 | 7, 9, 15, 26 | fsumsplit 11553 | . 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 11559 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵}𝐷 = (𝐸 + 𝐹)) |
33 | 16 | simp3d 1013 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ ℂ) |
34 | 21 | sumsn 11557 | . . . 4 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐺 ∈ ℂ) → Σ𝑘 ∈ {𝐶}𝐷 = 𝐺) |
35 | 13, 33, 34 | syl2anc 411 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐶}𝐷 = 𝐺) |
36 | 32, 35 | oveq12d 5937 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ {𝐴, 𝐵}𝐷 + Σ𝑘 ∈ {𝐶}𝐷) = ((𝐸 + 𝐹) + 𝐺)) |
37 | 27, 36 | eqtrd 2226 | 1 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 = ((𝐸 + 𝐹) + 𝐺)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 ∀wral 2472 ∪ cun 3152 ∩ cin 3153 ∅c0 3447 {csn 3619 {cpr 3620 {ctp 3621 (class class class)co 5919 ℂcc 7872 + caddc 7877 Σcsu 11499 |
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 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 ax-arch 7993 ax-caucvg 7994 |
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 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-tp 3627 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-po 4328 df-iso 4329 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-isom 5264 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-irdg 6425 df-frec 6446 df-1o 6471 df-oadd 6475 df-er 6589 df-en 6797 df-dom 6798 df-fin 6799 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-2 9043 df-3 9044 df-4 9045 df-n0 9244 df-z 9321 df-uz 9596 df-q 9688 df-rp 9723 df-fz 10078 df-fzo 10212 df-seqfrec 10522 df-exp 10613 df-ihash 10850 df-cj 10989 df-re 10990 df-im 10991 df-rsqrt 11145 df-abs 11146 df-clim 11425 df-sumdc 11500 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |