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

Theorem f1cofveqaeqALT 7257
Description: Alternate proof of f1cofveqaeq 7256, 1 essential step shorter, but having more bytes (305 versus 282). (Contributed by AV, 3-Feb-2021.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
f1cofveqaeqALT (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)) → 𝑋 = 𝑌))

Proof of Theorem f1cofveqaeqALT
StepHypRef Expression
1 f1f 6787 . . . . 5 (𝐺:𝐴1-1𝐵𝐺:𝐴𝐵)
2 fvco3 6990 . . . . . . . 8 ((𝐺:𝐴𝐵𝑋𝐴) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))
32adantrr 715 . . . . . . 7 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))
4 fvco3 6990 . . . . . . . 8 ((𝐺:𝐴𝐵𝑌𝐴) → ((𝐹𝐺)‘𝑌) = (𝐹‘(𝐺𝑌)))
54adantrl 714 . . . . . . 7 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹𝐺)‘𝑌) = (𝐹‘(𝐺𝑌)))
63, 5eqeq12d 2748 . . . . . 6 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌))))
76ex 413 . . . . 5 (𝐺:𝐴𝐵 → ((𝑋𝐴𝑌𝐴) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)))))
81, 7syl 17 . . . 4 (𝐺:𝐴1-1𝐵 → ((𝑋𝐴𝑌𝐴) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)))))
98adantl 482 . . 3 ((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) → ((𝑋𝐴𝑌𝐴) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)))))
109imp 407 . 2 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌))))
11 f1co 6799 . . 3 ((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) → (𝐹𝐺):𝐴1-1𝐶)
12 f1veqaeq 7255 . . 3 (((𝐹𝐺):𝐴1-1𝐶 ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) → 𝑋 = 𝑌))
1311, 12sylan 580 . 2 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) → 𝑋 = 𝑌))
1410, 13sylbird 259 1 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)) → 𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  ccom 5680  wf 6539  1-1wf1 6540  cfv 6543
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fv 6551
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator