Users' Mathboxes Mathbox for Eric Schmidt < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fingrphf Structured version   Visualization version   GIF version

Theorem fingrphf 46360
Description: Every finite group is isomorphic to a group with hereditarily finite components. (Contributed by Eric Schmidt, 24-Oct-2026.)
Hypotheses
Ref Expression
fingrphf.1 𝐵 = (Base‘𝐺)
fingrphf.2 (𝜑 → 𝐺 ∈ Grp)
fingrphf.3 (𝜑 → 𝐵 ∈ Fin)
Assertion
Ref Expression
fingrphf (𝜑 → ∃ℎ ∈ HFStruct 𝐺 ≃𝑔 ℎ)
Distinct variable groups:   𝐵,ℎ   ℎ,𝐺
Allowed substitution hint:   𝜑(ℎ)

Proof of Theorem fingrphf
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 fingrphf.3 . . 3 (𝜑 → 𝐵 ∈ Fin)
2 ficardid 10079 . . . . 5 (𝐵 ∈ Fin → (card‘𝐵) ≈ 𝐵)
32ensymd 9069 . . . 4 (𝐵 ∈ Fin → 𝐵 ≈ (card‘𝐵))
4 bren 9020 . . . 4 (𝐵 ≈ (card‘𝐵) ↔ ∃𝑓 𝑓:𝐵⟶1-1onto(card‘𝐵))
53, 4sylib 221 . . 3 (𝐵 ∈ Fin → ∃𝑓 𝑓:𝐵⟶1-1onto(card‘𝐵))
61, 5syl 18 . 2 (𝜑 → ∃𝑓 𝑓:𝐵⟶1-1onto(card‘𝐵))
7 breq2 5111 . . 3 (ℎ = {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩} → (𝐺 ≃𝑔 ℎ ↔ 𝐺 ≃𝑔 {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}))
8 eqid 2766 . . . 4 (Base‘(𝑓 “s 𝐺)) = (Base‘(𝑓 “s 𝐺))
9 eqid 2766 . . . 4 (+𝑓‘(𝑓 “s 𝐺)) = (+𝑓‘(𝑓 “s 𝐺))
10 eqid 2766 . . . 4 {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩} = {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}
11 fingrphf.2 . . . . 5 (𝜑 → 𝐺 ∈ Grp)
12 eqidd 2767 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (𝑓 “s 𝐺) = (𝑓 “s 𝐺))
13 fingrphf.1 . . . . . . . 8 𝐵 = (Base‘𝐺)
1413a1i 11 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝐵 = (Base‘𝐺))
15 simpr 490 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝑓:𝐵⟶1-1onto(card‘𝐵))
16 simpl 488 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝐺 ∈ Grp)
17 fvex 6928 . . . . . . 7 (card‘𝐵) ∈ V
1812, 14, 15, 16, 17imasgimw 46251 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝑓 ∈ (𝐺 GrpIso (𝑓 “s 𝐺)))
19 gimghm 19530 . . . . . 6 (𝑓 ∈ (𝐺 GrpIso (𝑓 “s 𝐺)) → 𝑓 ∈ (𝐺 GrpHom (𝑓 “s 𝐺)))
20 ghmgrp2 19485 . . . . . 6 (𝑓 ∈ (𝐺 GrpHom (𝑓 “s 𝐺)) → (𝑓 “s 𝐺) ∈ Grp)
2118, 19, 203syl 19 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (𝑓 “s 𝐺) ∈ Grp)
2211, 21sylan 592 . . . 4 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (𝑓 “s 𝐺) ∈ Grp)
23 eqidd 2767 . . . . . 6 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (𝑓 “s 𝐺) = (𝑓 “s 𝐺))
2413a1i 11 . . . . . 6 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝐵 = (Base‘𝐺))
25 f1ofo 6861 . . . . . . 7 (𝑓:𝐵⟶1-1onto(card‘𝐵) → 𝑓:𝐵⟶onto(card‘𝐵))
2625adantl 487 . . . . . 6 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝑓:𝐵⟶onto(card‘𝐵))
2711adantr 486 . . . . . 6 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝐺 ∈ Grp)
2823, 24, 26, 27imasbas 17736 . . . . 5 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (card‘𝐵) = (Base‘(𝑓 “s 𝐺)))
29 ficardom 10078 . . . . . . 7 (𝐵 ∈ Fin → (card‘𝐵) ∈ ω)
30 omhf 46345 . . . . . . 7 ((card‘𝐵) ∈ ω → (card‘𝐵) ∈ HF )
311, 29, 303syl 19 . . . . . 6 (𝜑 → (card‘𝐵) ∈ HF )
3231adantr 486 . . . . 5 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (card‘𝐵) ∈ HF )
3328, 32eqeltrrd 2868 . . . 4 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (Base‘(𝑓 “s 𝐺)) ∈ HF )
348, 9, 10, 22, 33grpcanonhfstruct 46359 . . 3 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩} ∈ HFStruct)
358, 9, 10grpgimcanon 46252 . . . . . . 7 ((𝑓 “s 𝐺) ∈ Grp → ( I ↾ (Base‘(𝑓 “s 𝐺))) ∈ ((𝑓 “s 𝐺) GrpIso {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}))
3621, 35syl 18 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → ( I ↾ (Base‘(𝑓 “s 𝐺))) ∈ ((𝑓 “s 𝐺) GrpIso {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}))
37 gimco 19534 . . . . . 6 ((( I ↾ (Base‘(𝑓 “s 𝐺))) ∈ ((𝑓 “s 𝐺) GrpIso {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}) ∧ 𝑓 ∈ (𝐺 GrpIso (𝑓 “s 𝐺))) → (( I ↾ (Base‘(𝑓 “s 𝐺))) ∘ 𝑓) ∈ (𝐺 GrpIso {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}))
3836, 18, 37syl2anc 596 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → (( I ↾ (Base‘(𝑓 “s 𝐺))) ∘ 𝑓) ∈ (𝐺 GrpIso {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}))
39 brgici 19538 . . . . 5 ((( I ↾ (Base‘(𝑓 “s 𝐺))) ∘ 𝑓) ∈ (𝐺 GrpIso {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩}) → 𝐺 ≃𝑔 {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩})
4038, 39syl 18 . . . 4 ((𝐺 ∈ Grp ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝐺 ≃𝑔 {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩})
4111, 40sylan 592 . . 3 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → 𝐺 ≃𝑔 {⟨(Base‘ndx), (Base‘(𝑓 “s 𝐺))⟩, ⟨(+g‘ndx), (+𝑓‘(𝑓 “s 𝐺))⟩})
427, 34, 41rspcedvdw 3582 . 2 ((𝜑 ∧ 𝑓:𝐵⟶1-1onto(card‘𝐵)) → ∃ℎ ∈ HFStruct 𝐺 ≃𝑔 ℎ)
436, 42exlimddv 1972 1 (𝜑 → ∃ℎ ∈ HFStruct 𝐺 ≃𝑔 ℎ)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  ∃wrex 3093  {cpr 4589  ⟨cop 4839   class class class wbr 5107   I cid 5551   ↾ cres 5659   ∘ ccom 5661  ⟶ontowfo 6563  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450  ωcom 7910   ≈ cen 9007  Fincfn 9010   HF chf 9940  cardccrd 10052  ndxcnx 17417  Basecbs 17433  +gcplusg 17474   “s cimas 17728  +𝑓cplusf 18865  Grpcgrp 19196   GrpHom cghm 19479   GrpIso cgim 19523   ≃𝑔 cgic 19524  HFStructchfstruct 46350
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-map 8886  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-sup 9470  df-inf 9471  df-r1 9804  df-rank 9805  df-hf 9941  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-z 12733  df-dec 12854  df-uz 13005  df-fz 13679  df-struct 17371  df-slot 17406  df-ndx 17418  df-base 17434  df-plusg 17488  df-mulr 17489  df-sca 17491  df-vsca 17492  df-ip 17493  df-tset 17494  df-ple 17495  df-ds 17497  df-0g 17664  df-imas 17732  df-plusf 18867  df-mgm 18868  df-sgrp 18960  df-mnd 18976  df-mhm 19030  df-grp 19199  df-minusg 19200  df-ghm 19480  df-gim 19525  df-gic 19526  df-hfstruct 46351
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator