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

Theorem grp1 13819
Description: The (smallest) structure representing a trivial group. According to Wikipedia ("Trivial group", 28-Apr-2019, https://en.wikipedia.org/wiki/Trivial_group) "In mathematics, a trivial group is a group consisting of a single element. All such groups are isomorphic, so one often speaks of the trivial group. The single element of the trivial group is the identity element". (Contributed by AV, 28-Apr-2019.)
Hypothesis
Ref Expression
grp1.m 𝑀 = {⟨(Base‘ndx), {𝐼}⟩, ⟨(+g‘ndx), {⟨⟨𝐼, 𝐼⟩, 𝐼⟩}⟩}
Assertion
Ref Expression
grp1 (𝐼𝑉𝑀 ∈ Grp)

Proof of Theorem grp1
Dummy variables 𝑒 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grp1.m . . 3 𝑀 = {⟨(Base‘ndx), {𝐼}⟩, ⟨(+g‘ndx), {⟨⟨𝐼, 𝐼⟩, 𝐼⟩}⟩}
21mnd1 13668 . 2 (𝐼𝑉𝑀 ∈ Mnd)
3 df-ov 6053 . . . . 5 (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩)
4 opexg 4344 . . . . . . 7 ((𝐼𝑉𝐼𝑉) → ⟨𝐼, 𝐼⟩ ∈ V)
54anidms 397 . . . . . 6 (𝐼𝑉 → ⟨𝐼, 𝐼⟩ ∈ V)
6 fvsng 5880 . . . . . 6 ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼𝑉) → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
75, 6mpancom 422 . . . . 5 (𝐼𝑉 → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
83, 7eqtrid 2277 . . . 4 (𝐼𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = 𝐼)
91mnd1id 13669 . . . 4 (𝐼𝑉 → (0g𝑀) = 𝐼)
108, 9eqtr4d 2268 . . 3 (𝐼𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀))
11 oveq2 6058 . . . . . . 7 (𝑖 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
1211eqeq1d 2241 . . . . . 6 (𝑖 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1312rexbidv 2543 . . . . 5 (𝑖 = 𝐼 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1413ralsng 3729 . . . 4 (𝐼𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
15 oveq1 6057 . . . . . 6 (𝑒 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
1615eqeq1d 2241 . . . . 5 (𝑒 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1716rexsng 3730 . . . 4 (𝐼𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1814, 17bitrd 188 . . 3 (𝐼𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1910, 18mpbird 167 . 2 (𝐼𝑉 → ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀))
20 eqid 2232 . . . 4 (Base‘𝑀) = (Base‘𝑀)
21 eqid 2232 . . . 4 (+g𝑀) = (+g𝑀)
22 eqid 2232 . . . 4 (0g𝑀) = (0g𝑀)
2320, 21, 22isgrp 13719 . . 3 (𝑀 ∈ Grp ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g𝑀)𝑖) = (0g𝑀)))
24 snexg 4297 . . . . . 6 (𝐼𝑉 → {𝐼} ∈ V)
25 opexg 4344 . . . . . . . 8 ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼𝑉) → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
265, 25mpancom 422 . . . . . . 7 (𝐼𝑉 → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
27 snexg 4297 . . . . . . 7 (⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
2826, 27syl 14 . . . . . 6 (𝐼𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
291grpbaseg 13340 . . . . . 6 (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {𝐼} = (Base‘𝑀))
3024, 28, 29syl2anc 411 . . . . 5 (𝐼𝑉 → {𝐼} = (Base‘𝑀))
311grpplusgg 13341 . . . . . . . . 9 (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g𝑀))
3224, 28, 31syl2anc 411 . . . . . . . 8 (𝐼𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g𝑀))
3332oveqd 6067 . . . . . . 7 (𝐼𝑉 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒(+g𝑀)𝑖))
3433eqeq1d 2241 . . . . . 6 (𝐼𝑉 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ (𝑒(+g𝑀)𝑖) = (0g𝑀)))
3530, 34rexeqbidv 2758 . . . . 5 (𝐼𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ ∃𝑒 ∈ (Base‘𝑀)(𝑒(+g𝑀)𝑖) = (0g𝑀)))
3630, 35raleqbidv 2757 . . . 4 (𝐼𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g𝑀)𝑖) = (0g𝑀)))
3736anbi2d 464 . . 3 (𝐼𝑉 → ((𝑀 ∈ Mnd ∧ ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀)) ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g𝑀)𝑖) = (0g𝑀))))
3823, 37bitr4id 199 . 2 (𝐼𝑉 → (𝑀 ∈ Grp ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀))))
392, 19, 38mpbir2and 953 1 (𝐼𝑉𝑀 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  wral 2520  wrex 2521  Vcvv 2813  {csn 3689  {cpr 3690  cop 3692  cfv 5352  (class class class)co 6050  ndxcnx 13209  Basecbs 13212  +gcplusg 13290  0gc0g 13469  Mndcmnd 13629  Grpcgrp 13713
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360  df-riota 6003  df-ov 6053  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-ndx 13215  df-slot 13216  df-base 13218  df-plusg 13303  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-grp 13716
This theorem is referenced by:  grp1inv  13820  ring1  14203
  Copyright terms: Public domain W3C validator