Theorem grp1 13888

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.

Step	Hyp	Ref	Expression
1		grp1.m	. . 3 ⊢ 𝑀 = {⟨(Base‘ndx), {𝐼}⟩, ⟨(+g‘ndx), {⟨⟨𝐼, 𝐼⟩, 𝐼⟩}⟩}
2	1	mnd1 13739	. 2 ⊢ (𝐼 ∈ 𝑉 → 𝑀 ∈ Mnd)
3		df-ov 6078	. . . . 5 ⊢ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩)
4		opexg 4363	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐼 ∈ 𝑉) → ⟨𝐼, 𝐼⟩ ∈ V)
5	4	anidms 401	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → ⟨𝐼, 𝐼⟩ ∈ V)
6		fvsng 5902	. . . . . 6 ⊢ ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼 ∈ 𝑉) → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
7	5, 6	mpancom 426	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
8	3, 7	eqtrid 2283	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = 𝐼)
9	1	mnd1id 13740	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (0g‘𝑀) = 𝐼)
10	8, 9	eqtr4d 2274	. . 3 ⊢ (𝐼 ∈ 𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀))
11		oveq2 6083	. . . . . . 7 ⊢ (𝑖 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
12	11	eqeq1d 2247	. . . . . 6 ⊢ (𝑖 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
13	12	rexbidv 2551	. . . . 5 ⊢ (𝑖 = 𝐼 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
14	13	ralsng 3745	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
15		oveq1 6082	. . . . . 6 ⊢ (𝑒 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
16	15	eqeq1d 2247	. . . . 5 ⊢ (𝑒 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
17	16	rexsng 3746	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
18	14, 17	bitrd 188	. . 3 ⊢ (𝐼 ∈ 𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
19	10, 18	mpbird 167	. 2 ⊢ (𝐼 ∈ 𝑉 → ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀))
20		eqid 2238	. . . 4 ⊢ (Base‘𝑀) = (Base‘𝑀)
21		eqid 2238	. . . 4 ⊢ (+g‘𝑀) = (+g‘𝑀)
22		eqid 2238	. . . 4 ⊢ (0g‘𝑀) = (0g‘𝑀)
23	20, 21, 22	isgrp 13788	. . 3 ⊢ (𝑀 ∈ Grp ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
24		snexg 4316	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → {𝐼} ∈ V)
25		opexg 4363	. . . . . . . 8 ⊢ ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼 ∈ 𝑉) → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
26	5, 25	mpancom 426	. . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
27		snexg 4316	. . . . . . 7 ⊢ (⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
28	26, 27	syl 14	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
29	1	grpbaseg 13458	. . . . . 6 ⊢ (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {𝐼} = (Base‘𝑀))
30	24, 28, 29	syl2anc 415	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → {𝐼} = (Base‘𝑀))
31	1	grpplusgg 13459	. . . . . . . . 9 ⊢ (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g‘𝑀))
32	24, 28, 31	syl2anc 415	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g‘𝑀))
33	32	oveqd 6092	. . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒(+g‘𝑀)𝑖))
34	33	eqeq1d 2247	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ (𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
35	30, 34	rexeqbidv 2766	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
36	30, 35	raleqbidv 2765	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
37	36	anbi2d 468	. . 3 ⊢ (𝐼 ∈ 𝑉 → ((𝑀 ∈ Mnd ∧ ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀)) ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀))))
38	23, 37	bitr4id 199	. 2 ⊢ (𝐼 ∈ 𝑉 → (𝑀 ∈ Grp ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀))))
39	2, 19, 38	mpbir2and 957	1 ⊢ (𝐼 ∈ 𝑉 → 𝑀 ∈ Grp)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  Vcvv 2821  {csn 3705  {cpr 3706  ⟨cop 3708  ‘cfv 5372  (class class class)co 6075  ndxcnx 13327  Basecbs 13330  +_gcplusg 13408  0_gc0g 13587  Mndcmnd 13706  Grpcgrp 13782

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-ltadd 8285

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785

This theorem is referenced by:  grp1inv  13889  ring1  14337