| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumcllem | Structured version Visualization version GIF version | ||
| Description: Lemma for gsumcl 20042 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 6946 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 3 | 2 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 4 | difeq2 4068 | . . . . . . . 8 ⊢ (𝑊 = ∅ → (𝐴 ∖ 𝑊) = (𝐴 ∖ ∅)) | |
| 5 | dif0 4327 | . . . . . . . 8 ⊢ (𝐴 ∖ ∅) = 𝐴 | |
| 6 | 4, 5 | eqtrdi 2811 | . . . . . . 7 ⊢ (𝑊 = ∅ → (𝐴 ∖ 𝑊) = 𝐴) |
| 7 | 6 | eleq2d 2846 | . . . . . 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 8193 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
| 13 | 8, 12 | sylan2 605 | . . . 4 ⊢ ((𝜑 ∧ (𝑊 = ∅ ∧ 𝑘 ∈ 𝐴)) → (𝐹‘𝑘) = 𝑍) |
| 14 | 13 | anassrs 473 | . . 3 ⊢ (((𝜑 ∧ 𝑊 = ∅) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) = 𝑍) |
| 15 | 14 | mpteq2dva 5198 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| 16 | 3, 15 | eqtrd 2795 | 1 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∖ cdif 3896 ⊆ wss 3899 ∅c0 4279 ↦ cmpt 5186 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 supp csupp 8158 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-supp 8159 |
| This theorem is used by: gsumzres 20036 gsumzcl2 20037 gsumzf1o 20039 gsumzaddlem 20048 gsumzmhm 20064 gsumzoppg 20071 |
| Copyright terms: Public domain | W3C validator |