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

Theorem gicsubgen 19499
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 19490 . . 3 (𝑅 ≃𝑔 𝑆 ↔ (𝑅 GrpIso 𝑆) ≠ ∅)
2 n0 4299 . . 3 ((𝑅 GrpIso 𝑆) ≠ ∅ ↔ ∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆))
31, 2bitri 278 . 2 (𝑅 ≃𝑔 𝑆 ↔ ∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆))
4 fvexd 6901 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ∈ V)
5 fvexd 6901 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑆) ∈ V)
6 vex 3454 . . . . . 6 𝑎 ∈ V
76imaex 7927 . . . . 5 (𝑎 “ 𝑏) ∈ V
872a1i 12 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (𝑏 ∈ (SubGrp‘𝑅) → (𝑎 “ 𝑏) ∈ V))
96cnvex 7938 . . . . . 6 ◡𝑎 ∈ V
109imaex 7927 . . . . 5 (◡𝑎 “ 𝑐) ∈ V
11102a1i 12 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (𝑐 ∈ (SubGrp‘𝑆) → (◡𝑎 “ 𝑐) ∈ V))
12 gimghm 19484 . . . . . . . . 9 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎 ∈ (𝑅 GrpHom 𝑆))
13 ghmima 19457 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑎 “ 𝑏) ∈ (SubGrp‘𝑆))
1412, 13sylan 592 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑎 “ 𝑏) ∈ (SubGrp‘𝑆))
15 eqid 2760 . . . . . . . . . . . 12 (Base‘𝑅) = (Base‘𝑅)
16 eqid 2760 . . . . . . . . . . . 12 (Base‘𝑆) = (Base‘𝑆)
1715, 16gimf1o 19483 . . . . . . . . . . 11 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆))
18 f1of1 6824 . . . . . . . . . . 11 (𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆) → 𝑎:(Base‘𝑅)–1-1→(Base‘𝑆))
1917, 18syl 18 . . . . . . . . . 10 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–1-1→(Base‘𝑆))
2015subgss 19343 . . . . . . . . . 10 (𝑏 ∈ (SubGrp‘𝑅) → 𝑏 ⊆ (Base‘𝑅))
21 f1imacnv 6842 . . . . . . . . . 10 ((𝑎:(Base‘𝑅)–1-1→(Base‘𝑆) ∧ 𝑏 ⊆ (Base‘𝑅)) → (◡𝑎 “ (𝑎 “ 𝑏)) = 𝑏)
2219, 20, 21syl2an 608 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (◡𝑎 “ (𝑎 “ 𝑏)) = 𝑏)
2322eqcomd 2766 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏)))
2414, 23jca 521 . . . . . . 7 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → ((𝑎 “ 𝑏) ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏))))
25 eleq1 2848 . . . . . . . 8 (𝑐 = (𝑎 “ 𝑏) → (𝑐 ∈ (SubGrp‘𝑆) ↔ (𝑎 “ 𝑏) ∈ (SubGrp‘𝑆)))
26 imaeq2 6047 . . . . . . . . 9 (𝑐 = (𝑎 “ 𝑏) → (◡𝑎 “ 𝑐) = (◡𝑎 “ (𝑎 “ 𝑏)))
2726eqeq2d 2771 . . . . . . . 8 (𝑐 = (𝑎 “ 𝑏) → (𝑏 = (◡𝑎 “ 𝑐) ↔ 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏))))
2825, 27anbi12d 644 . . . . . . 7 (𝑐 = (𝑎 “ 𝑏) → ((𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐)) ↔ ((𝑎 “ 𝑏) ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏)))))
2924, 28syl5ibrcom 250 . . . . . 6 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑐 = (𝑎 “ 𝑏) → (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐))))
3029impr 460 . . . . 5 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏))) → (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐)))
31 ghmpreima 19458 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅))
3212, 31sylan 592 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅))
33 f1ofo 6833 . . . . . . . . . . 11 (𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆) → 𝑎:(Base‘𝑅)–onto→(Base‘𝑆))
3417, 33syl 18 . . . . . . . . . 10 (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–onto→(Base‘𝑆))
3516subgss 19343 . . . . . . . . . 10 (𝑐 ∈ (SubGrp‘𝑆) → 𝑐 ⊆ (Base‘𝑆))
36 foimacnv 6843 . . . . . . . . . 10 ((𝑎:(Base‘𝑅)–onto→(Base‘𝑆) ∧ 𝑐 ⊆ (Base‘𝑆)) → (𝑎 “ (◡𝑎 “ 𝑐)) = 𝑐)
3734, 35, 36syl2an 608 . . . . . . . . 9 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑎 “ (◡𝑎 “ 𝑐)) = 𝑐)
3837eqcomd 2766 . . . . . . . 8 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐)))
3932, 38jca 521 . . . . . . 7 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → ((◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐))))
40 eleq1 2848 . . . . . . . 8 (𝑏 = (◡𝑎 “ 𝑐) → (𝑏 ∈ (SubGrp‘𝑅) ↔ (◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅)))
41 imaeq2 6047 . . . . . . . . 9 (𝑏 = (◡𝑎 “ 𝑐) → (𝑎 “ 𝑏) = (𝑎 “ (◡𝑎 “ 𝑐)))
4241eqeq2d 2771 . . . . . . . 8 (𝑏 = (◡𝑎 “ 𝑐) → (𝑐 = (𝑎 “ 𝑏) ↔ 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐))))
4340, 42anbi12d 644 . . . . . . 7 (𝑏 = (◡𝑎 “ 𝑐) → ((𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏)) ↔ ((◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐)))))
4439, 43syl5ibrcom 250 . . . . . 6 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑏 = (◡𝑎 “ 𝑐) → (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏))))
4544impr 460 . . . . 5 ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐))) → (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏)))
4630, 45impbida 813 . . . 4 (𝑎 ∈ (𝑅 GrpIso 𝑆) → ((𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏)) ↔ (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐))))
474, 5, 8, 11, 46en2d 9019 . . 3 (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
4847exlimiv 1962 . 2 (∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
493, 48sylbi 220 1 (𝑅 ≃𝑔 𝑆 → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  Vcvv 3450   ⊆ wss 3895  ∅c0 4278   class class class wbr 5102  ◡ccnv 5649   “ cima 5653  –1-1→wf1 6536  –onto→wfo 6537  –1-1-onto→wf1o 6538  ‘cfv 6539  (class class class)co 7421   ≈ cen 8974  Basecbs 17393  SubGrpcsubg 19336   GrpHom cghm 19433   GrpIso cgim 19477   ≃𝑔 cgic 19478
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752  ax-cnex 11260  ax-resscn 11261  ax-1cn 11262  ax-icn 11263  ax-addcl 11264  ax-addrcl 11265  ax-mulcl 11266  ax-mulrcl 11267  ax-mulcom 11268  ax-addass 11269  ax-mulass 11270  ax-distr 11271  ax-i2m1 11272  ax-1ne0 11273  ax-1rid 11274  ax-rnegex 11275  ax-rrecex 11276  ax-cnre 11277  ax-pre-lttri 11278  ax-pre-lttrn 11279  ax-pre-ltadd 11280  ax-pre-mulgt0 11281
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-1st 8002  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-1o 8480  df-er 8721  df-map 8853  df-en 8978  df-dom 8979  df-sdom 8980  df-pnf 11349  df-mnf 11350  df-xr 11351  df-ltxr 11352  df-le 11353  df-sub 11547  df-neg 11548  df-nn 12340  df-2 12409  df-sets 17348  df-slot 17366  df-ndx 17378  df-base 17394  df-ress 17415  df-plusg 17447  df-0g 17618  df-mgm 18822  df-sgrp 18914  df-mnd 18930  df-grp 19153  df-minusg 19154  df-subg 19339  df-ghm 19434  df-gim 19479  df-gic 19480
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator