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

Theorem ghmf1o 13807
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 13778 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
2 ghmgrp1 13777 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
31, 2jca 306 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑇 ∈ Grp ∧ 𝑆 ∈ Grp))
43adantr 276 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → (𝑇 ∈ Grp ∧ 𝑆 ∈ Grp))
5 f1ocnv 5584 . . . . . 6 (𝐹:𝑋1-1-onto𝑌𝐹:𝑌1-1-onto𝑋)
65adantl 277 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → 𝐹:𝑌1-1-onto𝑋)
7 f1of 5571 . . . . 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 529 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝑥𝑌)
1210, 11ffvelcdmd 5770 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹𝑥) ∈ 𝑋)
13 simprr 531 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝑦𝑌)
1410, 13ffvelcdmd 5770 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹𝑦) ∈ 𝑋)
15 ghmf1o.x . . . . . . . . 9 𝑋 = (Base‘𝑆)
16 eqid 2229 . . . . . . . . 9 (+g𝑆) = (+g𝑆)
17 eqid 2229 . . . . . . . . 9 (+g𝑇) = (+g𝑇)
1815, 16, 17ghmlin 13780 . . . . . . . 8 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝐹𝑥) ∈ 𝑋 ∧ (𝐹𝑦) ∈ 𝑋) → (𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = ((𝐹‘(𝐹𝑥))(+g𝑇)(𝐹‘(𝐹𝑦))))
199, 12, 14, 18syl3anc 1271 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = ((𝐹‘(𝐹𝑥))(+g𝑇)(𝐹‘(𝐹𝑦))))
20 simplr 528 . . . . . . . . 9 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝐹:𝑋1-1-onto𝑌)
21 f1ocnvfv2 5901 . . . . . . . . 9 ((𝐹:𝑋1-1-onto𝑌𝑥𝑌) → (𝐹‘(𝐹𝑥)) = 𝑥)
2220, 11, 21syl2anc 411 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘(𝐹𝑥)) = 𝑥)
23 f1ocnvfv2 5901 . . . . . . . . 9 ((𝐹:𝑋1-1-onto𝑌𝑦𝑌) → (𝐹‘(𝐹𝑦)) = 𝑦)
2420, 13, 23syl2anc 411 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘(𝐹𝑦)) = 𝑦)
2522, 24oveq12d 6018 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → ((𝐹‘(𝐹𝑥))(+g𝑇)(𝐹‘(𝐹𝑦))) = (𝑥(+g𝑇)𝑦))
2619, 25eqtrd 2262 . . . . . 6 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → (𝐹‘((𝐹𝑥)(+g𝑆)(𝐹𝑦))) = (𝑥(+g𝑇)𝑦))
279, 2syl 14 . . . . . . . 8 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → 𝑆 ∈ Grp)
2815, 16grpcl 13536 . . . . . . . 8 ((𝑆 ∈ Grp ∧ (𝐹𝑥) ∈ 𝑋 ∧ (𝐹𝑦) ∈ 𝑋) → ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∈ 𝑋)
2927, 12, 14, 28syl3anc 1271 . . . . . . 7 (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) ∧ (𝑥𝑌𝑦𝑌)) → ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∈ 𝑋)
30 f1ocnvfv 5902 . . . . . . 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 2612 . . . 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 13775 . . 3 (𝐹 ∈ (𝑇 GrpHom 𝑆) ↔ ((𝑇 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹:𝑌𝑋 ∧ ∀𝑥𝑌𝑦𝑌 (𝐹‘(𝑥(+g𝑇)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)))))
374, 34, 36sylanbrc 417 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋1-1-onto𝑌) → 𝐹 ∈ (𝑇 GrpHom 𝑆))
3815, 35ghmf 13779 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:𝑋𝑌)
3938adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑋𝑌)
4039ffnd 5473 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹 Fn 𝑋)
4135, 15ghmf 13779 . . . . 5 (𝐹 ∈ (𝑇 GrpHom 𝑆) → 𝐹:𝑌𝑋)
4241adantl 277 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑌𝑋)
4342ffnd 5473 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹 Fn 𝑌)
44 dff1o4 5579 . . 3 (𝐹:𝑋1-1-onto𝑌 ↔ (𝐹 Fn 𝑋𝐹 Fn 𝑌))
4540, 43, 44sylanbrc 417 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑋1-1-onto𝑌)
4637, 45impbida 598 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋1-1-onto𝑌𝐹 ∈ (𝑇 GrpHom 𝑆)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wcel 2200  wral 2508  ccnv 4717   Fn wfn 5312  wf 5313  1-1-ontowf1o 5316  cfv 5317  (class class class)co 6000  Basecbs 13027  +gcplusg 13105  Grpcgrp 13528   GrpHom cghm 13772
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1re 8089  ax-addrcl 8092
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-ov 6003  df-oprab 6004  df-mpo 6005  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-plusg 13118  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-grp 13531  df-ghm 13773
This theorem is referenced by:  rhmf1o  14126
  Copyright terms: Public domain W3C validator