Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  0nelsetpreimafv Structured version   Visualization version   GIF version

Theorem 0nelsetpreimafv 48472
Description: The empty set is not an element of the class 𝑃 of all preimages of function values. (Contributed by AV, 6-Mar-2024.)
Hypothesis
Ref Expression
setpreimafvex.p 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
Assertion
Ref Expression
0nelsetpreimafv (𝐹 Fn 𝐴 → ∅ ∉ 𝑃)
Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧
Allowed substitution hints:   𝑃(𝑥, 𝑧)

Proof of Theorem 0nelsetpreimafv
StepHypRef Expression
1 preimafvsnel 48461 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}))
2 n0i 4285 . . . . . 6 (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) → ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅)
31, 2syl 18 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅)
43ralrimiva 3154 . . . 4 (𝐹 Fn 𝐴 → ∀𝑥 ∈ 𝐴 ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅)
5 ralnex 3088 . . . . 5 (∀𝑥 ∈ 𝐴 ¬ ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ¬ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)}))
6 eqcom 2767 . . . . . . 7 (∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅)
76notbii 323 . . . . . 6 (¬ ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅)
87ralbii 3108 . . . . 5 (∀𝑥 ∈ 𝐴 ¬ ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ∀𝑥 ∈ 𝐴 ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅)
95, 8bitr3i 280 . . . 4 (¬ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ∀𝑥 ∈ 𝐴 ¬ (◡𝐹 “ {(𝐹‘𝑥)}) = ∅)
104, 9sylibr 237 . . 3 (𝐹 Fn 𝐴 → ¬ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)}))
11 0ex 5260 . . . 4 ∅ ∈ V
12 setpreimafvex.p . . . . 5 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
1312elsetpreimafvb 48466 . . . 4 (∅ ∈ V → (∅ ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)})))
1411, 13ax-mp 5 . . 3 (∅ ∈ 𝑃 ↔ ∃𝑥 ∈ 𝐴 ∅ = (◡𝐹 “ {(𝐹‘𝑥)}))
1510, 14sylnibr 332 . 2 (𝐹 Fn 𝐴 → ¬ ∅ ∈ 𝑃)
16 df-nel 3062 . 2 (∅ ∉ 𝑃 ↔ ¬ ∅ ∈ 𝑃)
1715, 16sylibr 237 1 (𝐹 Fn 𝐴 → ∅ ∉ 𝑃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738   ∉ wnel 3061  ∀wral 3076  ∃wrex 3086  Vcvv 3450  ∅c0 4278  {csn 4583  ◡ccnv 5649   “ cima 5653   Fn wfn 6533  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546
This theorem is used by:  uniimaelsetpreimafv  48478  imasetpreimafvbijlemfv1  48485
  Copyright terms: Public domain W3C validator