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

Theorem rhmf1o 14263
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 14251 . . . . 5  |-  ( F  e.  ( R RingHom  S
)  ->  S  e.  Ring )
2 rhmrcl1 14250 . . . . 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 14257 . . . . . . 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 13942 . . . . . . 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 2232 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  F  =  F )
15 eqid 2231 . . . . . . . . 9  |-  (mulGrp `  R )  =  (mulGrp `  R )
1615, 8mgpbasg 14020 . . . . . . . 8  |-  ( R  e.  Ring  ->  B  =  ( Base `  (mulGrp `  R ) ) )
172, 16syl 14 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  B  =  ( Base `  (mulGrp `  R
) ) )
18 eqid 2231 . . . . . . . . 9  |-  (mulGrp `  S )  =  (mulGrp `  S )
1918, 9mgpbasg 14020 . . . . . . . 8  |-  ( S  e.  Ring  ->  C  =  ( Base `  (mulGrp `  S ) ) )
201, 19syl 14 . . . . . . 7  |-  ( F  e.  ( R RingHom  S
)  ->  C  =  ( Base `  (mulGrp `  S
) ) )
2114, 17, 20f1oeq123d 5586 . . . . . 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 14254 . . . . . . 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 2231 . . . . . . . 8  |-  ( Base `  (mulGrp `  R )
)  =  ( Base `  (mulGrp `  R )
)
26 eqid 2231 . . . . . . . 8  |-  ( Base `  (mulGrp `  S )
)  =  ( Base `  (mulGrp `  S )
)
2725, 26mhmf1o 13633 . . . . . . 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 14253 . . 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 14258 . . . . 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 5490 . . 3  |-  ( ( F  e.  ( R RingHom  S )  /\  `' F  e.  ( S RingHom  R ) )  ->  F  Fn  B )
379, 8rhmf 14258 . . . . 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 5490 . . 3  |-  ( ( F  e.  ( R RingHom  S )  /\  `' F  e.  ( S RingHom  R ) )  ->  `' F  Fn  C )
40 dff1o4 5600 . . 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 600 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 1398    e. wcel 2202   `'ccnv 4730    Fn wfn 5328   -->wf 5329   -1-1-onto->wf1o 5332   ` cfv 5333  (class class class)co 6028   Basecbs 13162   MndHom cmhm 13620    GrpHom cghm 13907  mulGrpcmgp 14014   Ringcrg 14090   RingHom crh 14245
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-pre-ltirr 8204  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-map 6862  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-inn 9203  df-2 9261  df-3 9262  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-plusg 13253  df-mulr 13254  df-0g 13421  df-mgm 13519  df-sgrp 13565  df-mnd 13580  df-mhm 13622  df-grp 13666  df-ghm 13908  df-mgp 14015  df-ur 14054  df-ring 14092  df-rhm 14247
This theorem is referenced by:  isrim  14264
  Copyright terms: Public domain W3C validator