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

Theorem elsetpreimafvbi 48807
Description: An element of the preimage of a function value is an element of the domain of the function with the same value as another element of the preimage. (Contributed by AV, 9-Mar-2024.)
Hypothesis
Ref Expression
setpreimafvex.p 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
Assertion
Ref Expression
elsetpreimafvbi ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃 ∧ 𝑋 ∈ 𝑆) → (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))
Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧   𝑥,𝑆,𝑧   𝑥,𝑋   𝑥,𝑌
Allowed substitution hints:   𝑃(𝑥, 𝑧)   𝑋(𝑧)   𝑌(𝑧)

Proof of Theorem elsetpreimafvbi
StepHypRef Expression
1 fniniseg 7091 . . . . . 6 (𝐹 Fn 𝐴 → (𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = (𝐹‘𝑥))))
2 fniniseg 7091 . . . . . . . . 9 (𝐹 Fn 𝐴 → (𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑥))))
3 eqeq2 2775 . . . . . . . . . . 11 ((𝐹‘𝑥) = (𝐹‘𝑋) → ((𝐹‘𝑌) = (𝐹‘𝑥) ↔ (𝐹‘𝑌) = (𝐹‘𝑋)))
43anbi2d 642 . . . . . . . . . 10 ((𝐹‘𝑥) = (𝐹‘𝑋) → ((𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑥)) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))
54eqcoms 2771 . . . . . . . . 9 ((𝐹‘𝑋) = (𝐹‘𝑥) → ((𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑥)) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))
62, 5sylan9bb 519 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ (𝐹‘𝑋) = (𝐹‘𝑥)) → (𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))
76ex 418 . . . . . . 7 (𝐹 Fn 𝐴 → ((𝐹‘𝑋) = (𝐹‘𝑥) → (𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋)))))
87adantld 496 . . . . . 6 (𝐹 Fn 𝐴 → ((𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = (𝐹‘𝑥)) → (𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋)))))
91, 8sylbid 243 . . . . 5 (𝐹 Fn 𝐴 → (𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) → (𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋)))))
10 eleq2 2853 . . . . . 6 (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝑋 ∈ 𝑆 ↔ 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑥)})))
11 eleq2 2853 . . . . . . 7 (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝑌 ∈ 𝑆 ↔ 𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)})))
1211bibi1d 346 . . . . . 6 (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → ((𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))) ↔ (𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋)))))
1310, 12imbi12d 347 . . . . 5 (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → ((𝑋 ∈ 𝑆 → (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋)))) ↔ (𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) → (𝑌 ∈ (◡𝐹 “ {(𝐹‘𝑥)}) ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))))
149, 13imbitrrid 249 . . . 4 (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝐹 Fn 𝐴 → (𝑋 ∈ 𝑆 → (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))))
1514rexlimivw 3163 . . 3 (∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝐹 Fn 𝐴 → (𝑋 ∈ 𝑆 → (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))))
16 setpreimafvex.p . . . 4 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
1716elsetpreimafv 48801 . . 3 (𝑆 ∈ 𝑃 → ∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))
1815, 17syl11 34 . 2 (𝐹 Fn 𝐴 → (𝑆 ∈ 𝑃 → (𝑋 ∈ 𝑆 → (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))))
19183imp 1128 1 ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃 ∧ 𝑋 ∈ 𝑆) → (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐴 ∧ (𝐹‘𝑌) = (𝐹‘𝑋))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = 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:  elsetpreimafveqfv  48808  eqfvelsetpreimafv  48809  elsetpreimafvrab  48810  imaelsetpreimafv  48811
  Copyright terms: Public domain W3C validator