MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnsuppeq0 Structured version   Visualization version   GIF version

Theorem fnsuppeq0 7841
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.)
Assertion
Ref Expression
fnsuppeq0 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → ((𝐹 supp 𝑍) = ∅ ↔ 𝐹 = (𝐴 × {𝑍})))

Proof of Theorem fnsuppeq0
StepHypRef Expression
1 ss0b 4305 . . 3 ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹 supp 𝑍) = ∅)
2 un0 4298 . . . . . . . 8 (𝐴 ∪ ∅) = 𝐴
3 uncom 4080 . . . . . . . 8 (𝐴 ∪ ∅) = (∅ ∪ 𝐴)
42, 3eqtr3i 2823 . . . . . . 7 𝐴 = (∅ ∪ 𝐴)
54fneq2i 6421 . . . . . 6 (𝐹 Fn 𝐴𝐹 Fn (∅ ∪ 𝐴))
65biimpi 219 . . . . 5 (𝐹 Fn 𝐴𝐹 Fn (∅ ∪ 𝐴))
763ad2ant1 1130 . . . 4 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → 𝐹 Fn (∅ ∪ 𝐴))
8 fnex 6957 . . . . 5 ((𝐹 Fn 𝐴𝐴𝑊) → 𝐹 ∈ V)
983adant3 1129 . . . 4 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → 𝐹 ∈ V)
10 simp3 1135 . . . 4 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → 𝑍𝑉)
11 0in 4301 . . . . 5 (∅ ∩ 𝐴) = ∅
1211a1i 11 . . . 4 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → (∅ ∩ 𝐴) = ∅)
13 fnsuppres 7840 . . . 4 ((𝐹 Fn (∅ ∪ 𝐴) ∧ (𝐹 ∈ V ∧ 𝑍𝑉) ∧ (∅ ∩ 𝐴) = ∅) → ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹𝐴) = (𝐴 × {𝑍})))
147, 9, 10, 12, 13syl121anc 1372 . . 3 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → ((𝐹 supp 𝑍) ⊆ ∅ ↔ (𝐹𝐴) = (𝐴 × {𝑍})))
151, 14bitr3id 288 . 2 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → ((𝐹 supp 𝑍) = ∅ ↔ (𝐹𝐴) = (𝐴 × {𝑍})))
16 fnresdm 6438 . . . 4 (𝐹 Fn 𝐴 → (𝐹𝐴) = 𝐹)
17163ad2ant1 1130 . . 3 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → (𝐹𝐴) = 𝐹)
1817eqeq1d 2800 . 2 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → ((𝐹𝐴) = (𝐴 × {𝑍}) ↔ 𝐹 = (𝐴 × {𝑍})))
1915, 18bitrd 282 1 ((𝐹 Fn 𝐴𝐴𝑊𝑍𝑉) → ((𝐹 supp 𝑍) = ∅ ↔ 𝐹 = (𝐴 × {𝑍})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  w3a 1084   = wceq 1538  wcel 2111  Vcvv 3441  cun 3879  cin 3880  wss 3881  c0 4243  {csn 4525   × cxp 5517  cres 5521   Fn wfn 6319  (class class class)co 7135   supp csupp 7813
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-supp 7814
This theorem is referenced by:  fczsupp0  7842  cantnf0  9122  mdegldg  24667  mdeg0  24671  suppovss  30443  fsuppind  39456
  Copyright terms: Public domain W3C validator