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 48438
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 48430 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}))
21adantrr 730 . . . . . 6 ((𝐹 Fn 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))) → 𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑥)}))
3 eleq2 2850 . . . . . . 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 3173 . 2 (𝐹 Fn 𝐴 → (∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → ∃𝑥 ∈ 𝑆 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)})))
10 setpreimafvex.p . . 3 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
1110elsetpreimafv 48436 . 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 2145  {cab 2739  ∃wrex 3087  {csn 4584  ◡ccnv 5650   “ cima 5654   Fn wfn 6532  ‘cfv 6537
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-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  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 6493  df-fun 6539  df-fn 6540  df-fv 6545
This theorem is used by:  imaelsetpreimafv  48446
  Copyright terms: Public domain W3C validator