Theorem preimane 33361

Description: Different elements have different preimages. (Contributed by Thierry Arnoux, 7-May-2023.)

Hypotheses

Ref	Expression
preimane.f	⊢ (𝜑 → Fun 𝐹)
preimane.x	⊢ (𝜑 → 𝑋 ≠ 𝑌)
preimane.y	⊢ (𝜑 → 𝑋 ∈ ran 𝐹)
preimane.1	⊢ (𝜑 → 𝑌 ∈ ran 𝐹)

Assertion

Ref	Expression
preimane	⊢ (𝜑 → (◡𝐹 “ {𝑋}) ≠ (◡𝐹 “ {𝑌}))

Proof of Theorem preimane

Step	Hyp	Ref	Expression
1		preimane.x	. . . 4 ⊢ (𝜑 → 𝑋 ≠ 𝑌)
2		preimane.y	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ ran 𝐹)
3		sneqrg 4799	. . . . . 6 ⊢ (𝑋 ∈ ran 𝐹 → ({𝑋} = {𝑌} → 𝑋 = 𝑌))
4	2, 3	syl 18	. . . . 5 ⊢ (𝜑 → ({𝑋} = {𝑌} → 𝑋 = 𝑌))
5	4	necon3d 2980	. . . 4 ⊢ (𝜑 → (𝑋 ≠ 𝑌 → {𝑋} ≠ {𝑌}))
6	1, 5	mpd 16	. . 3 ⊢ (𝜑 → {𝑋} ≠ {𝑌})
7		preimane.f	. . . . 5 ⊢ (𝜑 → Fun 𝐹)
8		funimacnv 6651	. . . . 5 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ {𝑋})) = ({𝑋} ∩ ran 𝐹))
9	7, 8	syl 18	. . . 4 ⊢ (𝜑 → (𝐹 “ (◡𝐹 “ {𝑋})) = ({𝑋} ∩ ran 𝐹))
10	2	snssd 4749	. . . . 5 ⊢ (𝜑 → {𝑋} ⊆ ran 𝐹)
11		dfss2 4097	. . . . 5 ⊢ ({𝑋} ⊆ ran 𝐹 ↔ ({𝑋} ∩ ran 𝐹) = {𝑋})
12	10, 11	sylib 221	. . . 4 ⊢ (𝜑 → ({𝑋} ∩ ran 𝐹) = {𝑋})
13	9, 12	eqtrd 2798	. . 3 ⊢ (𝜑 → (𝐹 “ (◡𝐹 “ {𝑋})) = {𝑋})
14		funimacnv 6651	. . . . 5 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ {𝑌})) = ({𝑌} ∩ ran 𝐹))
15	7, 14	syl 18	. . . 4 ⊢ (𝜑 → (𝐹 “ (◡𝐹 “ {𝑌})) = ({𝑌} ∩ ran 𝐹))
16		preimane.1	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ran 𝐹)
17	16	snssd 4749	. . . . 5 ⊢ (𝜑 → {𝑌} ⊆ ran 𝐹)
18		dfss2 4097	. . . . 5 ⊢ ({𝑌} ⊆ ran 𝐹 ↔ ({𝑌} ∩ ran 𝐹) = {𝑌})
19	17, 18	sylib 221	. . . 4 ⊢ (𝜑 → ({𝑌} ∩ ran 𝐹) = {𝑌})
20	15, 19	eqtrd 2798	. . 3 ⊢ (𝜑 → (𝐹 “ (◡𝐹 “ {𝑌})) = {𝑌})
21	6, 13, 20	3netr4d 3036	. 2 ⊢ (𝜑 → (𝐹 “ (◡𝐹 “ {𝑋})) ≠ (𝐹 “ (◡𝐹 “ {𝑌})))
22		imaeq2 6066	. . 3 ⊢ ((◡𝐹 “ {𝑋}) = (◡𝐹 “ {𝑌}) → (𝐹 “ (◡𝐹 “ {𝑋})) = (𝐹 “ (◡𝐹 “ {𝑌})))
23	22	necon3i 2991	. 2 ⊢ ((𝐹 “ (◡𝐹 “ {𝑋})) ≠ (𝐹 “ (◡𝐹 “ {𝑌})) → (◡𝐹 “ {𝑋}) ≠ (◡𝐹 “ {𝑌}))
24	21, 23	syl 18	1 ⊢ (𝜑 → (◡𝐹 “ {𝑋}) ≠ (◡𝐹 “ {𝑌}))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   ⊆ wss 3900   ∩ cin 4092  {csn 4588  ^◡ccnv 5657  ran crn 5659   “ cima 5661  Fun wfun 6560

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-12 2216  ax-ext 2735  ax-sep 5255  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-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-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-fun 6568

This theorem is used by:  fnpreimac  33362