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

Theorem f1cofveqaeq 7284
Description: If the values of a composition of one-to-one functions for two arguments are equal, the arguments themselves must be equal. (Contributed by AV, 3-Feb-2021.)
Assertion
Ref Expression
f1cofveqaeq (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌))

Proof of Theorem f1cofveqaeq
StepHypRef Expression
1 simpl 488 . . 3 ((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) → 𝐹:𝐵⟶1-1𝐶)
2 f1f 6800 . . . . . 6 (𝐺:𝐴⟶1-1𝐵 → 𝐺:𝐴⟶𝐵)
3 ffvelcdm 7105 . . . . . . . 8 ((𝐺:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐺‘𝑋) ∈ 𝐵)
43ex 418 . . . . . . 7 (𝐺:𝐴⟶𝐵 → (𝑋 ∈ 𝐴 → (𝐺‘𝑋) ∈ 𝐵))
5 ffvelcdm 7105 . . . . . . . 8 ((𝐺:𝐴⟶𝐵 ∧ 𝑌 ∈ 𝐴) → (𝐺‘𝑌) ∈ 𝐵)
65ex 418 . . . . . . 7 (𝐺:𝐴⟶𝐵 → (𝑌 ∈ 𝐴 → (𝐺‘𝑌) ∈ 𝐵))
74, 6anim12d 621 . . . . . 6 (𝐺:𝐴⟶𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵)))
82, 7syl 18 . . . . 5 (𝐺:𝐴⟶1-1𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵)))
98adantl 487 . . . 4 ((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵)))
109imp 412 . . 3 (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵))
11 f1veqaeq 7283 . . 3 ((𝐹:𝐵⟶1-1𝐶 ∧ ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → (𝐺‘𝑋) = (𝐺‘𝑌)))
121, 10, 11syl2an2r 698 . 2 (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → (𝐺‘𝑋) = (𝐺‘𝑌)))
13 f1veqaeq 7283 . . 3 ((𝐺:𝐴⟶1-1𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐺‘𝑋) = (𝐺‘𝑌) → 𝑋 = 𝑌))
1413adantll 727 . 2 (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐺‘𝑋) = (𝐺‘𝑌) → 𝑋 = 𝑌))
1512, 14syld 48 1 (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟶wf 6554  ⟶1-1wf1 6555  ‘cfv 6558
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fv 6566
This theorem is used by:  uspgrn2crct  30427  upgrimtrlslem2  49208
  Copyright terms: Public domain W3C validator