MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2f1fvneq Structured version   Visualization version   GIF version

Theorem 2f1fvneq 6471
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
StepHypRef Expression
1 f1veqaeq 6468 . . . . 5 ((𝐹:𝐶1-1𝐷 ∧ (𝐴𝐶𝐵𝐶)) → ((𝐹𝐴) = (𝐹𝐵) → 𝐴 = 𝐵))
21adantll 749 . . . 4 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) → ((𝐹𝐴) = (𝐹𝐵) → 𝐴 = 𝐵))
32necon3ad 2803 . . 3 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) → (𝐴𝐵 → ¬ (𝐹𝐴) = (𝐹𝐵)))
433impia 1258 . 2 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶) ∧ 𝐴𝐵) → ¬ (𝐹𝐴) = (𝐹𝐵))
5 simpll 789 . . . . . . 7 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) → 𝐸:𝐷1-1𝑅)
6 f1f 6058 . . . . . . . . . 10 (𝐹:𝐶1-1𝐷𝐹:𝐶𝐷)
7 ffvelrn 6313 . . . . . . . . . . . 12 ((𝐹:𝐶𝐷𝐴𝐶) → (𝐹𝐴) ∈ 𝐷)
8 ffvelrn 6313 . . . . . . . . . . . 12 ((𝐹:𝐶𝐷𝐵𝐶) → (𝐹𝐵) ∈ 𝐷)
97, 8anim12dan 881 . . . . . . . . . . 11 ((𝐹:𝐶𝐷 ∧ (𝐴𝐶𝐵𝐶)) → ((𝐹𝐴) ∈ 𝐷 ∧ (𝐹𝐵) ∈ 𝐷))
109ex 450 . . . . . . . . . 10 (𝐹:𝐶𝐷 → ((𝐴𝐶𝐵𝐶) → ((𝐹𝐴) ∈ 𝐷 ∧ (𝐹𝐵) ∈ 𝐷)))
116, 10syl 17 . . . . . . . . 9 (𝐹:𝐶1-1𝐷 → ((𝐴𝐶𝐵𝐶) → ((𝐹𝐴) ∈ 𝐷 ∧ (𝐹𝐵) ∈ 𝐷)))
1211adantl 482 . . . . . . . 8 ((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) → ((𝐴𝐶𝐵𝐶) → ((𝐹𝐴) ∈ 𝐷 ∧ (𝐹𝐵) ∈ 𝐷)))
1312imp 445 . . . . . . 7 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) → ((𝐹𝐴) ∈ 𝐷 ∧ (𝐹𝐵) ∈ 𝐷))
14 f1veqaeq 6468 . . . . . . 7 ((𝐸:𝐷1-1𝑅 ∧ ((𝐹𝐴) ∈ 𝐷 ∧ (𝐹𝐵) ∈ 𝐷)) → ((𝐸‘(𝐹𝐴)) = (𝐸‘(𝐹𝐵)) → (𝐹𝐴) = (𝐹𝐵)))
155, 13, 14syl2anc 692 . . . . . 6 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) → ((𝐸‘(𝐹𝐴)) = (𝐸‘(𝐹𝐵)) → (𝐹𝐴) = (𝐹𝐵)))
1615con3dimp 457 . . . . 5 ((((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) ∧ ¬ (𝐹𝐴) = (𝐹𝐵)) → ¬ (𝐸‘(𝐹𝐴)) = (𝐸‘(𝐹𝐵)))
17 eqeq12 2634 . . . . . . 7 (((𝐸‘(𝐹𝐴)) = 𝑋 ∧ (𝐸‘(𝐹𝐵)) = 𝑌) → ((𝐸‘(𝐹𝐴)) = (𝐸‘(𝐹𝐵)) ↔ 𝑋 = 𝑌))
1817notbid 308 . . . . . 6 (((𝐸‘(𝐹𝐴)) = 𝑋 ∧ (𝐸‘(𝐹𝐵)) = 𝑌) → (¬ (𝐸‘(𝐹𝐴)) = (𝐸‘(𝐹𝐵)) ↔ ¬ 𝑋 = 𝑌))
19 df-ne 2791 . . . . . . 7 (𝑋𝑌 ↔ ¬ 𝑋 = 𝑌)
2019biimpri 218 . . . . . 6 𝑋 = 𝑌𝑋𝑌)
2118, 20syl6bi 243 . . . . 5 (((𝐸‘(𝐹𝐴)) = 𝑋 ∧ (𝐸‘(𝐹𝐵)) = 𝑌) → (¬ (𝐸‘(𝐹𝐴)) = (𝐸‘(𝐹𝐵)) → 𝑋𝑌))
2216, 21syl5com 31 . . . 4 ((((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) ∧ ¬ (𝐹𝐴) = (𝐹𝐵)) → (((𝐸‘(𝐹𝐴)) = 𝑋 ∧ (𝐸‘(𝐹𝐵)) = 𝑌) → 𝑋𝑌))
2322ex 450 . . 3 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶)) → (¬ (𝐹𝐴) = (𝐹𝐵) → (((𝐸‘(𝐹𝐴)) = 𝑋 ∧ (𝐸‘(𝐹𝐵)) = 𝑌) → 𝑋𝑌)))
24233adant3 1079 . 2 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶) ∧ 𝐴𝐵) → (¬ (𝐹𝐴) = (𝐹𝐵) → (((𝐸‘(𝐹𝐴)) = 𝑋 ∧ (𝐸‘(𝐹𝐵)) = 𝑌) → 𝑋𝑌)))
254, 24mpd 15 1 (((𝐸:𝐷1-1𝑅𝐹:𝐶1-1𝐷) ∧ (𝐴𝐶𝐵𝐶) ∧ 𝐴𝐵) → (((𝐸‘(𝐹𝐴)) = 𝑋 ∧ (𝐸‘(𝐹𝐵)) = 𝑌) → 𝑋𝑌))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  w3a 1036   = wceq 1480  wcel 1987  wne 2790  wf 5843  1-1wf1 5844  cfv 5847
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fv 5855
This theorem is referenced by:  usgr2pthlem  26528
  Copyright terms: Public domain W3C validator