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

Theorem fvn0elsuppb 8135
Description: The function value for a given argument is not empty iff the argument belongs to the support of the function with the empty set as zero. (Contributed by AV, 4-Apr-2020.)
Assertion
Ref Expression
fvn0elsuppb ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → ((𝐺𝑋) ≠ ∅ ↔ 𝑋 ∈ (𝐺 supp ∅)))

Proof of Theorem fvn0elsuppb
StepHypRef Expression
1 fvn0elsupp 8134 . . . 4 (((𝐵𝑉𝑋𝐵) ∧ (𝐺 Fn 𝐵 ∧ (𝐺𝑋) ≠ ∅)) → 𝑋 ∈ (𝐺 supp ∅))
21exp43 436 . . 3 (𝐵𝑉 → (𝑋𝐵 → (𝐺 Fn 𝐵 → ((𝐺𝑋) ≠ ∅ → 𝑋 ∈ (𝐺 supp ∅)))))
323imp 1111 . 2 ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → ((𝐺𝑋) ≠ ∅ → 𝑋 ∈ (𝐺 supp ∅)))
4 simp3 1139 . . . 4 ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → 𝐺 Fn 𝐵)
5 simp1 1137 . . . 4 ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → 𝐵𝑉)
6 0ex 5256 . . . . 5 ∅ ∈ V
76a1i 11 . . . 4 ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → ∅ ∈ V)
8 elsuppfn 8124 . . . 4 ((𝐺 Fn 𝐵𝐵𝑉 ∧ ∅ ∈ V) → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋𝐵 ∧ (𝐺𝑋) ≠ ∅)))
94, 5, 7, 8syl3anc 1374 . . 3 ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋𝐵 ∧ (𝐺𝑋) ≠ ∅)))
10 simpr 484 . . 3 ((𝑋𝐵 ∧ (𝐺𝑋) ≠ ∅) → (𝐺𝑋) ≠ ∅)
119, 10biimtrdi 253 . 2 ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → (𝑋 ∈ (𝐺 supp ∅) → (𝐺𝑋) ≠ ∅))
123, 11impbid 212 1 ((𝐵𝑉𝑋𝐵𝐺 Fn 𝐵) → ((𝐺𝑋) ≠ ∅ ↔ 𝑋 ∈ (𝐺 supp ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087  wcel 2114  wne 2933  Vcvv 3442  c0 4287   Fn wfn 6497  cfv 6502  (class class class)co 7370   supp csupp 8114
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-ov 7373  df-oprab 7374  df-mpo 7375  df-supp 8115
This theorem is referenced by:  brcic  17736
  Copyright terms: Public domain W3C validator