Theorem fvineqsneu 35882

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 7031	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑜 ∈ 𝐴) → (𝐹‘𝑜) ∈ ran 𝐹)
2	1	ex 413	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑜 ∈ 𝐴 → (𝐹‘𝑜) ∈ ran 𝐹))
3	2	adantr 481	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → (𝐹‘𝑜) ∈ ran 𝐹))
4		fnrnfv 6902	. . . . . . . . . 10 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝)})
5	4	eqabd 2880	. . . . . . . . 9 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝)))
6	5	adantr 481	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑦 ∈ ran 𝐹 ↔ ∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝)))
7		nfv 1917	. . . . . . . . . 10 ⊢ Ⅎ𝑝 𝐹 Fn 𝐴
8		nfra1 3267	. . . . . . . . . 10 ⊢ Ⅎ𝑝∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}
9	7, 8	nfan 1902	. . . . . . . . 9 ⊢ Ⅎ𝑝(𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
10		nfv 1917	. . . . . . . . 9 ⊢ Ⅎ𝑝∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))
11		eleq2 2826	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = (𝐹‘𝑝) → (𝑜 ∈ 𝑦 ↔ 𝑜 ∈ (𝐹‘𝑝)))
12		elin 3926	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ (𝑜 ∈ (𝐹‘𝑝) ∧ 𝑜 ∈ 𝐴))
13	12	rbaib 539	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑜 ∈ 𝐴 → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑜 ∈ (𝐹‘𝑝)))
14	13	ad2antll 727	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑜 ∈ (𝐹‘𝑝)))
15		rsp 3230	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ 𝐴 → ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}))
16		eleq2 2826	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑜 ∈ {𝑝}))
17		velsn 4602	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑜 ∈ {𝑝} ↔ 𝑜 = 𝑝)
18		equcom 2021	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑜 = 𝑝 ↔ 𝑝 = 𝑜)
19	17, 18	bitri 274	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑜 ∈ {𝑝} ↔ 𝑝 = 𝑜)
20	16, 19	bitrdi 286	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜))
21	15, 20	syl6 35	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ 𝐴 → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜)))
22	21	adantl 482	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜)))
23	22	adantrd 492	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ((𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴) → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜)))
24	23	imp 407	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑜 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 = 𝑜))
25	14, 24	bitr3d 280	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑜 ∈ (𝐹‘𝑝) ↔ 𝑝 = 𝑜))
26	11, 25	sylan9bbr 511	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) ∧ 𝑦 = (𝐹‘𝑝)) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜))
27	26	ex 413	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑦 = (𝐹‘𝑝) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜)))
28	27	anass1rs 653	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) → (𝑦 = (𝐹‘𝑝) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜)))
29	28	impr 455	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜))
30	29	an32s 650	. . . . . . . . . . . . 13 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) ∧ 𝑜 ∈ 𝐴) → (𝑜 ∈ 𝑦 ↔ 𝑝 = 𝑜))
31		eqeq1 2740	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = (𝐹‘𝑝) → (𝑦 = (𝐹‘𝑜) ↔ (𝐹‘𝑝) = (𝐹‘𝑜)))
32		dffn3 6681	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
33		fvineqsnf1 35881	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐹:𝐴⟶ran 𝐹 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → 𝐹:𝐴–1-1→ran 𝐹)
34	32, 33	sylanb 581	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → 𝐹:𝐴–1-1→ran 𝐹)
35		dff13 7202	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐹:𝐴–1-1→ran 𝐹 ↔ (𝐹:𝐴⟶ran 𝐹 ∧ ∀𝑝 ∈ 𝐴 ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
36	34, 35	sylib 217	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝐹:𝐴⟶ran 𝐹 ∧ ∀𝑝 ∈ 𝐴 ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
37	36	simprd 496	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑝 ∈ 𝐴 ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜))
38		rsp 3230	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∀𝑝 ∈ 𝐴 ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜) → (𝑝 ∈ 𝐴 → ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
39	37, 38	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → ∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
40		rsp 3230	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∀𝑜 ∈ 𝐴 ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜) → (𝑜 ∈ 𝐴 → ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜)))
41	39, 40	syl6 35	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → (𝑜 ∈ 𝐴 → ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜))))
42	41	imp32 419	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → ((𝐹‘𝑝) = (𝐹‘𝑜) → 𝑝 = 𝑜))
43		fveq2 6842	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑝 = 𝑜 → (𝐹‘𝑝) = (𝐹‘𝑜))
44	42, 43	impbid1 224	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → ((𝐹‘𝑝) = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
45	31, 44	sylan9bbr 511	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) ∧ 𝑦 = (𝐹‘𝑝)) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
46	45	ex 413	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑜 ∈ 𝐴)) → (𝑦 = (𝐹‘𝑝) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜)))
47	46	anass1rs 653	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) → (𝑦 = (𝐹‘𝑝) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜)))
48	47	impr 455	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑜 ∈ 𝐴) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
49	48	an32s 650	. . . . . . . . . . . . 13 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) ∧ 𝑜 ∈ 𝐴) → (𝑦 = (𝐹‘𝑜) ↔ 𝑝 = 𝑜))
50	30, 49	bitr4d 281	. . . . . . . . . . . 12 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) ∧ 𝑜 ∈ 𝐴) → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))
51	50	ex 413	. . . . . . . . . . 11 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → (𝑜 ∈ 𝐴 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
52	51	ralrimiv 3142	. . . . . . . . . 10 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑝 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑝))) → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))
53	52	exp32 421	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑝 ∈ 𝐴 → (𝑦 = (𝐹‘𝑝) → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))))
54	9, 10, 53	rexlimd 3249	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (∃𝑝 ∈ 𝐴 𝑦 = (𝐹‘𝑝) → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
55	6, 54	sylbid 239	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑦 ∈ ran 𝐹 → ∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
56		rsp 3230	. . . . . . 7 ⊢ (∀𝑜 ∈ 𝐴 (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)) → (𝑜 ∈ 𝐴 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
57	55, 56	syl6 35	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑦 ∈ ran 𝐹 → (𝑜 ∈ 𝐴 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))))
58	57	com23 86	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → (𝑦 ∈ ran 𝐹 → (𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)))))
59	58	ralrimdv 3149	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → ∀𝑦 ∈ ran 𝐹(𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))))
60		reu6i 3686	. . . . 5 ⊢ (((𝐹‘𝑜) ∈ ran 𝐹 ∧ ∀𝑦 ∈ ran 𝐹(𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜))) → ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦)
61	60	ex 413	. . . 4 ⊢ ((𝐹‘𝑜) ∈ ran 𝐹 → (∀𝑦 ∈ ran 𝐹(𝑜 ∈ 𝑦 ↔ 𝑦 = (𝐹‘𝑜)) → ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦))
62	3, 59, 61	syl6c 70	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑜 ∈ 𝐴 → ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦))
63	62	ralrimiv 3142	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑜 ∈ 𝐴 ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦)
64		nfv 1917	. . . 4 ⊢ Ⅎ𝑥 𝑞 = 𝑜
65		nfv 1917	. . . 4 ⊢ Ⅎ𝑦 𝑞 = 𝑜
66		nfvd 1918	. . . 4 ⊢ (𝑞 = 𝑜 → Ⅎ𝑦 𝑞 ∈ 𝑥)
67		nfvd 1918	. . . 4 ⊢ (𝑞 = 𝑜 → Ⅎ𝑥 𝑜 ∈ 𝑦)
68		eleq12 2827	. . . . 5 ⊢ ((𝑞 = 𝑜 ∧ 𝑥 = 𝑦) → (𝑞 ∈ 𝑥 ↔ 𝑜 ∈ 𝑦))
69	68	ex 413	. . . 4 ⊢ (𝑞 = 𝑜 → (𝑥 = 𝑦 → (𝑞 ∈ 𝑥 ↔ 𝑜 ∈ 𝑦)))
70	64, 65, 66, 67, 69	cbvreud 35844	. . 3 ⊢ (𝑞 = 𝑜 → (∃!𝑥 ∈ ran 𝐹 𝑞 ∈ 𝑥 ↔ ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦))
71	70	cbvralvw 3225	. 2 ⊢ (∀𝑞 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑞 ∈ 𝑥 ↔ ∀𝑜 ∈ 𝐴 ∃!𝑦 ∈ ran 𝐹 𝑜 ∈ 𝑦)
72	63, 71	sylibr 233	1 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑞 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑞 ∈ 𝑥)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  ∃wrex 3073  ∃!wreu 3351   ∩ cin 3909  {csn 4586  ran crn 5634   Fn wfn 6491  ⟶wf 6492  –1-1→wf1 6493  ‘cfv 6496

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 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384

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 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fv 6504

This theorem is referenced by:  fvineqsneq  35883