Theorem ismgm 13677

Description: The predicate "is a magma". (Contributed by FL, 2-Nov-2009.) (Revised by AV, 6-Jan-2020.)

Hypotheses

Ref	Expression
ismgm.b	⊢ 𝐵 = (Base‘𝑀)
ismgm.o	⊢ ⚬ = (+g‘𝑀)

Assertion

Ref	Expression
ismgm	⊢ (𝑀 ∈ 𝑉 → (𝑀 ∈ Mgm ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ⚬ 𝑦) ∈ 𝐵))

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝑀,𝑦   𝑥, ⚬ ,𝑦

Allowed substitution hints:   𝑉(𝑥, 𝑦)

Proof of Theorem ismgm

Dummy variables 𝑏 𝑚 𝑜 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		basfn 13411	. . . . 5 ⊢ Base Fn V
2		vex 2824	. . . . 5 ⊢ 𝑚 ∈ V
3		funfvex 5712	. . . . . 6 ⊢ ((Fun Base ∧ 𝑚 ∈ dom Base) → (Base‘𝑚) ∈ V)
4	3	funfni 5483	. . . . 5 ⊢ ((Base Fn V ∧ 𝑚 ∈ V) → (Base‘𝑚) ∈ V)
5	1, 2, 4	mp2an 430	. . . 4 ⊢ (Base‘𝑚) ∈ V
6	5	a1i 9	. . 3 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) ∈ V)
7		fveq2 5695	. . . 4 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
8		ismgm.b	. . . 4 ⊢ 𝐵 = (Base‘𝑀)
9	7, 8	eqtr4di 2289	. . 3 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = 𝐵)
10		plusgslid 13466	. . . . . . 7 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
11	10	slotex 13379	. . . . . 6 ⊢ (𝑚 ∈ V → (+g‘𝑚) ∈ V)
12	11	elv 2825	. . . . 5 ⊢ (+g‘𝑚) ∈ V
13	12	a1i 9	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) → (+g‘𝑚) ∈ V)
14		fveq2 5695	. . . . . 6 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = (+g‘𝑀))
15	14	adantr 276	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) → (+g‘𝑚) = (+g‘𝑀))
16		ismgm.o	. . . . 5 ⊢ ⚬ = (+g‘𝑀)
17	15, 16	eqtr4di 2289	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) → (+g‘𝑚) = ⚬ )
18		simplr 533	. . . . 5 ⊢ (((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) ∧ 𝑜 = ⚬ ) → 𝑏 = 𝐵)
19		oveq 6091	. . . . . . . 8 ⊢ (𝑜 = ⚬ → (𝑥𝑜𝑦) = (𝑥 ⚬ 𝑦))
20	19	adantl 277	. . . . . . 7 ⊢ (((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) ∧ 𝑜 = ⚬ ) → (𝑥𝑜𝑦) = (𝑥 ⚬ 𝑦))
21	20, 18	eleq12d 2309	. . . . . 6 ⊢ (((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) ∧ 𝑜 = ⚬ ) → ((𝑥𝑜𝑦) ∈ 𝑏 ↔ (𝑥 ⚬ 𝑦) ∈ 𝐵))
22	18, 21	raleqbidv 2765	. . . . 5 ⊢ (((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) ∧ 𝑜 = ⚬ ) → (∀𝑦 ∈ 𝑏 (𝑥𝑜𝑦) ∈ 𝑏 ↔ ∀𝑦 ∈ 𝐵 (𝑥 ⚬ 𝑦) ∈ 𝐵))
23	18, 22	raleqbidv 2765	. . . 4 ⊢ (((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) ∧ 𝑜 = ⚬ ) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥𝑜𝑦) ∈ 𝑏 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ⚬ 𝑦) ∈ 𝐵))
24	13, 17, 23	sbcied2 3089	. . 3 ⊢ ((𝑚 = 𝑀 ∧ 𝑏 = 𝐵) → ([(+g‘𝑚) / 𝑜]∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥𝑜𝑦) ∈ 𝑏 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ⚬ 𝑦) ∈ 𝐵))
25	6, 9, 24	sbcied2 3089	. 2 ⊢ (𝑚 = 𝑀 → ([(Base‘𝑚) / 𝑏][(+g‘𝑚) / 𝑜]∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥𝑜𝑦) ∈ 𝑏 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ⚬ 𝑦) ∈ 𝐵))
26		df-mgm 13676	. 2 ⊢ Mgm = {𝑚 ∣ [(Base‘𝑚) / 𝑏][(+g‘𝑚) / 𝑜]∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥𝑜𝑦) ∈ 𝑏}
27	25, 26	elab2g 2973	1 ⊢ (𝑀 ∈ 𝑉 → (𝑀 ∈ Mgm ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ⚬ 𝑦) ∈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821  [wsbc 3051   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  Basecbs 13352  +_gcplusg 13431  Mgmcmgm 13674

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-mgm 13676

This theorem is used by:  ismgmn0  13678  mgmcl  13679  mgm0  13689  issgrpv  13719  rnglidlmmgm  14833