| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumcllem | Structured version Visualization version GIF version | ||
| Description: Lemma for gsumcl 20180 and related theorems. (Contributed by Mario Carneiro, 15-Dec-2014.) (Revised by Mario Carneiro, 24-Apr-2016.) (Revised by AV, 31-May-2019.) |
| Ref | Expression |
|---|---|
| gsumcllem.f | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| gsumcllem.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| gsumcllem.z | ⊢ (𝜑 → 𝑍 ∈ 𝑈) |
| gsumcllem.s | ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊) |
| Ref | Expression |
|---|---|
| gsumcllem | ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsumcllem.f | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
| 2 | 1 | feqmptd 6984 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 3 | 2 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 4 | difeq2 4060 | . . . . . . . 8 ⊢ (𝑊 = ∅ → (𝐴 ∖ 𝑊) = (𝐴 ∖ ∅)) | |
| 5 | dif0 4330 | . . . . . . . 8 ⊢ (𝐴 ∖ ∅) = 𝐴 | |
| 6 | 4, 5 | eqtrdi 2814 | . . . . . . 7 ⊢ (𝑊 = ∅ → (𝐴 ∖ 𝑊) = 𝐴) |
| 7 | 6 | eleq2d 2850 | . . . . . 6 ⊢ (𝑊 = ∅ → (𝑘 ∈ (𝐴 ∖ 𝑊) ↔ 𝑘 ∈ 𝐴)) |
| 8 | 7 | biimpar 483 | . . . . 5 ⊢ ((𝑊 = ∅ ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ (𝐴 ∖ 𝑊)) |
| 9 | gsumcllem.s | . . . . . 6 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊) | |
| 10 | gsumcllem.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 11 | gsumcllem.z | . . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑈) | |
| 12 | 1, 9, 10, 11 | suppssr 8250 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
| 13 | 8, 12 | sylan2 605 | . . . 4 ⊢ ((𝜑 ∧ (𝑊 = ∅ ∧ 𝑘 ∈ 𝐴)) → (𝐹‘𝑘) = 𝑍) |
| 14 | 13 | anassrs 473 | . . 3 ⊢ (((𝜑 ∧ 𝑊 = ∅) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) = 𝑍) |
| 15 | 14 | mpteq2dva 5204 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| 16 | 3, 15 | eqtrd 2798 | 1 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∖ cdif 4048 ∅c0 4281 ↦ cmpt 5192 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 supp csupp 8214 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-supp 8215 |
| This theorem is used by: gsumzres 20174 gsumzcl2 20175 gsumzf1o 20177 gsumzaddlem 20186 gsumzmhm 20202 gsumzoppg 20209 |
| Copyright terms: Public domain | W3C validator |