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

Theorem grp1 13694
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 13543 . 2 (𝐼𝑉𝑀 ∈ Mnd)
3 df-ov 6021 . . . . 5 (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩)
4 opexg 4320 . . . . . . 7 ((𝐼𝑉𝐼𝑉) → ⟨𝐼, 𝐼⟩ ∈ V)
54anidms 397 . . . . . 6 (𝐼𝑉 → ⟨𝐼, 𝐼⟩ ∈ V)
6 fvsng 5850 . . . . . 6 ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼𝑉) → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
75, 6mpancom 422 . . . . 5 (𝐼𝑉 → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
83, 7eqtrid 2276 . . . 4 (𝐼𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = 𝐼)
91mnd1id 13544 . . . 4 (𝐼𝑉 → (0g𝑀) = 𝐼)
108, 9eqtr4d 2267 . . 3 (𝐼𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀))
11 oveq2 6026 . . . . . . 7 (𝑖 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
1211eqeq1d 2240 . . . . . 6 (𝑖 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1312rexbidv 2533 . . . . 5 (𝑖 = 𝐼 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1413ralsng 3709 . . . 4 (𝐼𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
15 oveq1 6025 . . . . . 6 (𝑒 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
1615eqeq1d 2240 . . . . 5 (𝑒 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1716rexsng 3710 . . . 4 (𝐼𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1814, 17bitrd 188 . . 3 (𝐼𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g𝑀)))
1910, 18mpbird 167 . 2 (𝐼𝑉 → ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀))
20 eqid 2231 . . . 4 (Base‘𝑀) = (Base‘𝑀)
21 eqid 2231 . . . 4 (+g𝑀) = (+g𝑀)
22 eqid 2231 . . . 4 (0g𝑀) = (0g𝑀)
2320, 21, 22isgrp 13594 . . 3 (𝑀 ∈ Grp ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g𝑀)𝑖) = (0g𝑀)))
24 snexg 4274 . . . . . 6 (𝐼𝑉 → {𝐼} ∈ V)
25 opexg 4320 . . . . . . . 8 ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼𝑉) → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
265, 25mpancom 422 . . . . . . 7 (𝐼𝑉 → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
27 snexg 4274 . . . . . . 7 (⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
2826, 27syl 14 . . . . . 6 (𝐼𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
291grpbaseg 13215 . . . . . 6 (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {𝐼} = (Base‘𝑀))
3024, 28, 29syl2anc 411 . . . . 5 (𝐼𝑉 → {𝐼} = (Base‘𝑀))
311grpplusgg 13216 . . . . . . . . 9 (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g𝑀))
3224, 28, 31syl2anc 411 . . . . . . . 8 (𝐼𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g𝑀))
3332oveqd 6035 . . . . . . 7 (𝐼𝑉 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒(+g𝑀)𝑖))
3433eqeq1d 2240 . . . . . 6 (𝐼𝑉 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ (𝑒(+g𝑀)𝑖) = (0g𝑀)))
3530, 34rexeqbidv 2747 . . . . 5 (𝐼𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g𝑀) ↔ ∃𝑒 ∈ (Base‘𝑀)(𝑒(+g𝑀)𝑖) = (0g𝑀)))
3630, 35raleqbidv 2746 . . . 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 952 1 (𝐼𝑉𝑀 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202  wral 2510  wrex 2511  Vcvv 2802  {csn 3669  {cpr 3670  cop 3672  cfv 5326  (class class class)co 6018  ndxcnx 13084  Basecbs 13087  +gcplusg 13165  0gc0g 13344  Mndcmnd 13504  Grpcgrp 13588
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5971  df-ov 6021  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-ndx 13090  df-slot 13091  df-base 13093  df-plusg 13178  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591
This theorem is referenced by:  grp1inv  13695  ring1  14078
  Copyright terms: Public domain W3C validator