| 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 4351 | . . 3 ⊢ ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹 supp 𝑍) = ∅) | |
| 2 | un0 4344 | . . . . . . . 8 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
| 3 | uncom 4105 | . . . . . . . 8 ⊢ (𝐴 ∪ ∅) = (∅ ∪ 𝐴) | |
| 4 | 2, 3 | eqtr3i 2786 | . . . . . . 7 ⊢ 𝐴 = (∅ ∪ 𝐴) |
| 5 | 4 | fneq2i 6629 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 Fn (∅ ∪ 𝐴)) |
| 6 | 5 | biimpi 219 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → 𝐹 Fn (∅ ∪ 𝐴)) |
| 7 | 6 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝐹 Fn (∅ ∪ 𝐴)) |
| 8 | fnex 7215 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊) → 𝐹 ∈ V) | |
| 9 | 8 | 3adant3 1150 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝐹 ∈ V) |
| 10 | simp3 1156 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → 𝑍 ∈ 𝑉) | |
| 11 | 0in 4347 | . . . . 5 ⊢ (∅ ∩ 𝐴) = ∅ | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → (∅ ∩ 𝐴) = ∅) |
| 13 | fnsuppres 8192 | . . . 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 6650 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹) | |
| 17 | 16 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑊 ∧ 𝑍 ∈ 𝑉) → (𝐹 ↾ 𝐴) = 𝐹) |
| 18 | 17 | eqeq1d 2763 | . 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 2145 Vcvv 3451 ∪ cun 3897 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 {csn 4584 × cxp 5649 ↾ cres 5653 Fn wfn 6526 (class class class)co 7412 supp csupp 8161 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7740 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 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 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-oprab 7416 df-mpo 7417 df-supp 8162 |
| This theorem is used by: fczsupp0 8194 cantnf0 9660 mdegldg 26364 mdeg0 26368 suppovss 33256 fsuppind 43580 |
| Copyright terms: Public domain | W3C validator |