MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  gicsubgen Structured version   Visualization version   GIF version

Theorem gicsubgen 18420
Description: A less trivial example of a group invariant: cardinality of the subgroup lattice. (Contributed by Stefan O'Rear, 25-Jan-2015.)
Assertion
Ref Expression
gicsubgen (𝑅𝑔 𝑆 → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))

Proof of Theorem gicsubgen
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brgic 18411 . . 3 (𝑅𝑔 𝑆 ↔ (𝑅 GrpIso 𝑆) ≠ ∅)
2 n0 4312 . . 3 ((𝑅 GrpIso 𝑆) ≠ ∅ ↔ ∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆))
31, 2bitri 277 . 2 (𝑅𝑔 𝑆 ↔ ∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆))
4 fvexd 6687 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ∈ V)
5 fvexd 6687 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑆) ∈ V)
6 vex 3499 . . . . . 6 𝑎 ∈ V
76imaex 7623 . . . . 5 (𝑎𝑏) ∈ V
872a1i 12 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (𝑏 ∈ (SubGrp‘𝑅) → (𝑎𝑏) ∈ V))
96cnvex 7632 . . . . . 6 𝑎 ∈ V
109imaex 7623 . . . . 5 (𝑎𝑐) ∈ V
11102a1i 12 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (𝑐 ∈ (SubGrp‘𝑆) → (𝑎𝑐) ∈ V))
12 gimghm 18406 . . . . . . . . 9 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎 ∈ (𝑅 GrpHom 𝑆))
13 ghmima 18381 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑎𝑏) ∈ (SubGrp‘𝑆))
1412, 13sylan 582 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑎𝑏) ∈ (SubGrp‘𝑆))
15 eqid 2823 . . . . . . . . . . . 12 (Base‘𝑅) = (Base‘𝑅)
16 eqid 2823 . . . . . . . . . . . 12 (Base‘𝑆) = (Base‘𝑆)
1715, 16gimf1o 18405 . . . . . . . . . . 11 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆))
18 f1of1 6616 . . . . . . . . . . 11 (𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆) → 𝑎:(Base‘𝑅)–1-1→(Base‘𝑆))
1917, 18syl 17 . . . . . . . . . 10 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–1-1→(Base‘𝑆))
2015subgss 18282 . . . . . . . . . 10 (𝑏 ∈ (SubGrp‘𝑅) → 𝑏 ⊆ (Base‘𝑅))
21 f1imacnv 6633 . . . . . . . . . 10 ((𝑎:(Base‘𝑅)–1-1→(Base‘𝑆) ∧ 𝑏 ⊆ (Base‘𝑅)) → (𝑎 “ (𝑎𝑏)) = 𝑏)
2219, 20, 21syl2an 597 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑎 “ (𝑎𝑏)) = 𝑏)
2322eqcomd 2829 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → 𝑏 = (𝑎 “ (𝑎𝑏)))
2414, 23jca 514 . . . . . . 7 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → ((𝑎𝑏) ∈ (SubGrp‘𝑆) ∧ 𝑏 = (𝑎 “ (𝑎𝑏))))
25 eleq1 2902 . . . . . . . 8 (𝑐 = (𝑎𝑏) → (𝑐 ∈ (SubGrp‘𝑆) ↔ (𝑎𝑏) ∈ (SubGrp‘𝑆)))
26 imaeq2 5927 . . . . . . . . 9 (𝑐 = (𝑎𝑏) → (𝑎𝑐) = (𝑎 “ (𝑎𝑏)))
2726eqeq2d 2834 . . . . . . . 8 (𝑐 = (𝑎𝑏) → (𝑏 = (𝑎𝑐) ↔ 𝑏 = (𝑎 “ (𝑎𝑏))))
2825, 27anbi12d 632 . . . . . . 7 (𝑐 = (𝑎𝑏) → ((𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (𝑎𝑐)) ↔ ((𝑎𝑏) ∈ (SubGrp‘𝑆) ∧ 𝑏 = (𝑎 “ (𝑎𝑏)))))
2924, 28syl5ibrcom 249 . . . . . 6 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑐 = (𝑎𝑏) → (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (𝑎𝑐))))
3029impr 457 . . . . 5 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎𝑏))) → (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (𝑎𝑐)))
31 ghmpreima 18382 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑎𝑐) ∈ (SubGrp‘𝑅))
3212, 31sylan 582 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑎𝑐) ∈ (SubGrp‘𝑅))
33 f1ofo 6624 . . . . . . . . . . 11 (𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆) → 𝑎:(Base‘𝑅)–onto→(Base‘𝑆))
3417, 33syl 17 . . . . . . . . . 10 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–onto→(Base‘𝑆))
3516subgss 18282 . . . . . . . . . 10 (𝑐 ∈ (SubGrp‘𝑆) → 𝑐 ⊆ (Base‘𝑆))
36 foimacnv 6634 . . . . . . . . . 10 ((𝑎:(Base‘𝑅)–onto→(Base‘𝑆) ∧ 𝑐 ⊆ (Base‘𝑆)) → (𝑎 “ (𝑎𝑐)) = 𝑐)
3734, 35, 36syl2an 597 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑎 “ (𝑎𝑐)) = 𝑐)
3837eqcomd 2829 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → 𝑐 = (𝑎 “ (𝑎𝑐)))
3932, 38jca 514 . . . . . . 7 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → ((𝑎𝑐) ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ (𝑎𝑐))))
40 eleq1 2902 . . . . . . . 8 (𝑏 = (𝑎𝑐) → (𝑏 ∈ (SubGrp‘𝑅) ↔ (𝑎𝑐) ∈ (SubGrp‘𝑅)))
41 imaeq2 5927 . . . . . . . . 9 (𝑏 = (𝑎𝑐) → (𝑎𝑏) = (𝑎 “ (𝑎𝑐)))
4241eqeq2d 2834 . . . . . . . 8 (𝑏 = (𝑎𝑐) → (𝑐 = (𝑎𝑏) ↔ 𝑐 = (𝑎 “ (𝑎𝑐))))
4340, 42anbi12d 632 . . . . . . 7 (𝑏 = (𝑎𝑐) → ((𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎𝑏)) ↔ ((𝑎𝑐) ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ (𝑎𝑐)))))
4439, 43syl5ibrcom 249 . . . . . 6 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑏 = (𝑎𝑐) → (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎𝑏))))
4544impr 457 . . . . 5 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (𝑎𝑐))) → (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎𝑏)))
4630, 45impbida 799 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → ((𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎𝑏)) ↔ (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (𝑎𝑐))))
474, 5, 8, 11, 46en2d 8547 . . 3 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
4847exlimiv 1931 . 2 (∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
493, 48sylbi 219 1 (𝑅𝑔 𝑆 → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wex 1780  wcel 2114  wne 3018  Vcvv 3496  wss 3938  c0 4293   class class class wbr 5068  ccnv 5556  cima 5560  1-1wf1 6354  ontowfo 6355  1-1-ontowf1o 6356  cfv 6357  (class class class)co 7158  cen 8508  Basecbs 16485  SubGrpcsubg 18275   GrpHom cghm 18357   GrpIso cgim 18399  𝑔 cgic 18400
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-er 8291  df-en 8512  df-dom 8513  df-sdom 8514  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-0g 16717  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-grp 18108  df-minusg 18109  df-subg 18278  df-ghm 18358  df-gim 18401  df-gic 18402
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator