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

Theorem ghmf1o 13925
Description: A bijective group homomorphism is an isomorphism. (Contributed by Mario Carneiro, 13-Jan-2015.)
Hypotheses
Ref Expression
ghmf1o.x 𝑋 = (Base‘𝑆)
ghmf1o.y 𝑌 = (Base‘𝑇)
Assertion
Ref Expression
ghmf1o (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋1-1-onto𝑌𝐹 ∈ (𝑇 GrpHom 𝑆)))

Proof of Theorem ghmf1o
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmgrp2 13896 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
2 ghmgrp1 13895 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
31, 2jca 306 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑇 ∈ Grp ∧ 𝑆 ∈ Grp))
43adantr 276 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → (𝑇 ∈ Grp ∧ 𝑆 ∈ Grp))
5 f1ocnv 5605 . . . . . 6 (𝐹:𝑋1-1-onto𝑌𝐹:𝑌1-1-onto𝑋)
65adantl 277 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → 𝐹:𝑌1-1-onto𝑋)
7 f1of 5592 . . . . 5 (𝐹:𝑌1-1-onto𝑋𝐹:𝑌𝑋)
86, 7syl 14 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → 𝐹:𝑌𝑋)
9 simpll 527 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
108adantr 276 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝐹:𝑌𝑋)
11 simprl 531 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝑥𝑌)
1210, 11ffvelcdmd 5791 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹𝑥) ∈ 𝑋)
13 simprr 533 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝑦𝑌)
1410, 13ffvelcdmd 5791 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹𝑦) ∈ 𝑋)
15 ghmf1o.x . . . . . . . . 9 𝑋 = (Base‘𝑆)
16 eqid 2231 . . . . . . . . 9 (+g𝑆) = (+g𝑆)
17 eqid 2231 . . . . . . . . 9 (+g𝑇) = (+g𝑇)
1815, 16, 17ghmlin 13898 . . . . . . . 8 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝐹𝑥) ∈ 𝑋 ∧ (𝐹𝑦) ∈ 𝑋) → (𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = ((𝐹‘(𝐹𝑥))(+g𝑇)(𝐹‘(𝐹𝑦))))
199, 12, 14, 18syl3anc 1274 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = ((𝐹‘(𝐹𝑥))(+g𝑇)(𝐹‘(𝐹𝑦))))
20 simplr 529 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝐹:𝑋1-1-onto𝑌)
21 f1ocnvfv2 5929 . . . . . . . . 9 ((𝐹:𝑋1-1-onto𝑌𝑥𝑌) → (𝐹‘(𝐹𝑥)) = 𝑥)
2220, 11, 21syl2anc 411 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘(𝐹𝑥)) = 𝑥)
23 f1ocnvfv2 5929 . . . . . . . . 9 ((𝐹:𝑋1-1-onto𝑌𝑦𝑌) → (𝐹‘(𝐹𝑦)) = 𝑦)
2420, 13, 23syl2anc 411 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘(𝐹𝑦)) = 𝑦)
2522, 24oveq12d 6046 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → ((𝐹‘(𝐹𝑥))(+g𝑇)(𝐹‘(𝐹𝑦))) = (𝑥(+g𝑇)𝑦))
2619, 25eqtrd 2264 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = (𝑥(+g𝑇)𝑦))
279, 2syl 14 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝑆 ∈ Grp)
2815, 16grpcl 13654 . . . . . . . 8 ((𝑆 ∈ Grp ∧ (𝐹𝑥) ∈ 𝑋 ∧ (𝐹𝑦) ∈ 𝑋) → ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∈ 𝑋)
2927, 12, 14, 28syl3anc 1274 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∈ 𝑋)
30 f1ocnvfv 5930 . . . . . . 7 ((𝐹:𝑋1-1-onto𝑌 ∧ ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∈ 𝑋) → ((𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = (𝑥(+g𝑇)𝑦) → (𝐹‘(𝑥(+g𝑇)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦))))
3120, 29, 30syl2anc 411 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → ((𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = (𝑥(+g𝑇)𝑦) → (𝐹‘(𝑥(+g𝑇)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦))))
3226, 31mpd 13 . . . . 5 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘(𝑥(+g𝑇)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)))
3332ralrimivva 2615 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → ∀𝑥𝑌𝑦𝑌 (𝐹‘(𝑥(+g𝑇)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)))
348, 33jca 306 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → (𝐹:𝑌𝑋 ∧ ∀𝑥𝑌𝑦𝑌 (𝐹‘(𝑥(+g𝑇)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦))))
35 ghmf1o.y . . . 4 𝑌 = (Base‘𝑇)
3635, 15, 17, 16isghm 13893 . . 3 (𝐹 ∈ (𝑇 GrpHom 𝑆) ↔ ((𝑇 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝑌𝑋 ∧ ∀𝑥𝑌𝑦𝑌 (𝐹‘(𝑥(+g𝑇)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)))))
374, 34, 36sylanbrc 417 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → 𝐹 ∈ (𝑇 GrpHom 𝑆))
3815, 35ghmf 13897 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:𝑋𝑌)
3938adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑋𝑌)
4039ffnd 5490 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹 Fn 𝑋)
4135, 15ghmf 13897 . . . . 5 (𝐹 ∈ (𝑇 GrpHom 𝑆) → 𝐹:𝑌𝑋)
4241adantl 277 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑌𝑋)
4342ffnd 5490 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹 Fn 𝑌)
44 dff1o4 5600 . . 3 (𝐹:𝑋1-1-onto𝑌 ↔ (𝐹 Fn 𝑋𝐹 Fn 𝑌))
4540, 43, 44sylanbrc 417 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑋1-1-onto𝑌)
4637, 45impbida 600 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋1-1-onto𝑌𝐹 ∈ (𝑇 GrpHom 𝑆)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2202  wral 2511  ccnv 4730   Fn wfn 5328  wf 5329  1-1-ontowf1o 5332  cfv 5333  (class class class)co 6028  Basecbs 13145  +gcplusg 13223  Grpcgrp 13646   GrpHom cghm 13890
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 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
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-ral 2516  df-rex 2517  df-reu 2518  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-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-ov 6031  df-oprab 6032  df-mpo 6033  df-inn 9186  df-2 9244  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-ghm 13891
This theorem is referenced by:  rhmf1o  14246
  Copyright terms: Public domain W3C validator