Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  f1ocan2fv Structured version   Visualization version   GIF version

Theorem f1ocan2fv 38929
Description: Cancel a composition by the converse of a bijection by preapplying the bijection. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
f1ocan2fv ((Fun 𝐹 ∧ 𝐺:𝐴⟶1-1onto𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ ◡𝐺)‘(𝐺‘𝑋)) = (𝐹‘𝑋))

Proof of Theorem f1ocan2fv
StepHypRef Expression
1 f1orel 6857 . . . . . 6 (𝐺:𝐴⟶1-1onto𝐵 → Rel 𝐺)
2 dfrel2 6199 . . . . . 6 (Rel 𝐺 ↔ ◡◡𝐺 = 𝐺)
31, 2sylib 221 . . . . 5 (𝐺:𝐴⟶1-1onto𝐵 → ◡◡𝐺 = 𝐺)
433ad2ant2 1152 . . . 4 ((Fun 𝐹 ∧ 𝐺:𝐴⟶1-1onto𝐵 ∧ 𝑋 ∈ 𝐴) → ◡◡𝐺 = 𝐺)
54fveq1d 6918 . . 3 ((Fun 𝐹 ∧ 𝐺:𝐴⟶1-1onto𝐵 ∧ 𝑋 ∈ 𝐴) → (◡◡𝐺‘𝑋) = (𝐺‘𝑋))
65fveq2d 6920 . 2 ((Fun 𝐹 ∧ 𝐺:𝐴⟶1-1onto𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ ◡𝐺)‘(◡◡𝐺‘𝑋)) = ((𝐹 ∘ ◡𝐺)‘(𝐺‘𝑋)))
7 f1ocnv 6867 . . 3 (𝐺:𝐴⟶1-1onto𝐵 → ◡𝐺:𝐵⟶1-1onto𝐴)
8 f1ocan1fv 38928 . . 3 ((Fun 𝐹 ∧ ◡𝐺:𝐵⟶1-1onto𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ ◡𝐺)‘(◡◡𝐺‘𝑋)) = (𝐹‘𝑋))
97, 8syl3an2 1182 . 2 ((Fun 𝐹 ∧ 𝐺:𝐴⟶1-1onto𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ ◡𝐺)‘(◡◡𝐺‘𝑋)) = (𝐹‘𝑋))
106, 9eqtr3d 2800 1 ((Fun 𝐹 ∧ 𝐺:𝐴⟶1-1onto𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ ◡𝐺)‘(𝐺‘𝑋)) = (𝐹‘𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ◡ccnv 5657   ∘ ccom 5662  Rel wrel 5663  Fun wfun 6560  ⟶1-1ontowf1o 6565  ‘cfv 6566
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 5255  ax-nul 5266  ax-pr 5398
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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator