MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  foeqcnvco Structured version   Unicode version

Theorem foeqcnvco 6191
Description: Condition for function equality in terms of vanishing of the composition with the converse. EDITORIAL: Is there a relation-algebraic proof of this? (Contributed by Stefan O'Rear, 12-Feb-2015.)
Assertion
Ref Expression
foeqcnvco  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  ( F  =  G  <->  ( F  o.  `' G )  =  (  _I  |`  B )
) )

Proof of Theorem foeqcnvco
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fococnv2 5841 . . . 4  |-  ( F : A -onto-> B  -> 
( F  o.  `' F )  =  (  _I  |`  B )
)
2 cnveq 5176 . . . . . 6  |-  ( F  =  G  ->  `' F  =  `' G
)
32coeq2d 5165 . . . . 5  |-  ( F  =  G  ->  ( F  o.  `' F
)  =  ( F  o.  `' G ) )
43eqeq1d 2469 . . . 4  |-  ( F  =  G  ->  (
( F  o.  `' F )  =  (  _I  |`  B )  <->  ( F  o.  `' G
)  =  (  _I  |`  B ) ) )
51, 4syl5ibcom 220 . . 3  |-  ( F : A -onto-> B  -> 
( F  =  G  ->  ( F  o.  `' G )  =  (  _I  |`  B )
) )
65adantr 465 . 2  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  ( F  =  G  ->  ( F  o.  `' G )  =  (  _I  |`  B ) ) )
7 fofn 5797 . . . . 5  |-  ( F : A -onto-> B  ->  F  Fn  A )
87ad2antrr 725 . . . 4  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  F  Fn  A )
9 fofn 5797 . . . . 5  |-  ( G : A -onto-> B  ->  G  Fn  A )
109ad2antlr 726 . . . 4  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  G  Fn  A )
119adantl 466 . . . . . . . . . . . 12  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  G  Fn  A )
12 fnopfv 6016 . . . . . . . . . . . 12  |-  ( ( G  Fn  A  /\  x  e.  A )  -> 
<. x ,  ( G `
 x ) >.  e.  G )
1311, 12sylan 471 . . . . . . . . . . 11  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  <. x ,  ( G `  x ) >.  e.  G
)
14 fvex 5876 . . . . . . . . . . . . 13  |-  ( G `
 x )  e. 
_V
15 vex 3116 . . . . . . . . . . . . 13  |-  x  e. 
_V
1614, 15brcnv 5185 . . . . . . . . . . . 12  |-  ( ( G `  x ) `' G x  <->  x G
( G `  x
) )
17 df-br 4448 . . . . . . . . . . . 12  |-  ( x G ( G `  x )  <->  <. x ,  ( G `  x
) >.  e.  G )
1816, 17bitri 249 . . . . . . . . . . 11  |-  ( ( G `  x ) `' G x  <->  <. x ,  ( G `  x
) >.  e.  G )
1913, 18sylibr 212 . . . . . . . . . 10  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  ( G `  x ) `' G x )
207adantr 465 . . . . . . . . . . . 12  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  F  Fn  A )
21 fnopfv 6016 . . . . . . . . . . . 12  |-  ( ( F  Fn  A  /\  x  e.  A )  -> 
<. x ,  ( F `
 x ) >.  e.  F )
2220, 21sylan 471 . . . . . . . . . . 11  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  <. x ,  ( F `  x ) >.  e.  F
)
23 df-br 4448 . . . . . . . . . . 11  |-  ( x F ( F `  x )  <->  <. x ,  ( F `  x
) >.  e.  F )
2422, 23sylibr 212 . . . . . . . . . 10  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  x F ( F `  x ) )
25 breq2 4451 . . . . . . . . . . . 12  |-  ( y  =  x  ->  (
( G `  x
) `' G y  <-> 
( G `  x
) `' G x ) )
26 breq1 4450 . . . . . . . . . . . 12  |-  ( y  =  x  ->  (
y F ( F `
 x )  <->  x F
( F `  x
) ) )
2725, 26anbi12d 710 . . . . . . . . . . 11  |-  ( y  =  x  ->  (
( ( G `  x ) `' G
y  /\  y F
( F `  x
) )  <->  ( ( G `  x ) `' G x  /\  x F ( F `  x ) ) ) )
2815, 27spcev 3205 . . . . . . . . . 10  |-  ( ( ( G `  x
) `' G x  /\  x F ( F `  x ) )  ->  E. y
( ( G `  x ) `' G
y  /\  y F
( F `  x
) ) )
2919, 24, 28syl2anc 661 . . . . . . . . 9  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  E. y
( ( G `  x ) `' G
y  /\  y F
( F `  x
) ) )
30 fvex 5876 . . . . . . . . . 10  |-  ( F `
 x )  e. 
_V
3114, 30brco 5173 . . . . . . . . 9  |-  ( ( G `  x ) ( F  o.  `' G ) ( F `
 x )  <->  E. y
( ( G `  x ) `' G
y  /\  y F
( F `  x
) ) )
3229, 31sylibr 212 . . . . . . . 8  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  ( G `  x )
( F  o.  `' G ) ( F `
 x ) )
3332adantlr 714 . . . . . . 7  |-  ( ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  /\  x  e.  A )  ->  ( G `  x
) ( F  o.  `' G ) ( F `
 x ) )
34 breq 4449 . . . . . . . 8  |-  ( ( F  o.  `' G
)  =  (  _I  |`  B )  ->  (
( G `  x
) ( F  o.  `' G ) ( F `
 x )  <->  ( G `  x ) (  _I  |`  B ) ( F `
 x ) ) )
3534ad2antlr 726 . . . . . . 7  |-  ( ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  /\  x  e.  A )  ->  ( ( G `  x ) ( F  o.  `' G ) ( F `  x
)  <->  ( G `  x ) (  _I  |`  B ) ( F `
 x ) ) )
3633, 35mpbid 210 . . . . . 6  |-  ( ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  /\  x  e.  A )  ->  ( G `  x
) (  _I  |`  B ) ( F `  x
) )
37 fof 5795 . . . . . . . . . 10  |-  ( G : A -onto-> B  ->  G : A --> B )
3837adantl 466 . . . . . . . . 9  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  G : A
--> B )
3938ffvelrnda 6021 . . . . . . . 8  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  ( G `  x )  e.  B )
40 fof 5795 . . . . . . . . . 10  |-  ( F : A -onto-> B  ->  F : A --> B )
4140adantr 465 . . . . . . . . 9  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  F : A
--> B )
4241ffvelrnda 6021 . . . . . . . 8  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  ( F `  x )  e.  B )
43 resieq 5284 . . . . . . . 8  |-  ( ( ( G `  x
)  e.  B  /\  ( F `  x )  e.  B )  -> 
( ( G `  x ) (  _I  |`  B ) ( F `
 x )  <->  ( G `  x )  =  ( F `  x ) ) )
4439, 42, 43syl2anc 661 . . . . . . 7  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  x  e.  A )  ->  (
( G `  x
) (  _I  |`  B ) ( F `  x
)  <->  ( G `  x )  =  ( F `  x ) ) )
4544adantlr 714 . . . . . 6  |-  ( ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  /\  x  e.  A )  ->  ( ( G `  x ) (  _I  |`  B ) ( F `
 x )  <->  ( G `  x )  =  ( F `  x ) ) )
4636, 45mpbid 210 . . . . 5  |-  ( ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  /\  x  e.  A )  ->  ( G `  x
)  =  ( F `
 x ) )
4746eqcomd 2475 . . . 4  |-  ( ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  /\  x  e.  A )  ->  ( F `  x
)  =  ( G `
 x ) )
488, 10, 47eqfnfvd 5978 . . 3  |-  ( ( ( F : A -onto-> B  /\  G : A -onto-> B )  /\  ( F  o.  `' G
)  =  (  _I  |`  B ) )  ->  F  =  G )
4948ex 434 . 2  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  ( ( F  o.  `' G
)  =  (  _I  |`  B )  ->  F  =  G ) )
506, 49impbid 191 1  |-  ( ( F : A -onto-> B  /\  G : A -onto-> B
)  ->  ( F  =  G  <->  ( F  o.  `' G )  =  (  _I  |`  B )
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1379   E.wex 1596    e. wcel 1767   <.cop 4033   class class class wbr 4447    _I cid 4790   `'ccnv 4998    |` cres 5001    o. ccom 5003    Fn wfn 5583   -->wf 5584   -onto->wfo 5586   ` cfv 5588
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-csb 3436  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-mpt 4507  df-id 4795  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5551  df-fun 5590  df-fn 5591  df-f 5592  df-fo 5594  df-fv 5596
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator