| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gsumcllem | Structured version Visualization version GIF version | ||
| Description: Lemma for gsumcl 20138 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 6958 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 3 | 2 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) |
| 4 | difeq2 4056 | . . . . . . . 8 ⊢ (𝑊 = ∅ → (𝐴 ∖ 𝑊) = (𝐴 ∖ ∅)) | |
| 5 | dif0 4326 | . . . . . . . 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 8219 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
| 13 | 8, 12 | sylan2 605 | . . . 4 ⊢ ((𝜑 ∧ (𝑊 = ∅ ∧ 𝑘 ∈ 𝐴)) → (𝐹‘𝑘) = 𝑍) |
| 14 | 13 | anassrs 473 | . . 3 ⊢ (((𝜑 ∧ 𝑊 = ∅) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) = 𝑍) |
| 15 | 14 | mpteq2dva 5197 | . 2 ⊢ ((𝜑 ∧ 𝑊 = ∅) → (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| 16 | 3, 15 | eqtrd 2795 | 1 ⊢ ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3896 ∖ cdif 4044 ∅c0 4277 ↦ cmpt 5185 ⟶wf 6539 ‘cfv 6543 (class class class)co 7424 supp csupp 8183 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-supp 8184 |
| This theorem is used by: gsumzres 20132 gsumzcl2 20133 gsumzf1o 20135 gsumzaddlem 20144 gsumzmhm 20160 gsumzoppg 20167 |
| Copyright terms: Public domain | W3C validator |