Theorem 2f1fvneq 7297

Description: If two one-to-one functions are applied on different arguments, also the values are different. (Contributed by Alexander van der Vekens, 25-Jan-2018.)

Assertion

Ref	Expression
2f1fvneq	⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → 𝑋 ≠ 𝑌))

Proof of Theorem 2f1fvneq

Step	Hyp	Ref	Expression
1		f1veqaeq 7294	. . . . 5 ⊢ ((𝐹:𝐶–1-1→𝐷 ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐴) = (𝐹‘𝐵) → 𝐴 = 𝐵))
2	1	adantll 713	. . . 4 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐴) = (𝐹‘𝐵) → 𝐴 = 𝐵))
3	2	necon3ad 2959	. . 3 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (𝐴 ≠ 𝐵 → ¬ (𝐹‘𝐴) = (𝐹‘𝐵)))
4	3	3impia 1117	. 2 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → ¬ (𝐹‘𝐴) = (𝐹‘𝐵))
5		simpll 766	. . . . . . 7 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → 𝐸:𝐷–1-1→𝑅)
6		f1f 6817	. . . . . . . . . 10 ⊢ (𝐹:𝐶–1-1→𝐷 → 𝐹:𝐶⟶𝐷)
7		ffvelcdm 7115	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐶⟶𝐷 ∧ 𝐴 ∈ 𝐶) → (𝐹‘𝐴) ∈ 𝐷)
8		ffvelcdm 7115	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐶⟶𝐷 ∧ 𝐵 ∈ 𝐶) → (𝐹‘𝐵) ∈ 𝐷)
9	7, 8	anim12dan 618	. . . . . . . . . . 11 ⊢ ((𝐹:𝐶⟶𝐷 ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐴) ∈ 𝐷 ∧ (𝐹‘𝐵) ∈ 𝐷))
10	9	ex 412	. . . . . . . . . 10 ⊢ (𝐹:𝐶⟶𝐷 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ((𝐹‘𝐴) ∈ 𝐷 ∧ (𝐹‘𝐵) ∈ 𝐷)))
11	6, 10	syl 17	. . . . . . . . 9 ⊢ (𝐹:𝐶–1-1→𝐷 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ((𝐹‘𝐴) ∈ 𝐷 ∧ (𝐹‘𝐵) ∈ 𝐷)))
12	11	adantl 481	. . . . . . . 8 ⊢ ((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ((𝐹‘𝐴) ∈ 𝐷 ∧ (𝐹‘𝐵) ∈ 𝐷)))
13	12	imp 406	. . . . . . 7 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐹‘𝐴) ∈ 𝐷 ∧ (𝐹‘𝐵) ∈ 𝐷))
14		f1veqaeq 7294	. . . . . . 7 ⊢ ((𝐸:𝐷–1-1→𝑅 ∧ ((𝐹‘𝐴) ∈ 𝐷 ∧ (𝐹‘𝐵) ∈ 𝐷)) → ((𝐸‘(𝐹‘𝐴)) = (𝐸‘(𝐹‘𝐵)) → (𝐹‘𝐴) = (𝐹‘𝐵)))
15	5, 13, 14	syl2anc 583	. . . . . 6 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → ((𝐸‘(𝐹‘𝐴)) = (𝐸‘(𝐹‘𝐵)) → (𝐹‘𝐴) = (𝐹‘𝐵)))
16	15	con3dimp 408	. . . . 5 ⊢ ((((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) ∧ ¬ (𝐹‘𝐴) = (𝐹‘𝐵)) → ¬ (𝐸‘(𝐹‘𝐴)) = (𝐸‘(𝐹‘𝐵)))
17		eqeq12 2757	. . . . . . 7 ⊢ (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → ((𝐸‘(𝐹‘𝐴)) = (𝐸‘(𝐹‘𝐵)) ↔ 𝑋 = 𝑌))
18	17	notbid 318	. . . . . 6 ⊢ (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → (¬ (𝐸‘(𝐹‘𝐴)) = (𝐸‘(𝐹‘𝐵)) ↔ ¬ 𝑋 = 𝑌))
19		neqne 2954	. . . . . 6 ⊢ (¬ 𝑋 = 𝑌 → 𝑋 ≠ 𝑌)
20	18, 19	biimtrdi 253	. . . . 5 ⊢ (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → (¬ (𝐸‘(𝐹‘𝐴)) = (𝐸‘(𝐹‘𝐵)) → 𝑋 ≠ 𝑌))
21	16, 20	syl5com 31	. . . 4 ⊢ ((((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) ∧ ¬ (𝐹‘𝐴) = (𝐹‘𝐵)) → (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → 𝑋 ≠ 𝑌))
22	21	ex 412	. . 3 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶)) → (¬ (𝐹‘𝐴) = (𝐹‘𝐵) → (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → 𝑋 ≠ 𝑌)))
23	22	3adant3 1132	. 2 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → (¬ (𝐹‘𝐴) = (𝐹‘𝐵) → (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → 𝑋 ≠ 𝑌)))
24	4, 23	mpd 15	1 ⊢ (((𝐸:𝐷–1-1→𝑅 ∧ 𝐹:𝐶–1-1→𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → (((𝐸‘(𝐹‘𝐴)) = 𝑋 ∧ (𝐸‘(𝐹‘𝐵)) = 𝑌) → 𝑋 ≠ 𝑌))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ⟶wf 6569  –1-1→wf1 6570  ‘cfv 6573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fv 6581

This theorem is referenced by:  usgr2pthlem  29799