Theorem fvineqsneq 38086

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

Assertion

Ref	Expression
fvineqsneq	⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑍 ⊆ ran 𝐹 ∧ 𝐴 ⊆ ∪ 𝑍)) → 𝑍 = ran 𝐹)

Distinct variable groups:   𝐴,𝑝   𝐹,𝑝   𝑍,𝑝

Proof of Theorem fvineqsneq

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pssnel 4430	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑍 ⊊ ran 𝐹 → ∃𝑥(𝑥 ∈ ran 𝐹 ∧ ¬ 𝑥 ∈ 𝑍))
2	1	adantl 486	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑥(𝑥 ∈ ran 𝐹 ∧ ¬ 𝑥 ∈ 𝑍))
3		df-rex 3089	. . . . . . . . . . . . . . . . . . 19 ⊢ (∃𝑥 ∈ ran 𝐹 ¬ 𝑥 ∈ 𝑍 ↔ ∃𝑥(𝑥 ∈ ran 𝐹 ∧ ¬ 𝑥 ∈ 𝑍))
4	2, 3	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑥 ∈ ran 𝐹 ¬ 𝑥 ∈ 𝑍)
5		fnrnfv 6940	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑥 ∣ ∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)})
6	5	eqabrd 2903	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐹 Fn 𝐴 → (𝑥 ∈ ran 𝐹 ↔ ∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)))
7	6	biimpd 232	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐹 Fn 𝐴 → (𝑥 ∈ ran 𝐹 → ∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)))
8	7	ralrimiv 3155	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐹 Fn 𝐴 → ∀𝑥 ∈ ran 𝐹∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝))
9	8	adantr 485	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑥 ∈ ran 𝐹∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝))
10	9	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∀𝑥 ∈ ran 𝐹∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝))
11		r19.29r 3128	. . . . . . . . . . . . . . . . . 18 ⊢ ((∃𝑥 ∈ ran 𝐹 ¬ 𝑥 ∈ 𝑍 ∧ ∀𝑥 ∈ ran 𝐹∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)) → ∃𝑥 ∈ ran 𝐹(¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)))
12	4, 10, 11	syl2anc 595	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑥 ∈ ran 𝐹(¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)))
13		nfra1 3288	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑝∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}
14		rsp 3252	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ 𝐴 → ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}))
15		vsnid 4628	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ 𝑝 ∈ {𝑝}
16		eleq2 2851	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ ((𝐹‘𝑝) ∩ 𝐴) ↔ 𝑝 ∈ {𝑝}))
17	15, 16	mpbiri 261	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → 𝑝 ∈ ((𝐹‘𝑝) ∩ 𝐴))
18	17	elin1d 4156	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → 𝑝 ∈ (𝐹‘𝑝))
19	14, 18	syl6 36	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ 𝐴 → 𝑝 ∈ (𝐹‘𝑝)))
20	19	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ 𝑥 = (𝐹‘𝑝)) → (𝑝 ∈ 𝐴 → 𝑝 ∈ (𝐹‘𝑝)))
21		eleq2 2851	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑥 = (𝐹‘𝑝) → (𝑝 ∈ 𝑥 ↔ 𝑝 ∈ (𝐹‘𝑝)))
22	21	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ 𝑥 = (𝐹‘𝑝)) → (𝑝 ∈ 𝑥 ↔ 𝑝 ∈ (𝐹‘𝑝)))
23	20, 22	sylibrd 262	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} ∧ 𝑥 = (𝐹‘𝑝)) → (𝑝 ∈ 𝐴 → 𝑝 ∈ 𝑥))
24	23	ex 417	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑥 = (𝐹‘𝑝) → (𝑝 ∈ 𝐴 → 𝑝 ∈ 𝑥)))
25	24	com23 87	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (𝑝 ∈ 𝐴 → (𝑥 = (𝐹‘𝑝) → 𝑝 ∈ 𝑥)))
26	13, 25	reximdai 3266	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝} → (∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝) → ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥))
27	26	adantl 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝) → ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥))
28	27	adantr 485	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝) → ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥))
29	28	anim2d 623	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ((¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)) → (¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥)))
30	29	reximdv 3179	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (∃𝑥 ∈ ran 𝐹(¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑥 = (𝐹‘𝑝)) → ∃𝑥 ∈ ran 𝐹(¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥)))
31	12, 30	mpd 16	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑥 ∈ ran 𝐹(¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥))
32		ancom 465	. . . . . . . . . . . . . . . . . 18 ⊢ ((¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥) ↔ (∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
33		r19.41v 3194	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑝 ∈ 𝐴 (𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ↔ (∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
34	32, 33	bitr4i 281	. . . . . . . . . . . . . . . . 17 ⊢ ((¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥) ↔ ∃𝑝 ∈ 𝐴 (𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
35	34	rexbii 3111	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑥 ∈ ran 𝐹(¬ 𝑥 ∈ 𝑍 ∧ ∃𝑝 ∈ 𝐴 𝑝 ∈ 𝑥) ↔ ∃𝑥 ∈ ran 𝐹∃𝑝 ∈ 𝐴 (𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
36	31, 35	sylib 221	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑥 ∈ ran 𝐹∃𝑝 ∈ 𝐴 (𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
37		rexcom 3293	. . . . . . . . . . . . . . 15 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ↔ ∃𝑥 ∈ ran 𝐹∃𝑝 ∈ 𝐴 (𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
38	36, 37	sylibr 237	. . . . . . . . . . . . . 14 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
39		nfre1 3289	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍)
40	39	19.3 2237	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ↔ ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
41		alral 3093	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → ∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
42	40, 41	sylbir 238	. . . . . . . . . . . . . . 15 ⊢ (∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → ∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
43	42	reximi 3102	. . . . . . . . . . . . . 14 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → ∃𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
44	38, 43	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍))
45		nfv 1943	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑝 𝐹 Fn 𝐴
46	45, 13	nfan 1928	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑝(𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝})
47		nfv 1943	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑝 𝑍 ⊊ ran 𝐹
48	46, 47	nfan 1928	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑝((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹)
49		nfv 1943	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥(((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ 𝑝 ∈ 𝐴)
50		fvineqsneu 38085	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → ∀𝑝 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥)
51	50	adantr 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∀𝑝 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥)
52		rsp 3252	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∀𝑝 ∈ 𝐴 ∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥 → (𝑝 ∈ 𝐴 → ∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥))
53	51, 52	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (𝑝 ∈ 𝐴 → ∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥))
54	53	adantrd 496	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ((𝑝 ∈ 𝐴 ∧ 𝑥 ∈ ran 𝐹) → ∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥))
55	54	imp 411	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ (𝑝 ∈ 𝐴 ∧ 𝑥 ∈ ran 𝐹)) → ∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥)
56		reupick3 4282	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥 ∧ ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ∧ 𝑥 ∈ ran 𝐹) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))
57	56	3expa 1135	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥 ∧ ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍)) ∧ 𝑥 ∈ ran 𝐹) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))
58	57	expcom 418	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ran 𝐹 → ((∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥 ∧ ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍)) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)))
59	58	adantl 486	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑝 ∈ 𝐴 ∧ 𝑥 ∈ ran 𝐹) → ((∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥 ∧ ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍)) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)))
60	59	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ (𝑝 ∈ 𝐴 ∧ 𝑥 ∈ ran 𝐹)) → ((∃!𝑥 ∈ ran 𝐹 𝑝 ∈ 𝑥 ∧ ∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍)) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)))
61	55, 60	mpand 707	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ (𝑝 ∈ 𝐴 ∧ 𝑥 ∈ ran 𝐹)) → (∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)))
62	61	expr 461	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ 𝑝 ∈ 𝐴) → (𝑥 ∈ ran 𝐹 → (∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))))
63	49, 62	ralrimi 3262	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ 𝑝 ∈ 𝐴) → ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)))
64	63	ex 417	. . . . . . . . . . . . . 14 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (𝑝 ∈ 𝐴 → ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))))
65	48, 64	ralrimi 3262	. . . . . . . . . . . . 13 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∀𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)))
66		r19.29r 3128	. . . . . . . . . . . . 13 ⊢ ((∃𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ∧ ∀𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))) → ∃𝑝 ∈ 𝐴 (∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ∧ ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))))
67	44, 65, 66	syl2anc 595	. . . . . . . . . . . 12 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 (∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ∧ ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))))
68		ralim 3104	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)) → (∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → ∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍)))
69	68	impcom 412	. . . . . . . . . . . . 13 ⊢ ((∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ∧ ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))) → ∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))
70	69	reximi 3102	. . . . . . . . . . . 12 ⊢ (∃𝑝 ∈ 𝐴 (∀𝑥 ∈ ran 𝐹∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) ∧ ∀𝑥 ∈ ran 𝐹(∃𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 ∧ ¬ 𝑥 ∈ 𝑍) → (𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))) → ∃𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))
71	67, 70	syl 18	. . . . . . . . . . 11 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍))
72		con2b 362	. . . . . . . . . . . . . . 15 ⊢ ((𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍) ↔ (𝑥 ∈ 𝑍 → ¬ 𝑝 ∈ 𝑥))
73	72	ralbii 3110	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍) ↔ ∀𝑥 ∈ ran 𝐹(𝑥 ∈ 𝑍 → ¬ 𝑝 ∈ 𝑥))
74		df-ral 3079	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ ran 𝐹(𝑥 ∈ 𝑍 → ¬ 𝑝 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ ran 𝐹 → (𝑥 ∈ 𝑍 → ¬ 𝑝 ∈ 𝑥)))
75		bi2.04 391	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ran 𝐹 → (𝑥 ∈ 𝑍 → ¬ 𝑝 ∈ 𝑥)) ↔ (𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
76	75	albii 1848	. . . . . . . . . . . . . 14 ⊢ (∀𝑥(𝑥 ∈ ran 𝐹 → (𝑥 ∈ 𝑍 → ¬ 𝑝 ∈ 𝑥)) ↔ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
77	73, 74, 76	3bitri 300	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍) ↔ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
78	77	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍) ↔ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))))
79	48, 78	rexbid 3278	. . . . . . . . . . 11 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (∃𝑝 ∈ 𝐴 ∀𝑥 ∈ ran 𝐹(𝑝 ∈ 𝑥 → ¬ 𝑥 ∈ 𝑍) ↔ ∃𝑝 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))))
80	71, 79	mpbid 235	. . . . . . . . . 10 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
81		nfv 1943	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹)
82		nfa1 2185	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))
83	81, 82	nfan 1928	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥(((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
84		pssss 4051	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑍 ⊊ ran 𝐹 → 𝑍 ⊆ ran 𝐹)
85		df-ss 3921	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑍 ⊆ ran 𝐹 ↔ ∀𝑥(𝑥 ∈ 𝑍 → 𝑥 ∈ ran 𝐹))
86	84, 85	sylib 221	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑍 ⊊ ran 𝐹 → ∀𝑥(𝑥 ∈ 𝑍 → 𝑥 ∈ ran 𝐹))
87	86	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∀𝑥(𝑥 ∈ 𝑍 → 𝑥 ∈ ran 𝐹))
88		df-ral 3079	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑥 ∈ 𝑍 𝑥 ∈ ran 𝐹 ↔ ∀𝑥(𝑥 ∈ 𝑍 → 𝑥 ∈ ran 𝐹))
89	87, 88	sylibr 237	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∀𝑥 ∈ 𝑍 𝑥 ∈ ran 𝐹)
90	89	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))) → ∀𝑥 ∈ 𝑍 𝑥 ∈ ran 𝐹)
91		rsp 3252	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥 ∈ 𝑍 𝑥 ∈ ran 𝐹 → (𝑥 ∈ 𝑍 → 𝑥 ∈ ran 𝐹))
92	90, 91	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))) → (𝑥 ∈ 𝑍 → 𝑥 ∈ ran 𝐹))
93		df-ral 3079	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑥 ∈ 𝑍 (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
94	93	bilanri 511	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))) → ∀𝑥 ∈ 𝑍 (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))
95		rsp 3252	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥 ∈ 𝑍 (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥) → (𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
96	94, 95	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))) → (𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)))
97	92, 96	mpdd 44	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))) → (𝑥 ∈ 𝑍 → ¬ 𝑝 ∈ 𝑥))
98	83, 97	ralrimi 3262	. . . . . . . . . . . . 13 ⊢ ((((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) ∧ ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥))) → ∀𝑥 ∈ 𝑍 ¬ 𝑝 ∈ 𝑥)
99	98	ex 417	. . . . . . . . . . . 12 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)) → ∀𝑥 ∈ 𝑍 ¬ 𝑝 ∈ 𝑥))
100	99	a1d 26	. . . . . . . . . . 11 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (𝑝 ∈ 𝐴 → (∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)) → ∀𝑥 ∈ 𝑍 ¬ 𝑝 ∈ 𝑥)))
101	48, 100	reximdai 3266	. . . . . . . . . 10 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → (∃𝑝 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑍 → (𝑥 ∈ ran 𝐹 → ¬ 𝑝 ∈ 𝑥)) → ∃𝑝 ∈ 𝐴 ∀𝑥 ∈ 𝑍 ¬ 𝑝 ∈ 𝑥))
102	80, 101	mpd 16	. . . . . . . . 9 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 ∀𝑥 ∈ 𝑍 ¬ 𝑝 ∈ 𝑥)
103		ralnex 3090	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ 𝑍 ¬ 𝑝 ∈ 𝑥 ↔ ¬ ∃𝑥 ∈ 𝑍 𝑝 ∈ 𝑥)
104	103	rexbii 3111	. . . . . . . . 9 ⊢ (∃𝑝 ∈ 𝐴 ∀𝑥 ∈ 𝑍 ¬ 𝑝 ∈ 𝑥 ↔ ∃𝑝 ∈ 𝐴 ¬ ∃𝑥 ∈ 𝑍 𝑝 ∈ 𝑥)
105	102, 104	sylib 221	. . . . . . . 8 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 ¬ ∃𝑥 ∈ 𝑍 𝑝 ∈ 𝑥)
106		eluni2 4875	. . . . . . . . . 10 ⊢ (𝑝 ∈ ∪ 𝑍 ↔ ∃𝑥 ∈ 𝑍 𝑝 ∈ 𝑥)
107	106	notbii 323	. . . . . . . . 9 ⊢ (¬ 𝑝 ∈ ∪ 𝑍 ↔ ¬ ∃𝑥 ∈ 𝑍 𝑝 ∈ 𝑥)
108	107	rexbii 3111	. . . . . . . 8 ⊢ (∃𝑝 ∈ 𝐴 ¬ 𝑝 ∈ ∪ 𝑍 ↔ ∃𝑝 ∈ 𝐴 ¬ ∃𝑥 ∈ 𝑍 𝑝 ∈ 𝑥)
109	105, 108	sylibr 237	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ∃𝑝 ∈ 𝐴 ¬ 𝑝 ∈ ∪ 𝑍)
110		dfss3 3925	. . . . . . . . 9 ⊢ (𝐴 ⊆ ∪ 𝑍 ↔ ∀𝑝 ∈ 𝐴 𝑝 ∈ ∪ 𝑍)
111		dfral2 3115	. . . . . . . . 9 ⊢ (∀𝑝 ∈ 𝐴 𝑝 ∈ ∪ 𝑍 ↔ ¬ ∃𝑝 ∈ 𝐴 ¬ 𝑝 ∈ ∪ 𝑍)
112	110, 111	bitri 278	. . . . . . . 8 ⊢ (𝐴 ⊆ ∪ 𝑍 ↔ ¬ ∃𝑝 ∈ 𝐴 ¬ 𝑝 ∈ ∪ 𝑍)
113	112	con2bii2 38007	. . . . . . 7 ⊢ (¬ 𝐴 ⊆ ∪ 𝑍 ↔ ∃𝑝 ∈ 𝐴 ¬ 𝑝 ∈ ∪ 𝑍)
114	109, 113	sylibr 237	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ 𝑍 ⊊ ran 𝐹) → ¬ 𝐴 ⊆ ∪ 𝑍)
115	114	ex 417	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑍 ⊊ ran 𝐹 → ¬ 𝐴 ⊆ ∪ 𝑍))
116	115	con2d 135	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝐴 ⊆ ∪ 𝑍 → ¬ 𝑍 ⊊ ran 𝐹))
117		npss 4067	. . . 4 ⊢ (¬ 𝑍 ⊊ ran 𝐹 ↔ (𝑍 ⊆ ran 𝐹 → 𝑍 = ran 𝐹))
118	116, 117	imbitrdi 254	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝐴 ⊆ ∪ 𝑍 → (𝑍 ⊆ ran 𝐹 → 𝑍 = ran 𝐹)))
119	118	com23 87	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) → (𝑍 ⊆ ran 𝐹 → (𝐴 ⊆ ∪ 𝑍 → 𝑍 = ran 𝐹)))
120	119	imp32 423	1 ⊢ (((𝐹 Fn 𝐴 ∧ ∀𝑝 ∈ 𝐴 ((𝐹‘𝑝) ∩ 𝐴) = {𝑝}) ∧ (𝑍 ⊆ ran 𝐹 ∧ 𝐴 ⊆ ∪ 𝑍)) → 𝑍 = ran 𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1567   = wceq 1569  ∃wex 1808   ∈ wcel 2142  ∀wral 3078  ∃wrex 3088  ∃!wreu 3366   ∩ cin 3903   ⊆ wss 3904   ⊊ wpss 3905  {csn 4588  ∪ cuni 4871  ran crn 5661   Fn wfn 6531  ‘cfv 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fv 6544

This theorem is used by:  pibt2  38091