Theorem fvineqsnf1 35954

Description: A theorem about functions where the image of every point intersects the domain only at that point. If 𝐽 is a topology and 𝐴 is a set with no limit points, then there exists an 𝐹 such that this antecedent is true. See nlpfvineqsn 35953 for a proof of this fact. (Contributed by ML, 23-Mar-2021.)

Assertion

Ref	Expression
fvineqsnf1	⊢ ((𝐹:𝐴⟶𝐽 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → 𝐹:𝐴–1-1→𝐽)

Distinct variable groups:   𝐴,𝑝   𝐹,𝑝

Allowed substitution hint:   𝐽(𝑝)

Proof of Theorem fvineqsnf1

Dummy variable 𝑞 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6847	. . . . . . . . . 10 ⊢ (𝑝 = 𝑞 → (𝐹‘𝑝) = (𝐹‘𝑞))
2	1	ineq1d 4176	. . . . . . . . 9 ⊢ (𝑝 = 𝑞 → ((𝐹‘𝑝) ∩ 𝐴) = ((𝐹‘𝑞) ∩ 𝐴))
3		sneq 4601	. . . . . . . . 9 ⊢ (𝑝 = 𝑞 → {𝑝} = {𝑞})
4	2, 3	eqeq12d 2747	. . . . . . . 8 ⊢ (𝑝 = 𝑞 → (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ↔ ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}))
5	4	cbvralvw 3223	. . . . . . 7 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ↔ ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞})
6	5	biimpi 215	. . . . . 6 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞})
7		ax-5 1913	. . . . . . . 8 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → ∀𝑞∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
8		alral 3074	. . . . . . . 8 ⊢ (∀𝑞∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → ∀𝑞 ∈ 𝐴 ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
9		ralcom 3270	. . . . . . . . 9 ⊢ (∀𝑞 ∈ 𝐴 ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ↔ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
10	9	biimpi 215	. . . . . . . 8 ⊢ (∀𝑞 ∈ 𝐴 ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
11	7, 8, 10	3syl 18	. . . . . . 7 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
12		ax-5 1913	. . . . . . . 8 ⊢ (∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞} → ∀𝑝∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞})
13		alral 3074	. . . . . . . 8 ⊢ (∀𝑝∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞} → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞})
14	12, 13	syl 17	. . . . . . 7 ⊢ (∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞} → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞})
15	11, 14	anim12i 613	. . . . . 6 ⊢ ((∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}) → (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}))
16	6, 15	mpdan 685	. . . . 5 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}))
17		r19.26-2 3131	. . . . 5 ⊢ (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}) ↔ (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}))
18	16, 17	sylibr 233	. . . 4 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}))
19		ineq1 4170	. . . . . . 7 ⊢ ((𝐹‘𝑝) = (𝐹‘𝑞) → ((𝐹‘𝑝) ∩ 𝐴) = ((𝐹‘𝑞) ∩ 𝐴))
20		eqeq1 2735	. . . . . . . . 9 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (((𝐹‘𝑝) ∩ 𝐴) = ((𝐹‘𝑞) ∩ 𝐴) ↔ {𝑝} = ((𝐹‘𝑞) ∩ 𝐴)))
21		eqcom 2738	. . . . . . . . 9 ⊢ ({𝑝} = ((𝐹‘𝑞) ∩ 𝐴) ↔ ((𝐹‘𝑞) ∩ 𝐴) = {𝑝})
22	20, 21	bitrdi 286	. . . . . . . 8 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (((𝐹‘𝑝) ∩ 𝐴) = ((𝐹‘𝑞) ∩ 𝐴) ↔ ((𝐹‘𝑞) ∩ 𝐴) = {𝑝}))
23		eqeq1 2735	. . . . . . . . 9 ⊢ (((𝐹‘𝑞) ∩ 𝐴) = {𝑞} → (((𝐹‘𝑞) ∩ 𝐴) = {𝑝} ↔ {𝑞} = {𝑝}))
24		eqcom 2738	. . . . . . . . . 10 ⊢ ({𝑞} = {𝑝} ↔ {𝑝} = {𝑞})
25		vex 3450	. . . . . . . . . . 11 ⊢ 𝑝 ∈ V
26		sneqbg 4806	. . . . . . . . . . 11 ⊢ (𝑝 ∈ V → ({𝑝} = {𝑞} ↔ 𝑝 = 𝑞))
27	25, 26	ax-mp 5	. . . . . . . . . 10 ⊢ ({𝑝} = {𝑞} ↔ 𝑝 = 𝑞)
28	24, 27	bitri 274	. . . . . . . . 9 ⊢ ({𝑞} = {𝑝} ↔ 𝑝 = 𝑞)
29	23, 28	bitrdi 286	. . . . . . . 8 ⊢ (((𝐹‘𝑞) ∩ 𝐴) = {𝑞} → (((𝐹‘𝑞) ∩ 𝐴) = {𝑝} ↔ 𝑝 = 𝑞))
30	22, 29	sylan9bb 510	. . . . . . 7 ⊢ ((((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}) → (((𝐹‘𝑝) ∩ 𝐴) = ((𝐹‘𝑞) ∩ 𝐴) ↔ 𝑝 = 𝑞))
31	19, 30	imbitrid 243	. . . . . 6 ⊢ ((((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}) → ((𝐹‘𝑝) = (𝐹‘𝑞) → 𝑝 = 𝑞))
32	31	ralimi 3082	. . . . 5 ⊢ (∀𝑞 ∈ 𝐴 (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}) → ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑞) → 𝑝 = 𝑞))
33	32	ralimi 3082	. . . 4 ⊢ (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ ((𝐹‘𝑞) ∩ 𝐴) = {𝑞}) → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑞) → 𝑝 = 𝑞))
34	18, 33	syl 17	. . 3 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑞) → 𝑝 = 𝑞))
35	34	anim2i 617	. 2 ⊢ ((𝐹:𝐴⟶𝐽 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝐹:𝐴⟶𝐽 ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑞) → 𝑝 = 𝑞)))
36		dff13 7207	. 2 ⊢ (𝐹:𝐴–1-1→𝐽 ↔ (𝐹:𝐴⟶𝐽 ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑞) → 𝑝 = 𝑞)))
37	35, 36	sylibr 233	1 ⊢ ((𝐹:𝐴⟶𝐽 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → 𝐹:𝐴–1-1→𝐽)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∀wal 1539   = wceq 1541   ∈ wcel 2106  ∀wral 3060  Vcvv 3446   ∩ cin 3912  {csn 4591  ⟶wf 6497  –1-1→wf1 6498  ‘cfv 6501

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-id 5536  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fv 6509

This theorem is referenced by:  fvineqsneu  35955  pibt2  35961