Theorem elsetpreimafveq 48305

Description: If two preimages of function values contain elements with identical function values, then both preimages are equal. (Contributed by AV, 8-Mar-2024.)

Hypothesis

Ref	Expression
setpreimafvex.p	⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}

Assertion

Ref	Expression
elsetpreimafveq	⊢ ((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) → ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑆 = 𝑅))

Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧   𝑥,𝑅,𝑧   𝑥,𝑆,𝑧   𝑥,𝑋   𝑥,𝑌

Allowed substitution hints:   𝑃(𝑥, 𝑧)   𝑋(𝑧)   𝑌(𝑧)

Proof of Theorem elsetpreimafveq

Step	Hyp	Ref	Expression
1		eqeq2 2774	. . . . 5 ⊢ ((𝐹‘𝑋) = (𝐹‘𝑌) → ((𝐹‘𝑥) = (𝐹‘𝑋) ↔ (𝐹‘𝑥) = (𝐹‘𝑌)))
2	1	rabbidv 3421	. . . 4 ⊢ ((𝐹‘𝑋) = (𝐹‘𝑌) → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑋)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑌)})
3	2	adantl 487	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑋)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑌)})
4		id 23	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → 𝐹 Fn 𝐴)
5		simpl 488	. . . . . 6 ⊢ ((𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) → 𝑆 ∈ 𝑃)
6		simpl 488	. . . . . 6 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅) → 𝑋 ∈ 𝑆)
7	4, 5, 6	3anim123i 1169	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) → (𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃 ∧ 𝑋 ∈ 𝑆))
8	7	adantr 486	. . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃 ∧ 𝑋 ∈ 𝑆))
9		setpreimafvex.p	. . . . 5 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
10	9	elsetpreimafvrab 48302	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃 ∧ 𝑋 ∈ 𝑆) → 𝑆 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑋)})
11	8, 10	syl 18	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑆 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑋)})
12		simpr 490	. . . . . 6 ⊢ ((𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) → 𝑅 ∈ 𝑃)
13		simpr 490	. . . . . 6 ⊢ ((𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅) → 𝑌 ∈ 𝑅)
14	4, 12, 13	3anim123i 1169	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) → (𝐹 Fn 𝐴 ∧ 𝑅 ∈ 𝑃 ∧ 𝑌 ∈ 𝑅))
15	14	adantr 486	. . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹 Fn 𝐴 ∧ 𝑅 ∈ 𝑃 ∧ 𝑌 ∈ 𝑅))
16	9	elsetpreimafvrab 48302	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑅 ∈ 𝑃 ∧ 𝑌 ∈ 𝑅) → 𝑅 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑌)})
17	15, 16	syl 18	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑅 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (𝐹‘𝑌)})
18	3, 11, 17	3eqtr4d 2807	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑆 = 𝑅)
19	18	ex 418	1 ⊢ ((𝐹 Fn 𝐴 ∧ (𝑆 ∈ 𝑃 ∧ 𝑅 ∈ 𝑃) ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑅)) → ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑆 = 𝑅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2740  ∃wrex 3088  {crab 3414  {csn 4587  ^◡ccnv 5658   “ cima 5662   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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545

This theorem is used by:  imasetpreimafvbijlemf1  48312