Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1eq3 GIF version

Theorem f1eq3 5325
 Description: Equality theorem for one-to-one functions. (Contributed by NM, 10-Feb-1997.)
Assertion
Ref Expression
f1eq3 (𝐴 = 𝐵 → (𝐹:𝐶1-1𝐴𝐹:𝐶1-1𝐵))

Proof of Theorem f1eq3
StepHypRef Expression
1 feq3 5257 . . 3 (𝐴 = 𝐵 → (𝐹:𝐶𝐴𝐹:𝐶𝐵))
21anbi1d 460 . 2 (𝐴 = 𝐵 → ((𝐹:𝐶𝐴 ∧ Fun 𝐹) ↔ (𝐹:𝐶𝐵 ∧ Fun 𝐹)))
3 df-f1 5128 . 2 (𝐹:𝐶1-1𝐴 ↔ (𝐹:𝐶𝐴 ∧ Fun 𝐹))
4 df-f1 5128 . 2 (𝐹:𝐶1-1𝐵 ↔ (𝐹:𝐶𝐵 ∧ Fun 𝐹))
52, 3, 43bitr4g 222 1 (𝐴 = 𝐵 → (𝐹:𝐶1-1𝐴𝐹:𝐶1-1𝐵))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331  ◡ccnv 4538  Fun wfun 5117  ⟶wf 5119  –1-1→wf1 5120 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-11 1484  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121 This theorem depends on definitions:  df-bi 116  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-in 3077  df-ss 3084  df-f 5127  df-f1 5128 This theorem is referenced by:  f1oeq3  5358  f1eq123d  5360  tposf12  6166  brdomg  6642
 Copyright terms: Public domain W3C validator