Theorem fpropnf1 7271

Description: A function, given by an unordered pair of ordered pairs, which is not injective/one-to-one. (Contributed by Alexander van der Vekens, 22-Oct-2017.) (Revised by AV, 8-Jan-2021.)

Hypothesis

Ref	Expression
fpropnf1.f	⊢ 𝐹 = {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}

Assertion

Ref	Expression
fpropnf1	⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (Fun 𝐹 ∧ ¬ Fun ◡𝐹))

Proof of Theorem fpropnf1

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

Step	Hyp	Ref	Expression
1		id 23	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉))
2	1	3adant3 1150	. . . . . 6 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉))
3	2	adantr 486	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉))
4		id 23	. . . . . . . 8 ⊢ (𝑍 ∈ 𝑊 → 𝑍 ∈ 𝑊)
5	4, 4	jca 521	. . . . . . 7 ⊢ (𝑍 ∈ 𝑊 → (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊))
6	5	3ad2ant3 1153	. . . . . 6 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊))
7	6	adantr 486	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊))
8		simpr 490	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌)
9	3, 7, 8	3jca 1146	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) ∧ (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
10		funprg 6594	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) ∧ (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → Fun {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩})
11	9, 10	syl 18	. . 3 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → Fun {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩})
12		fpropnf1.f	. . . 4 ⊢ 𝐹 = {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}
13	12	funeqi 6560	. . 3 ⊢ (Fun 𝐹 ↔ Fun {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩})
14	11, 13	sylibr 237	. 2 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → Fun 𝐹)
15		neneq 2962	. . . 4 ⊢ (𝑋 ≠ 𝑌 → ¬ 𝑋 = 𝑌)
16	15	adantl 487	. . 3 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌)
17		fprg 7159	. . . . . 6 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) ∧ (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}:{𝑋, 𝑌}⟶{𝑍, 𝑍})
18	9, 17	syl 18	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}:{𝑋, 𝑌}⟶{𝑍, 𝑍})
19	12	eqcomi 2770	. . . . . 6 ⊢ {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩} = 𝐹
20	19	feq1i 6700	. . . . 5 ⊢ ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}:{𝑋, 𝑌}⟶{𝑍, 𝑍} ↔ 𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍})
21	18, 20	sylib 221	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → 𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍})
22		df-f1 6543	. . . . 5 ⊢ (𝐹:{𝑋, 𝑌}–1-1→{𝑍, 𝑍} ↔ (𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ Fun ◡𝐹))
23		dff13 7258	. . . . . 6 ⊢ (𝐹:{𝑋, 𝑌}–1-1→{𝑍, 𝑍} ↔ (𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ ∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
24		fveqeq2 6894	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝐹‘𝑋) = (𝐹‘𝑦)))
25		eqeq1 2765	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑋 → (𝑥 = 𝑦 ↔ 𝑋 = 𝑦))
26	24, 25	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑋 → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦)))
27	26	ralbidv 3186	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦)))
28		fveqeq2 6894	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑌 → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝐹‘𝑌) = (𝐹‘𝑦)))
29		eqeq1 2765	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑌 → (𝑥 = 𝑦 ↔ 𝑌 = 𝑦))
30	28, 29	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑌 → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)))
31	30	ralbidv 3186	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑌 → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)))
32	27, 31	ralprg 4657	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦))))
33	32	3adant3 1150	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦))))
34	33	adantr 486	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦))))
35		fveq2 6885	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑋 → (𝐹‘𝑦) = (𝐹‘𝑋))
36	35	eqeq2d 2772	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → ((𝐹‘𝑋) = (𝐹‘𝑦) ↔ (𝐹‘𝑋) = (𝐹‘𝑋)))
37		eqeq2 2773	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → (𝑋 = 𝑦 ↔ 𝑋 = 𝑋))
38	36, 37	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑋 → (((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ↔ ((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋)))
39		fveq2 6885	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
40	39	eqeq2d 2772	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑋) = (𝐹‘𝑦) ↔ (𝐹‘𝑋) = (𝐹‘𝑌)))
41		eqeq2 2773	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑋 = 𝑦 ↔ 𝑋 = 𝑌))
42	40, 41	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → (((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ↔ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)))
43	38, 42	ralprg 4657	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ↔ (((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌))))
44	35	eqeq2d 2772	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → ((𝐹‘𝑌) = (𝐹‘𝑦) ↔ (𝐹‘𝑌) = (𝐹‘𝑋)))
45		eqeq2 2773	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → (𝑌 = 𝑦 ↔ 𝑌 = 𝑋))
46	44, 45	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑋 → (((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦) ↔ ((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋)))
47	39	eqeq2d 2772	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑌) = (𝐹‘𝑦) ↔ (𝐹‘𝑌) = (𝐹‘𝑌)))
48		eqeq2 2773	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑌 = 𝑦 ↔ 𝑌 = 𝑌))
49	47, 48	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → (((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦) ↔ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))
50	46, 49	ralprg 4657	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦) ↔ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌))))
51	43, 50	anbi12d 644	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) ↔ ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))))
52	51	3adant3 1150	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) ↔ ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))))
53	52	adantr 486	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) ↔ ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))))
54	12	fveq1i 6886	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑋) = ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑋)
55		3simpb 1167	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊))
56	55	anim1i 627	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
57		df-3an 1105	. . . . . . . . . . . . . . . 16 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) ↔ ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
58	56, 57	sylibr 237	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌))
59		fvpr1g 7195	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑋) = 𝑍)
60	58, 59	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑋) = 𝑍)
61	54, 60	eqtrid 2808	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝐹‘𝑋) = 𝑍)
62	12	fveq1i 6886	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑌) = ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑌)
63		3simpc 1168	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊))
64	63	anim1i 627	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
65		df-3an 1105	. . . . . . . . . . . . . . . 16 ⊢ ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) ↔ ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
66	64, 65	sylibr 237	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌))
67		fvpr2g 7196	. . . . . . . . . . . . . . 15 ⊢ ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑌) = 𝑍)
68	66, 67	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑌) = 𝑍)
69	62, 68	eqtr2id 2809	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → 𝑍 = (𝐹‘𝑌))
70	61, 69	eqtrd 2796	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝐹‘𝑋) = (𝐹‘𝑌))
71		idd 25	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑋 = 𝑌 → 𝑋 = 𝑌))
72	70, 71	embantd 60	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌) → 𝑋 = 𝑌))
73	72	adantld 496	. . . . . . . . . 10 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) → 𝑋 = 𝑌))
74	73	adantrd 497	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌))) → 𝑋 = 𝑌))
75	53, 74	sylbid 243	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) → 𝑋 = 𝑌))
76	34, 75	sylbid 243	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) → 𝑋 = 𝑌))
77	76	adantld 496	. . . . . 6 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ ∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)) → 𝑋 = 𝑌))
78	23, 77	biimtrid 245	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝐹:{𝑋, 𝑌}–1-1→{𝑍, 𝑍} → 𝑋 = 𝑌))
79	22, 78	biimtrrid 246	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ Fun ◡𝐹) → 𝑋 = 𝑌))
80	21, 79	mpand 708	. . 3 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (Fun ◡𝐹 → 𝑋 = 𝑌))
81	16, 80	mtod 201	. 2 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ¬ Fun ◡𝐹)
82	14, 81	jca 521	1 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (Fun 𝐹 ∧ ¬ Fun ◡𝐹))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  {cpr 4586  ⟨cop 4590  ^◡ccnv 5650  Fun wfun 6532  ⟶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-ne 2957  df-ral 3078  df-rex 3088  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-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fv 6546

This theorem is used by:  ntrl2v2e  30759