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

Theorem f1eq1 3666
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 3626 . . 3 |- (F = G -> (F:A-->B <-> G:A-->B))
2 cnveq 3298 . . . 4 |- (F = G -> `'F = `'G)
3 funeq 3541 . . . 4 |- (`'F = `'G -> (Fun `'F <-> Fun `'G))
42, 3syl 10 . . 3 |- (F = G -> (Fun `'F <-> Fun `'G))
51, 4anbi12d 630 . 2 |- (F = G -> ((F:A-->B /\ Fun `'F) <-> (G:A-->B /\ Fun `'G)))
6 df-f1 3201 . 2 |- (F:A-1-1->B <-> (F:A-->B /\ Fun `'F))
7 df-f1 3201 . 2 |- (G:A-1-1->B <-> (G:A-->B /\ Fun `'G))
85, 6, 73bitr4g 557 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 958  `'ccnv 3175  Fun wfun 3182  -->wf 3184  -1-1->wf1 3185
This theorem is referenced by:  f1oeq1 3690  fo00 3721  f1domg 4402  unidom 4818  infxpidmlem7 7559  specvalt 9819
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-br 2625  df-opab 2672  df-id 2841  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-fun 3198  df-fn 3199  df-f 3200  df-f1 3201
Copyright terms: Public domain