![]() |
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 2433 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
3 | sumtp.3 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
4 | 3 | necomd 2433 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
5 | 2, 4 | nelprd 3618 | . . . 4 ⊢ (𝜑 → ¬ 𝐶 ∈ {𝐴, 𝐵}) |
6 | disjsn 3654 | . . . 4 ⊢ (({𝐴, 𝐵} ∩ {𝐶}) = ∅ ↔ ¬ 𝐶 ∈ {𝐴, 𝐵}) | |
7 | 5, 6 | sylibr 134 | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ∩ {𝐶}) = ∅) |
8 | df-tp 3600 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
9 | 8 | a1i 9 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})) |
10 | sumtp.v | . . . . 5 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋)) | |
11 | 10 | simp1d 1009 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
12 | 10 | simp2d 1010 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
13 | 10 | simp3d 1011 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑋) |
14 | sumtp.1 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
15 | 11, 12, 13, 14, 1, 3 | tpfidisj 6923 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} ∈ Fin) |
16 | sumtp.c | . . . . 5 ⊢ (𝜑 → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ)) | |
17 | sumtp.e | . . . . . . . 8 ⊢ (𝑘 = 𝐴 → 𝐷 = 𝐸) | |
18 | 17 | eleq1d 2246 | . . . . . . 7 ⊢ (𝑘 = 𝐴 → (𝐷 ∈ ℂ ↔ 𝐸 ∈ ℂ)) |
19 | sumtp.f | . . . . . . . 8 ⊢ (𝑘 = 𝐵 → 𝐷 = 𝐹) | |
20 | 19 | eleq1d 2246 | . . . . . . 7 ⊢ (𝑘 = 𝐵 → (𝐷 ∈ ℂ ↔ 𝐹 ∈ ℂ)) |
21 | sumtp.g | . . . . . . . 8 ⊢ (𝑘 = 𝐶 → 𝐷 = 𝐺) | |
22 | 21 | eleq1d 2246 | . . . . . . 7 ⊢ (𝑘 = 𝐶 → (𝐷 ∈ ℂ ↔ 𝐺 ∈ ℂ)) |
23 | 18, 20, 22 | raltpg 3645 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ ↔ (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ))) |
24 | 10, 23 | syl 14 | . . . . 5 ⊢ (𝜑 → (∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ ↔ (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ))) |
25 | 16, 24 | mpbird 167 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 ∈ ℂ) |
26 | 25 | r19.21bi 2565 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝐴, 𝐵, 𝐶}) → 𝐷 ∈ ℂ) |
27 | 7, 9, 15, 26 | fsumsplit 11407 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 = (Σ𝑘 ∈ {𝐴, 𝐵}𝐷 + Σ𝑘 ∈ {𝐶}𝐷)) |
28 | 3simpa 994 | . . . . 5 ⊢ ((𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ ∧ 𝐺 ∈ ℂ) → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ)) | |
29 | 16, 28 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ)) |
30 | 3simpa 994 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) | |
31 | 10, 30 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) |
32 | 17, 19, 29, 31, 14 | sumpr 11413 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵}𝐷 = (𝐸 + 𝐹)) |
33 | 16 | simp3d 1011 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ ℂ) |
34 | 21 | sumsn 11411 | . . . 4 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐺 ∈ ℂ) → Σ𝑘 ∈ {𝐶}𝐷 = 𝐺) |
35 | 13, 33, 34 | syl2anc 411 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ {𝐶}𝐷 = 𝐺) |
36 | 32, 35 | oveq12d 5889 | . 2 ⊢ (𝜑 → (Σ𝑘 ∈ {𝐴, 𝐵}𝐷 + Σ𝑘 ∈ {𝐶}𝐷) = ((𝐸 + 𝐹) + 𝐺)) |
37 | 27, 36 | eqtrd 2210 | 1 ⊢ (𝜑 → Σ𝑘 ∈ {𝐴, 𝐵, 𝐶}𝐷 = ((𝐸 + 𝐹) + 𝐺)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ≠ wne 2347 ∀wral 2455 ∪ cun 3127 ∩ cin 3128 ∅c0 3422 {csn 3592 {cpr 3593 {ctp 3594 (class class class)co 5871 ℂcc 7805 + caddc 7810 Σcsu 11353 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4117 ax-sep 4120 ax-nul 4128 ax-pow 4173 ax-pr 4208 ax-un 4432 ax-setind 4535 ax-iinf 4586 ax-cnex 7898 ax-resscn 7899 ax-1cn 7900 ax-1re 7901 ax-icn 7902 ax-addcl 7903 ax-addrcl 7904 ax-mulcl 7905 ax-mulrcl 7906 ax-addcom 7907 ax-mulcom 7908 ax-addass 7909 ax-mulass 7910 ax-distr 7911 ax-i2m1 7912 ax-0lt1 7913 ax-1rid 7914 ax-0id 7915 ax-rnegex 7916 ax-precex 7917 ax-cnre 7918 ax-pre-ltirr 7919 ax-pre-ltwlin 7920 ax-pre-lttrn 7921 ax-pre-apti 7922 ax-pre-ltadd 7923 ax-pre-mulgt0 7924 ax-pre-mulext 7925 ax-arch 7926 ax-caucvg 7927 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-tp 3600 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4003 df-opab 4064 df-mpt 4065 df-tr 4101 df-id 4292 df-po 4295 df-iso 4296 df-iord 4365 df-on 4367 df-ilim 4368 df-suc 4370 df-iom 4589 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-rn 4636 df-res 4637 df-ima 4638 df-iota 5176 df-fun 5216 df-fn 5217 df-f 5218 df-f1 5219 df-fo 5220 df-f1o 5221 df-fv 5222 df-isom 5223 df-riota 5827 df-ov 5874 df-oprab 5875 df-mpo 5876 df-1st 6137 df-2nd 6138 df-recs 6302 df-irdg 6367 df-frec 6388 df-1o 6413 df-oadd 6417 df-er 6531 df-en 6737 df-dom 6738 df-fin 6739 df-pnf 7989 df-mnf 7990 df-xr 7991 df-ltxr 7992 df-le 7993 df-sub 8125 df-neg 8126 df-reap 8527 df-ap 8534 df-div 8625 df-inn 8915 df-2 8973 df-3 8974 df-4 8975 df-n0 9172 df-z 9249 df-uz 9524 df-q 9615 df-rp 9649 df-fz 10004 df-fzo 10137 df-seqfrec 10440 df-exp 10514 df-ihash 10748 df-cj 10843 df-re 10844 df-im 10845 df-rsqrt 10999 df-abs 11000 df-clim 11279 df-sumdc 11354 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |