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

Theorem f1cofveqaeqALT 7201
Description: Alternate proof of f1cofveqaeq 7200, 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 6727 . . . . 5 (𝐺:𝐴1-1𝐵𝐺:𝐴𝐵)
2 fvco3 6930 . . . . . . . 8 ((𝐺:𝐴𝐵𝑋𝐴) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))
32adantrr 717 . . . . . . 7 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))
4 fvco3 6930 . . . . . . . 8 ((𝐺:𝐴𝐵𝑌𝐴) → ((𝐹𝐺)‘𝑌) = (𝐹‘(𝐺𝑌)))
54adantrl 716 . . . . . . 7 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹𝐺)‘𝑌) = (𝐹‘(𝐺𝑌)))
63, 5eqeq12d 2749 . . . . . 6 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌))))
76ex 412 . . . . 5 (𝐺:𝐴𝐵 → ((𝑋𝐴𝑌𝐴) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)))))
81, 7syl 17 . . . 4 (𝐺:𝐴1-1𝐵 → ((𝑋𝐴𝑌𝐴) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)))))
98adantl 481 . . 3 ((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) → ((𝑋𝐴𝑌𝐴) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)))))
109imp 406 . 2 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) ↔ (𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌))))
11 f1co 6738 . . 3 ((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) → (𝐹𝐺):𝐴1-1𝐶)
12 f1veqaeq 7199 . . 3 (((𝐹𝐺):𝐴1-1𝐶 ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) → 𝑋 = 𝑌))
1311, 12sylan 580 . 2 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) → 𝑋 = 𝑌))
1410, 13sylbird 260 1 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)) → 𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  ccom 5625  wf 6485  1-1wf1 6486  cfv 6489
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fv 6497
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator