HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem f1eq1 3660
Description: Equality theorem for one-to-one functions.
Assertion
Ref Expression
f1eq1 |- (F = G -> (F:A-1-1->B <-> G:A-1-1->B))

Proof of Theorem f1eq1
StepHypRef Expression
1 feq1 3620 . . 3 |- (F = G -> (F:A-->B <-> G:A-->B))
2 cnveq 3292 . . . 4 |- (F = G -> `'F = `'G)
3 funeq 3535 . . . 4 |- (`'F = `'G -> (Fun `'F <-> Fun `'G))
42, 3syl 10 . . 3 |- (F = G -> (Fun `'F <-> Fun `'G))
51, 4anbi12d 628 . 2 |- (F = G -> ((F:A-->B /\ Fun `'F) <-> (G:A-->B /\ Fun `'G)))
6 df-f1 3195 . 2 |- (F:A-1-1->B <-> (F:A-->B /\ Fun `'F))
7 df-f1 3195 . 2 |- (G:A-1-1->B <-> (G:A-->B /\ Fun `'G))
85, 6, 73bitr4g 555 1 |- (F = G -> (F:A-1-1->B <-> G:A-1-1->B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956  `'ccnv 3169  Fun wfun 3176  -->wf 3178  -1-1->wf1 3179
This theorem is referenced by:  f1oeq1 3684  fo00 3715  f1domg 4396  unidom 4808  infxpidmlem7 7558  specvalt 9824
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-opab 2667  df-id 2835  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-fun 3192  df-fn 3193  df-f 3194  df-f1 3195
Copyright terms: Public domain