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

Theorem fvelsetpreimafv 48803
Description: There is an element in a preimage 𝑆 of function values so that 𝑆 is the preimage of the function value at this element. (Contributed by AV, 8-Mar-2024.)
Hypothesis
Ref Expression
setpreimafvex.p 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
Assertion
Ref Expression
fvelsetpreimafv ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → ∃𝑥 ∈ 𝑆 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))
Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧   𝑥,𝑆,𝑧
Allowed substitution hints:   𝑃(𝑥, 𝑧)

Proof of Theorem fvelsetpreimafv
StepHypRef Expression
1 preimafvsnel 48795 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}))
21adantrr 730 . . . . . 6 ((𝐹 Fn 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) → 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}))
3 eleq2 2853 . . . . . . 7 (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝑥 ∈ 𝑆 ↔ 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)})))
43ad2antll 742 . . . . . 6 ((𝐹 Fn 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) → (𝑥 ∈ 𝑆 ↔ 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)})))
52, 4mpbird 260 . . . . 5 ((𝐹 Fn 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) → 𝑥 ∈ 𝑆)
6 simprr 785 . . . . 5 ((𝐹 Fn 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) → 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))
75, 6jca 521 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) → (𝑥 ∈ 𝑆 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)})))
87ex 418 . . 3 (𝐹 Fn 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)})) → (𝑥 ∈ 𝑆 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))))
98reximdv2 3176 . 2 (𝐹 Fn 𝐴 → (∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → ∃𝑥 ∈ 𝑆 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)})))
10 setpreimafvex.p . . 3 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
1110elsetpreimafv 48801 . 2 (𝑆 ∈ 𝑃 → ∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))
129, 11impel 515 1 ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → ∃𝑥 ∈ 𝑆 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090  {csn 4588  ◡ccnv 5657   “ cima 5661   Fn wfn 6561  ‘cfv 6566
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574
This theorem is used by:  imaelsetpreimafv  48811
  Copyright terms: Public domain W3C validator