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

Theorem f1cofveqaeqALT 7263
Description: Alternate proof of f1cofveqaeq 7262, 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 6991 . . . . . . . 8 ((𝐺:𝐴𝐵𝑋𝐴) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))
32adantrr 716 . . . . . . 7 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))
4 fvco3 6991 . . . . . . . 8 ((𝐺:𝐴𝐵𝑌𝐴) → ((𝐹𝐺)‘𝑌) = (𝐹‘(𝐺𝑌)))
54adantrl 715 . . . . . . 7 ((𝐺:𝐴𝐵 ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹𝐺)‘𝑌) = (𝐹‘(𝐺𝑌)))
63, 5eqeq12d 2743 . . . . . 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 6799 . . 3 ((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) → (𝐹𝐺):𝐴1-1𝐶)
12 f1veqaeq 7261 . . 3 (((𝐹𝐺):𝐴1-1𝐶 ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) → 𝑋 = 𝑌))
1311, 12sylan 579 . 2 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → (((𝐹𝐺)‘𝑋) = ((𝐹𝐺)‘𝑌) → 𝑋 = 𝑌))
1410, 13sylbird 260 1 (((𝐹:𝐵1-1𝐶𝐺:𝐴1-1𝐵) ∧ (𝑋𝐴𝑌𝐴)) → ((𝐹‘(𝐺𝑋)) = (𝐹‘(𝐺𝑌)) → 𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1534  wcel 2099  ccom 5676  wf 6538  1-1wf1 6539  cfv 6542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-br 5143  df-opab 5205  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fv 6550
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator