| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumcllem | Structured version Visualization version GIF version | ||
| Description: Lemma for gsumcl 20029 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 6953 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 3 | 2 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 4 | difeq2 4075 | . . . . . . . 8 ⊢ (𝑊 = ∅ → (𝐴 ∖ 𝑊) = (𝐴 ∖ ∅)) | |
| 5 | dif0 4334 | . . . . . . . 8 ⊢ (𝐴 ∖ ∅) = 𝐴 | |
| 6 | 4, 5 | eqtrdi 2816 | . . . . . . 7 ⊢ (𝑊 = ∅ → (𝐴 ∖ 𝑊) = 𝐴) |
| 7 | 6 | eleq2d 2851 | . . . . . 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 8197 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
| 13 | 8, 12 | sylan2 605 | . . . 4 ⊢ ((𝜑 ∧ (𝑊 = ∅ ∧ 𝑘 ∈ 𝐴)) → (𝐹‘𝑘) = 𝑍) |
| 14 | 13 | anassrs 473 | . . 3 ⊢ (((𝜑 ∧ 𝑊 = ∅) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) = 𝑍) |
| 15 | 14 | mpteq2dva 5206 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| 16 | 3, 15 | eqtrd 2800 | 1 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∖ cdif 3903 ⊆ wss 3906 ∅c0 4286 ↦ cmpt 5194 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 supp csupp 8162 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-supp 8163 |
| This theorem is used by: gsumzres 20023 gsumzcl2 20024 gsumzf1o 20026 gsumzaddlem 20035 gsumzmhm 20051 gsumzoppg 20058 |
| Copyright terms: Public domain | W3C validator |