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

Theorem rhmf1o 13535
Description: A ring homomorphism is bijective iff its converse is also a ring homomorphism. (Contributed by AV, 22-Oct-2019.)
Hypotheses
Ref Expression
rhmf1o.b  |-  B  =  ( Base `  R
)
rhmf1o.c  |-  C  =  ( Base `  S
)
Assertion
Ref Expression
rhmf1o  |-  ( F  e.  ( R RingHom  S
)  ->  ( F : B -1-1-onto-> C  <->  `' F  e.  ( S RingHom  R ) ) )

Proof of Theorem rhmf1o
StepHypRef Expression
1 rhmrcl2 13523 . . . . 5  |-  ( F  e.  ( R RingHom  S
)  ->  S  e.  Ring )
2 rhmrcl1 13522 . . . . 5  |-  ( F  e.  ( R RingHom  S
)  ->  R  e.  Ring )
31, 2jca 306 . . . 4  |-  ( F  e.  ( R RingHom  S
)  ->  ( S  e.  Ring  /\  R  e.  Ring ) )
43adantr 276 . . 3  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  ( S  e.  Ring  /\  R  e.  Ring ) )
5 simpr 110 . . . . 5  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  F : B -1-1-onto-> C )
6 rhmghm 13529 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  F  e.  ( R  GrpHom  S ) )
76adantr 276 . . . . . 6  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  F  e.  ( R  GrpHom  S ) )
8 rhmf1o.b . . . . . . . 8  |-  B  =  ( Base `  R
)
9 rhmf1o.c . . . . . . . 8  |-  C  =  ( Base `  S
)
108, 9ghmf1o 13231 . . . . . . 7  |-  ( F  e.  ( R  GrpHom  S )  ->  ( F : B -1-1-onto-> C  <->  `' F  e.  ( S  GrpHom  R ) ) )
1110bicomd 141 . . . . . 6  |-  ( F  e.  ( R  GrpHom  S )  ->  ( `' F  e.  ( S  GrpHom  R )  <->  F : B
-1-1-onto-> C ) )
127, 11syl 14 . . . . 5  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  ( `' F  e.  ( S  GrpHom  R )  <->  F : B
-1-1-onto-> C ) )
135, 12mpbird 167 . . . 4  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  `' F  e.  ( S  GrpHom  R ) )
14 eqidd 2190 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  F  =  F )
15 eqid 2189 . . . . . . . . 9  |-  (mulGrp `  R )  =  (mulGrp `  R )
1615, 8mgpbasg 13297 . . . . . . . 8  |-  ( R  e.  Ring  ->  B  =  ( Base `  (mulGrp `  R ) ) )
172, 16syl 14 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  B  =  ( Base `  (mulGrp `  R
) ) )
18 eqid 2189 . . . . . . . . 9  |-  (mulGrp `  S )  =  (mulGrp `  S )
1918, 9mgpbasg 13297 . . . . . . . 8  |-  ( S  e.  Ring  ->  C  =  ( Base `  (mulGrp `  S ) ) )
201, 19syl 14 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  C  =  ( Base `  (mulGrp `  S
) ) )
2114, 17, 20f1oeq123d 5474 . . . . . 6  |-  ( F  e.  ( R RingHom  S
)  ->  ( F : B -1-1-onto-> C  <->  F : ( Base `  (mulGrp `  R )
)
-1-1-onto-> ( Base `  (mulGrp `  S
) ) ) )
2221biimpa 296 . . . . 5  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  F : ( Base `  (mulGrp `  R ) ) -1-1-onto-> ( Base `  (mulGrp `  S )
) )
2315, 18rhmmhm 13526 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  F  e.  ( (mulGrp `  R ) MndHom  (mulGrp `  S ) ) )
2423adantr 276 . . . . . 6  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  F  e.  ( (mulGrp `  R
) MndHom  (mulGrp `  S )
) )
25 eqid 2189 . . . . . . . 8  |-  ( Base `  (mulGrp `  R )
)  =  ( Base `  (mulGrp `  R )
)
26 eqid 2189 . . . . . . . 8  |-  ( Base `  (mulGrp `  S )
)  =  ( Base `  (mulGrp `  S )
)
2725, 26mhmf1o 12937 . . . . . . 7  |-  ( F  e.  ( (mulGrp `  R ) MndHom  (mulGrp `  S
) )  ->  ( F : ( Base `  (mulGrp `  R ) ) -1-1-onto-> ( Base `  (mulGrp `  S )
)  <->  `' F  e.  (
(mulGrp `  S ) MndHom  (mulGrp `  R ) ) ) )
2827bicomd 141 . . . . . 6  |-  ( F  e.  ( (mulGrp `  R ) MndHom  (mulGrp `  S
) )  ->  ( `' F  e.  (
(mulGrp `  S ) MndHom  (mulGrp `  R ) )  <->  F :
( Base `  (mulGrp `  R
) ) -1-1-onto-> ( Base `  (mulGrp `  S ) ) ) )
2924, 28syl 14 . . . . 5  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  ( `' F  e.  (
(mulGrp `  S ) MndHom  (mulGrp `  R ) )  <->  F :
( Base `  (mulGrp `  R
) ) -1-1-onto-> ( Base `  (mulGrp `  S ) ) ) )
3022, 29mpbird 167 . . . 4  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  `' F  e.  ( (mulGrp `  S ) MndHom  (mulGrp `  R ) ) )
3113, 30jca 306 . . 3  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  ( `' F  e.  ( S  GrpHom  R )  /\  `' F  e.  (
(mulGrp `  S ) MndHom  (mulGrp `  R ) ) ) )
3218, 15isrhm 13525 . . 3  |-  ( `' F  e.  ( S RingHom  R )  <->  ( ( S  e.  Ring  /\  R  e.  Ring )  /\  ( `' F  e.  ( S  GrpHom  R )  /\  `' F  e.  (
(mulGrp `  S ) MndHom  (mulGrp `  R ) ) ) ) )
334, 31, 32sylanbrc 417 . 2  |-  ( ( F  e.  ( R RingHom  S )  /\  F : B -1-1-onto-> C )  ->  `' F  e.  ( S RingHom  R ) )
348, 9rhmf 13530 . . . . 5  |-  ( F  e.  ( R RingHom  S
)  ->  F : B
--> C )
3534adantr 276 . . . 4  |-  ( ( F  e.  ( R RingHom  S )  /\  `' F  e.  ( S RingHom  R ) )  ->  F : B --> C )
3635ffnd 5385 . . 3  |-  ( ( F  e.  ( R RingHom  S )  /\  `' F  e.  ( S RingHom  R ) )  ->  F  Fn  B )
379, 8rhmf 13530 . . . . 5  |-  ( `' F  e.  ( S RingHom  R )  ->  `' F : C --> B )
3837adantl 277 . . . 4  |-  ( ( F  e.  ( R RingHom  S )  /\  `' F  e.  ( S RingHom  R ) )  ->  `' F : C --> B )
3938ffnd 5385 . . 3  |-  ( ( F  e.  ( R RingHom  S )  /\  `' F  e.  ( S RingHom  R ) )  ->  `' F  Fn  C )
40 dff1o4 5488 . . 3  |-  ( F : B -1-1-onto-> C  <->  ( F  Fn  B  /\  `' F  Fn  C ) )
4136, 39, 40sylanbrc 417 . 2  |-  ( ( F  e.  ( R RingHom  S )  /\  `' F  e.  ( S RingHom  R ) )  ->  F : B -1-1-onto-> C )
4233, 41impbida 596 1  |-  ( F  e.  ( R RingHom  S
)  ->  ( F : B -1-1-onto-> C  <->  `' F  e.  ( S RingHom  R ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2160   `'ccnv 4643    Fn wfn 5230   -->wf 5231   -1-1-onto->wf1o 5234   ` cfv 5235  (class class class)co 5897   Basecbs 12515   MndHom cmhm 12924    GrpHom cghm 13196  mulGrpcmgp 13291   Ringcrg 13367   RingHom crh 13517
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-cnex 7933  ax-resscn 7934  ax-1cn 7935  ax-1re 7936  ax-icn 7937  ax-addcl 7938  ax-addrcl 7939  ax-mulcl 7940  ax-addcom 7942  ax-addass 7944  ax-i2m1 7947  ax-0lt1 7948  ax-0id 7950  ax-rnegex 7951  ax-pre-ltirr 7954  ax-pre-ltadd 7958
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4311  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-riota 5852  df-ov 5900  df-oprab 5901  df-mpo 5902  df-1st 6166  df-2nd 6167  df-map 6677  df-pnf 8025  df-mnf 8026  df-ltxr 8028  df-inn 8951  df-2 9009  df-3 9010  df-ndx 12518  df-slot 12519  df-base 12521  df-sets 12522  df-plusg 12605  df-mulr 12606  df-0g 12766  df-mgm 12835  df-sgrp 12880  df-mnd 12893  df-mhm 12926  df-grp 12963  df-ghm 13197  df-mgp 13292  df-ur 13331  df-ring 13369  df-rhm 13519
This theorem is referenced by:  isrim  13536
  Copyright terms: Public domain W3C validator