Theorem fvineqsneu 38334

Description: A theorem about functions where the image of every point intersects the domain only at that point. (Contributed by ML, 27-Mar-2021.)

Assertion

Ref	Expression
fvineqsneu	⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑞 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑞 ∈ 𝑥)

Distinct variable groups:   𝐴,𝑞,𝑥   𝐹,𝑞,𝑥   𝐴,𝑝   𝐹,𝑝

Proof of Theorem fvineqsneu

Dummy variables 𝑜 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fnfvelrn 7080	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑜 ∈ 𝐴) → (𝐹‘𝑜) ∈ ran 𝐹)
2	1	ex 418	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑜 ∈ 𝐴 → (𝐹‘𝑜) ∈ ran 𝐹))
3	2	adantr 486	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → (𝐹‘𝑜) ∈ ran 𝐹))
4		fnrnfv 6944	. . . . . . . . . 10 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝)})
5	4	eqabrd 2902	. . . . . . . . 9 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝)))
6	5	adantr 486	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑦 ∈ ran 𝐹 ↔ ∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝)))
7		nfv 1947	. . . . . . . . . 10 ⊢ Ⅎ𝑝 𝐹 Fn 𝐴
8		nfra1 3287	. . . . . . . . . 10 ⊢ Ⅎ𝑝∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}
9	7, 8	nfan 1932	. . . . . . . . 9 ⊢ Ⅎ𝑝(𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
10		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑝∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))
11		eleq2w2 2757	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = (𝐹‘𝑝) → (𝑜 ∈ 𝑦 ↔ 𝑜 ∈ (𝐹‘𝑝)))
12		elin 3915	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ (𝑜 ∈ (𝐹‘𝑝) ∧ 𝑜 ∈ 𝐴))
13	12	rbaib 548	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑜 ∈ 𝐴 → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑜 ∈ (𝐹‘𝑝)))
14	13	ad2antll 742	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑜 ∈ (𝐹‘𝑝)))
15		rsp 3251	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ 𝐴 → ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}))
16		eleq2w2 2757	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑜 ∈ {𝑝}))
17		velsn 4600	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑜 ∈ {𝑝} ↔ 𝑜 = 𝑝)
18		equcom 2051	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑜 = 𝑝 ↔ 𝑝 = 𝑜)
19	17, 18	bitri 278	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑜 ∈ {𝑝} ↔ 𝑝 = 𝑜)
20	16, 19	bitrdi 290	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜))
21	15, 20	syl6 36	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ 𝐴 → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜)))
22	21	adantl 487	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜)))
23	22	adantrd 497	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ((𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴) → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜)))
24	23	imp 412	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜))
25	14, 24	bitr3d 284	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑜 ∈ (𝐹‘𝑝) ↔ 𝑝 = 𝑜))
26	11, 25	sylan9bbr 520	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) ∧ 𝑦 = (𝐹‘𝑝)) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜))
27	26	ex 418	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑦 = (𝐹‘𝑝) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜)))
28	27	anass1rs 668	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) → (𝑦 = (𝐹‘𝑝) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜)))
29	28	impr 460	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜))
30	29	an32s 665	. . . . . . . . . . . . 13 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) ∧ 𝑜 ∈ 𝐴) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜))
31		eqeq1 2765	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = (𝐹‘𝑝) → (𝑦 = (𝐹‘𝑜) ↔ (𝐹‘𝑝) = (𝐹‘𝑜)))
32		dffn3 6722	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
33		fvineqsnf1 38333	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐹:𝐴⟶ran 𝐹 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → 𝐹:𝐴–1-1→ran 𝐹)
34	32, 33	sylanb 593	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → 𝐹:𝐴–1-1→ran 𝐹)
35		dff13 7258	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐹:𝐴–1-1→ran 𝐹 ↔ (𝐹:𝐴⟶ran 𝐹 ∧ ∀𝑝 ∈ 𝐴 ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
36	34, 35	sylib 221	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝐹:𝐴⟶ran 𝐹 ∧ ∀𝑝 ∈ 𝐴 ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
37		rsp 3251	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∀𝑝 ∈ 𝐴 ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜) → (𝑝 ∈ 𝐴 → ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
38	36, 37	simpl2im 513	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
39		rsp 3251	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜) → (𝑜 ∈ 𝐴 → ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
40	38, 39	syl6 36	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → (𝑜 ∈ 𝐴 → ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜))))
41	40	imp32 424	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜))
42		fveq2 6885	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑝 = 𝑜 → (𝐹‘𝑝) = (𝐹‘𝑜))
43	41, 42	impbid1 228	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → ((𝐹‘𝑝) = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
44	31, 43	sylan9bbr 520	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) ∧ 𝑦 = (𝐹‘𝑝)) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
45	44	ex 418	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑦 = (𝐹‘𝑝) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜)))
46	45	anass1rs 668	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) → (𝑦 = (𝐹‘𝑝) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜)))
47	46	impr 460	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
48	47	an32s 665	. . . . . . . . . . . . 13 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) ∧ 𝑜 ∈ 𝐴) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
49	30, 48	bitr4d 285	. . . . . . . . . . . 12 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) ∧ 𝑜 ∈ 𝐴) → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))
50	49	ex 418	. . . . . . . . . . 11 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → (𝑜 ∈ 𝐴 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
51	50	ralrimiv 3154	. . . . . . . . . 10 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))
52	51	exp32 426	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → (𝑦 = (𝐹‘𝑝) → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))))
53	9, 10, 52	rexlimd 3270	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝) → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
54	6, 53	sylbid 243	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑦 ∈ ran 𝐹 → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
55		rsp 3251	. . . . . . 7 ⊢ (∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)) → (𝑜 ∈ 𝐴 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
56	54, 55	syl6 36	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑦 ∈ ran 𝐹 → (𝑜 ∈ 𝐴 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))))
57	56	com23 87	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → (𝑦 ∈ ran 𝐹 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))))
58	57	ralrimdv 3161	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → ∀𝑦 ∈ ran 𝐹(𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
59		reu6i 3686	. . . . 5 ⊢ (((𝐹‘𝑜) ∈ ran 𝐹 ∧ ∀𝑦 ∈ ran 𝐹(𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))) → ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦)
60	59	ex 418	. . . 4 ⊢ ((𝐹‘𝑜) ∈ ran 𝐹 → (∀𝑦 ∈ ran 𝐹(𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)) → ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦))
61	3, 58, 60	syl6c 71	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦))
62	61	ralrimiv 3154	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑜 ∈ 𝐴 ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦)
63		nfv 1947	. . . 4 ⊢ Ⅎ𝑥 𝑞 = 𝑜
64		nfv 1947	. . . 4 ⊢ Ⅎ𝑦 𝑞 = 𝑜
65		nfvd 1948	. . . 4 ⊢ (𝑞 = 𝑜 → Ⅎ𝑦 𝑞 ∈ 𝑥)
66		nfvd 1948	. . . 4 ⊢ (𝑞 = 𝑜 → Ⅎ𝑥 𝑜 ∈ 𝑦)
67		elequ12 2163	. . . . 5 ⊢ ((𝑞 = 𝑜 ∧ 𝑥 = 𝑦) → (𝑞 ∈ 𝑥 ↔ 𝑜 ∈ 𝑦))
68	67	ex 418	. . . 4 ⊢ (𝑞 = 𝑜 → (𝑥 = 𝑦 → (𝑞 ∈ 𝑥 ↔ 𝑜 ∈ 𝑦)))
69	63, 64, 65, 66, 68	cbvreud 38296	. . 3 ⊢ (𝑞 = 𝑜 → (∃!𝑥 ∈ ran 𝐹 𝑞 ∈ 𝑥 ↔ ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦))
70	69	cbvralvw 3241	. 2 ⊢ (∀𝑞 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑞 ∈ 𝑥 ↔ ∀𝑜 ∈ 𝐴 ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦)
71	62, 70	sylibr 237	1 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑞 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑞 ∈ 𝑥)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  ∃!wreu 3364   ∩ cin 3898  {csn 4584  ran crn 5652   Fn wfn 6533  ⟶wf 6534  –1-1→wf1 6535  ‘cfv 6538

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-11 2194  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-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  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-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fv 6546

This theorem is used by:  fvineqsneq  38335