Theorem grp1 13181

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 13030	. 2 ⊢ (𝐼 ∈ 𝑉 → 𝑀 ∈ Mnd)
3		df-ov 5922	. . . . 5 ⊢ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩)
4		opexg 4258	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐼 ∈ 𝑉) → ⟨𝐼, 𝐼⟩ ∈ V)
5	4	anidms 397	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → ⟨𝐼, 𝐼⟩ ∈ V)
6		fvsng 5755	. . . . . 6 ⊢ ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼 ∈ 𝑉) → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
7	5, 6	mpancom 422	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → ({⟨⟨𝐼, 𝐼⟩, 𝐼⟩}‘⟨𝐼, 𝐼⟩) = 𝐼)
8	3, 7	eqtrid 2238	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = 𝐼)
9	1	mnd1id 13031	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (0g‘𝑀) = 𝐼)
10	8, 9	eqtr4d 2229	. . 3 ⊢ (𝐼 ∈ 𝑉 → (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀))
11		oveq2 5927	. . . . . . 7 ⊢ (𝑖 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
12	11	eqeq1d 2202	. . . . . 6 ⊢ (𝑖 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
13	12	rexbidv 2495	. . . . 5 ⊢ (𝑖 = 𝐼 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
14	13	ralsng 3659	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
15		oveq1 5926	. . . . . 6 ⊢ (𝑒 = 𝐼 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼))
16	15	eqeq1d 2202	. . . . 5 ⊢ (𝑒 = 𝐼 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
17	16	rexsng 3660	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
18	14, 17	bitrd 188	. . 3 ⊢ (𝐼 ∈ 𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ (𝐼{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝐼) = (0g‘𝑀)))
19	10, 18	mpbird 167	. 2 ⊢ (𝐼 ∈ 𝑉 → ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀))
20		eqid 2193	. . . 4 ⊢ (Base‘𝑀) = (Base‘𝑀)
21		eqid 2193	. . . 4 ⊢ (+g‘𝑀) = (+g‘𝑀)
22		eqid 2193	. . . 4 ⊢ (0g‘𝑀) = (0g‘𝑀)
23	20, 21, 22	isgrp 13081	. . 3 ⊢ (𝑀 ∈ Grp ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
24		snexg 4214	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → {𝐼} ∈ V)
25		opexg 4258	. . . . . . . 8 ⊢ ((⟨𝐼, 𝐼⟩ ∈ V ∧ 𝐼 ∈ 𝑉) → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
26	5, 25	mpancom 422	. . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → ⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V)
27		snexg 4214	. . . . . . 7 ⊢ (⟨⟨𝐼, 𝐼⟩, 𝐼⟩ ∈ V → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
28	26, 27	syl 14	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V)
29	1	grpbaseg 12747	. . . . . 6 ⊢ (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {𝐼} = (Base‘𝑀))
30	24, 28, 29	syl2anc 411	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → {𝐼} = (Base‘𝑀))
31	1	grpplusgg 12748	. . . . . . . . 9 ⊢ (({𝐼} ∈ V ∧ {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} ∈ V) → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g‘𝑀))
32	24, 28, 31	syl2anc 411	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → {⟨⟨𝐼, 𝐼⟩, 𝐼⟩} = (+g‘𝑀))
33	32	oveqd 5936	. . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (𝑒(+g‘𝑀)𝑖))
34	33	eqeq1d 2202	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → ((𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ (𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
35	30, 34	rexeqbidv 2707	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → (∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
36	30, 35	raleqbidv 2706	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀) ↔ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀)))
37	36	anbi2d 464	. . 3 ⊢ (𝐼 ∈ 𝑉 → ((𝑀 ∈ Mnd ∧ ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀)) ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ (Base‘𝑀)∃𝑒 ∈ (Base‘𝑀)(𝑒(+g‘𝑀)𝑖) = (0g‘𝑀))))
38	23, 37	bitr4id 199	. 2 ⊢ (𝐼 ∈ 𝑉 → (𝑀 ∈ Grp ↔ (𝑀 ∈ Mnd ∧ ∀𝑖 ∈ {𝐼}∃𝑒 ∈ {𝐼} (𝑒{⟨⟨𝐼, 𝐼⟩, 𝐼⟩}𝑖) = (0g‘𝑀))))
39	2, 19, 38	mpbir2and 946	1 ⊢ (𝐼 ∈ 𝑉 → 𝑀 ∈ Grp)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2164  ∀wral 2472  ∃wrex 2473  Vcvv 2760  {csn 3619  {cpr 3620  ⟨cop 3622  ‘cfv 5255  (class class class)co 5919  ndxcnx 12618  Basecbs 12621  +_gcplusg 12698  0_gc0g 12870  Mndcmnd 13000  Grpcgrp 13075

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-pre-ltirr 7986  ax-pre-ltadd 7990

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-iota 5216  df-fun 5257  df-fn 5258  df-fv 5263  df-riota 5874  df-ov 5922  df-pnf 8058  df-mnf 8059  df-ltxr 8061  df-inn 8985  df-2 9043  df-ndx 12624  df-slot 12625  df-base 12627  df-plusg 12711  df-0g 12872  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-grp 13078

This theorem is referenced by:  grp1inv  13182  ring1  13558