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

Theorem f1cofveqaeq 7249
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 6766 . . . . . 6 (𝐺:𝐴–1-1→𝐵 → 𝐺:𝐴⟶𝐵)
3 ffvelcdm 7069 . . . . . . . 8 ((𝐺:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐺‘𝑋) ∈ 𝐵)
43ex 418 . . . . . . 7 (𝐺:𝐴⟶𝐵 → (𝑋 ∈ 𝐴 → (𝐺‘𝑋) ∈ 𝐵))
5 ffvelcdm 7069 . . . . . . . 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 7248 . . 3 ((𝐹:𝐵–1-1→𝐶 ∧ ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → (𝐺‘𝑋) = (𝐺‘𝑌)))
121, 10, 11syl2an2r 698 . 2 (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → (𝐺‘𝑋) = (𝐺‘𝑌)))
13 f1veqaeq 7248 . . 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 2145  ⟶wf 6523  –1-1→wf1 6524  ‘cfv 6527
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fv 6535
This theorem is used by:  uspgrn2crct  30331  upgrimtrlslem2  48925
  Copyright terms: Public domain W3C validator