Theorem fpropnf1 40337

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 22	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉))
2	1	3adant3 1074	. . . . . 6 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉))
3	2	adantr 480	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉))
4		id 22	. . . . . . . 8 ⊢ (𝑍 ∈ 𝑊 → 𝑍 ∈ 𝑊)
5	4, 4	jca 553	. . . . . . 7 ⊢ (𝑍 ∈ 𝑊 → (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊))
6	5	3ad2ant3 1077	. . . . . 6 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊))
7	6	adantr 480	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊))
8		simpr 476	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌)
9	3, 7, 8	3jca 1235	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) ∧ (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
10		funprg 5854	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) ∧ (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → Fun {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩})
11	9, 10	syl 17	. . 3 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → Fun {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩})
12		fpropnf1.f	. . . 4 ⊢ 𝐹 = {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}
13	12	funeqi 5824	. . 3 ⊢ (Fun 𝐹 ↔ Fun {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩})
14	11, 13	sylibr 223	. 2 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → Fun 𝐹)
15		neneq 2788	. . . 4 ⊢ (𝑋 ≠ 𝑌 → ¬ 𝑋 = 𝑌)
16	15	adantl 481	. . 3 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌)
17		fprg 6327	. . . . . 6 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) ∧ (𝑍 ∈ 𝑊 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}:{𝑋, 𝑌}⟶{𝑍, 𝑍})
18	9, 17	syl 17	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}:{𝑋, 𝑌}⟶{𝑍, 𝑍})
19	12	eqcomi 2619	. . . . . 6 ⊢ {⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩} = 𝐹
20	19	feq1i 5949	. . . . 5 ⊢ ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}:{𝑋, 𝑌}⟶{𝑍, 𝑍} ↔ 𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍})
21	18, 20	sylib 207	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → 𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍})
22		df-f1 5809	. . . . 5 ⊢ (𝐹:{𝑋, 𝑌}–1-1→{𝑍, 𝑍} ↔ (𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ Fun ◡𝐹))
23		dff13 6416	. . . . . 6 ⊢ (𝐹:{𝑋, 𝑌}–1-1→{𝑍, 𝑍} ↔ (𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ ∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
24		fveq2 6103	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
25	24	eqeq1d 2612	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝐹‘𝑋) = (𝐹‘𝑦)))
26		eqeq1 2614	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑋 → (𝑥 = 𝑦 ↔ 𝑋 = 𝑦))
27	25, 26	imbi12d 333	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑋 → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦)))
28	27	ralbidv 2969	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦)))
29		fveq2 6103	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑌 → (𝐹‘𝑥) = (𝐹‘𝑌))
30	29	eqeq1d 2612	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑌 → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝐹‘𝑌) = (𝐹‘𝑦)))
31		eqeq1 2614	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑌 → (𝑥 = 𝑦 ↔ 𝑌 = 𝑦))
32	30, 31	imbi12d 333	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑌 → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)))
33	32	ralbidv 2969	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑌 → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)))
34	28, 33	ralprg 4181	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦))))
35	34	3adant3 1074	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦))))
36	35	adantr 480	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦))))
37		fveq2 6103	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑋 → (𝐹‘𝑦) = (𝐹‘𝑋))
38	37	eqeq2d 2620	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → ((𝐹‘𝑋) = (𝐹‘𝑦) ↔ (𝐹‘𝑋) = (𝐹‘𝑋)))
39		eqeq2 2621	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → (𝑋 = 𝑦 ↔ 𝑋 = 𝑋))
40	38, 39	imbi12d 333	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑋 → (((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ↔ ((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋)))
41		fveq2 6103	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
42	41	eqeq2d 2620	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑋) = (𝐹‘𝑦) ↔ (𝐹‘𝑋) = (𝐹‘𝑌)))
43		eqeq2 2621	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑋 = 𝑦 ↔ 𝑋 = 𝑌))
44	42, 43	imbi12d 333	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → (((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ↔ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)))
45	40, 44	ralprg 4181	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ↔ (((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌))))
46	37	eqeq2d 2620	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → ((𝐹‘𝑌) = (𝐹‘𝑦) ↔ (𝐹‘𝑌) = (𝐹‘𝑋)))
47		eqeq2 2621	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑋 → (𝑌 = 𝑦 ↔ 𝑌 = 𝑋))
48	46, 47	imbi12d 333	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑋 → (((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦) ↔ ((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋)))
49	41	eqeq2d 2620	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑌) = (𝐹‘𝑦) ↔ (𝐹‘𝑌) = (𝐹‘𝑌)))
50		eqeq2 2621	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑌 → (𝑌 = 𝑦 ↔ 𝑌 = 𝑌))
51	49, 50	imbi12d 333	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → (((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦) ↔ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))
52	48, 51	ralprg 4181	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → (∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦) ↔ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌))))
53	45, 52	anbi12d 743	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) ↔ ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))))
54	53	3adant3 1074	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) ↔ ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))))
55	54	adantr 480	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) ↔ ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌)))))
56	12	fveq1i 6104	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑋) = ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑋)
57		3simpb 1052	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊))
58	57	anim1i 590	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
59		df-3an 1033	. . . . . . . . . . . . . . . 16 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) ↔ ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
60	58, 59	sylibr 223	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌))
61		fvpr1g 6363	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑋) = 𝑍)
62	60, 61	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑋) = 𝑍)
63	56, 62	syl5eq 2656	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝐹‘𝑋) = 𝑍)
64	12	fveq1i 6104	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑌) = ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑌)
65		3simpc 1053	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊))
66	65	anim1i 590	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
67		df-3an 1033	. . . . . . . . . . . . . . . 16 ⊢ ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) ↔ ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌))
68	66, 67	sylibr 223	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌))
69		fvpr2g 6364	. . . . . . . . . . . . . . 15 ⊢ ((𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊 ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑌) = 𝑍)
70	68, 69	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ({⟨𝑋, 𝑍⟩, ⟨𝑌, 𝑍⟩}‘𝑌) = 𝑍)
71	64, 70	syl5req 2657	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → 𝑍 = (𝐹‘𝑌))
72	63, 71	eqtrd 2644	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝐹‘𝑋) = (𝐹‘𝑌))
73		idd 24	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝑋 = 𝑌 → 𝑋 = 𝑌))
74	72, 73	embantd 57	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌) → 𝑋 = 𝑌))
75	74	adantld 482	. . . . . . . . . 10 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) → 𝑋 = 𝑌))
76	75	adantrd 483	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (((((𝐹‘𝑋) = (𝐹‘𝑋) → 𝑋 = 𝑋) ∧ ((𝐹‘𝑋) = (𝐹‘𝑌) → 𝑋 = 𝑌)) ∧ (((𝐹‘𝑌) = (𝐹‘𝑋) → 𝑌 = 𝑋) ∧ ((𝐹‘𝑌) = (𝐹‘𝑌) → 𝑌 = 𝑌))) → 𝑋 = 𝑌))
77	55, 76	sylbid 229	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑋) = (𝐹‘𝑦) → 𝑋 = 𝑦) ∧ ∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑌) = (𝐹‘𝑦) → 𝑌 = 𝑦)) → 𝑋 = 𝑌))
78	36, 77	sylbid 229	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) → 𝑋 = 𝑌))
79	78	adantld 482	. . . . . 6 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ ∀𝑥 ∈ {𝑋, 𝑌}∀𝑦 ∈ {𝑋, 𝑌} ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)) → 𝑋 = 𝑌))
80	23, 79	syl5bi 231	. . . . 5 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (𝐹:{𝑋, 𝑌}–1-1→{𝑍, 𝑍} → 𝑋 = 𝑌))
81	22, 80	syl5bir 232	. . . 4 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ((𝐹:{𝑋, 𝑌}⟶{𝑍, 𝑍} ∧ Fun ◡𝐹) → 𝑋 = 𝑌))
82	21, 81	mpand 707	. . 3 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (Fun ◡𝐹 → 𝑋 = 𝑌))
83	16, 82	mtod 188	. 2 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → ¬ Fun ◡𝐹)
84	14, 83	jca 553	1 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ 𝑋 ≠ 𝑌) → (Fun 𝐹 ∧ ¬ Fun ◡𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  {cpr 4127  ⟨cop 4131  ^◡ccnv 5037  Fun wfun 5798  ⟶wf 5800  –1-1→wf1 5801  ‘cfv 5804

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fv 5812

This theorem is referenced by:  ntrl2v2e  41325