| 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 4359 | . . 3 ⊢ ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹 supp 𝑍) = ∅) | |
| 2 | un0 4352 | . . . . . . . 8 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
| 3 | uncom 4113 | . . . . . . . 8 ⊢ (𝐴 ∪ ∅) = (∅ ∪ 𝐴) | |
| 4 | 2, 3 | eqtr3i 2788 | . . . . . . 7 ⊢ 𝐴 = (∅ ∪ 𝐴) |
| 5 | 4 | fneq2i 6635 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 Fn (∅ ∪ 𝐴)) |
| 6 | 5 | biimpi 219 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → 𝐹 Fn (∅ ∪ 𝐴)) |
| 7 | 6 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝐹 Fn (∅ ∪ 𝐴)) |
| 8 | fnex 7217 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊) → 𝐹 ∈ V) | |
| 9 | 8 | 3adant3 1150 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝐹 ∈ V) |
| 10 | simp3 1156 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝑍 ∈ 𝑉) | |
| 11 | 0in 4355 | . . . . 5 ⊢ (∅ ∩ 𝐴) = ∅ | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → (∅ ∩ 𝐴) = ∅) |
| 13 | fnsuppres 8188 | . . . 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 6656 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹) | |
| 17 | 16 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → (𝐹 ↾ 𝐴) = 𝐹) |
| 18 | 17 | eqeq1d 2765 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → ((𝐹 ↾ 𝐴) = (𝐴 × {𝑍}) ↔ 𝐹 = (𝐴 × {𝑍}))) |
| 19 | 15, 18 | bitrd 282 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → ((𝐹 supp 𝑍) = ∅ ↔ 𝐹 = (𝐴 × {𝑍}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∪ cun 3904 ∩ cin 3905 ⊆ wss 3906 ∅c0 4287 {csn 4590 × cxp 5661 ↾ cres 5665 Fn wfn 6533 (class class class)co 7412 supp csupp 8157 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 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 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-oprab 7416 df-mpo 7417 df-supp 8158 |
| This theorem is referenced by: fczsupp0 8190 cantnf0 9645 mdegldg 26204 mdeg0 26208 suppovss 33007 fsuppind 43305 |
| Copyright terms: Public domain | W3C validator |