| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnsuppeq0 | Structured version Visualization version GIF version | ||
| Description: The support of a function is empty iff it is identically zero. (Contributed by Stefan O'Rear, 22-Mar-2015.) (Revised by AV, 28-May-2019.) |
| Ref | Expression |
|---|---|
| fnsuppeq0 | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → ((𝐹 supp 𝑍) = ∅ ↔ 𝐹 = (𝐴 × {𝑍}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ss0b 4361 | . . 3 ⊢ ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹 supp 𝑍) = ∅) | |
| 2 | un0 4354 | . . . . . . . 8 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
| 3 | uncom 4115 | . . . . . . . 8 ⊢ (𝐴 ∪ ∅) = (∅ ∪ 𝐴) | |
| 4 | 2, 3 | eqtr3i 2791 | . . . . . . 7 ⊢ 𝐴 = (∅ ∪ 𝐴) |
| 5 | 4 | fneq2i 6640 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 Fn (∅ ∪ 𝐴)) |
| 6 | 5 | biimpi 219 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → 𝐹 Fn (∅ ∪ 𝐴)) |
| 7 | 6 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝐹 Fn (∅ ∪ 𝐴)) |
| 8 | fnex 7222 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊) → 𝐹 ∈ V) | |
| 9 | 8 | 3adant3 1150 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝐹 ∈ V) |
| 10 | simp3 1156 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝑍 ∈ 𝑉) | |
| 11 | 0in 4357 | . . . . 5 ⊢ (∅ ∩ 𝐴) = ∅ | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → (∅ ∩ 𝐴) = ∅) |
| 13 | fnsuppres 8196 | . . . 4 ⊢ ((𝐹 Fn (∅ ∪ 𝐴) ∧ (𝐹 ∈ V ∧ 𝑍 ∈ 𝑉) ∧ (∅ ∩ 𝐴) = ∅) → ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹 ↾ 𝐴) = (𝐴 × {𝑍}))) | |
| 14 | 7, 9, 10, 12, 13 | syl121anc 1402 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹 ↾ 𝐴) = (𝐴 × {𝑍}))) |
| 15 | 1, 14 | bitr3id 288 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → ((𝐹 supp 𝑍) = ∅ ↔ (𝐹 ↾ 𝐴) = (𝐴 × {𝑍}))) |
| 16 | fnresdm 6661 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹) | |
| 17 | 16 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → (𝐹 ↾ 𝐴) = 𝐹) |
| 18 | 17 | eqeq1d 2768 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → ((𝐹 ↾ 𝐴) = (𝐴 × {𝑍}) ↔ 𝐹 = (𝐴 × {𝑍}))) |
| 19 | 15, 18 | bitrd 282 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → ((𝐹 supp 𝑍) = ∅ ↔ 𝐹 = (𝐴 × {𝑍}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 Vcvv 3458 ∪ cun 3906 ∩ cin 3907 ⊆ wss 3908 ∅c0 4289 {csn 4594 × cxp 5664 ↾ cres 5668 Fn wfn 6538 (class class class)co 7423 supp csupp 8165 |
| 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 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-supp 8166 |
| This theorem is used by: fczsupp0 8198 cantnf0 9654 mdegldg 26260 mdeg0 26264 suppovss 33063 fsuppind 43363 |
| Copyright terms: Public domain | W3C validator |