MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mgmn0plusgplusf Structured version   Visualization version   GIF version

Theorem mgmn0plusgplusf 18821
Description: The group addition function of a magma is the restriction of its group operation to its base set if the base set does not contain the empty set. (Contributed by AV, 16-Aug-2026.)
Hypotheses
Ref Expression
mgmn0plusgf.b 𝐵 = (Base‘𝐺)
mgmn0plusgf.p + = (+g‘𝐺)
mgmn0plusgf.g (𝜑 → 𝐺 ∈ Mgm)
mgmn0plusgf.0 (𝜑 → ∅ ∉ 𝐵)
mgmn0plusgplusf.p ⨣ = (+𝑓‘𝐺)
Assertion
Ref Expression
mgmn0plusgplusf (𝜑 → ⨣ = ( + ↾ (𝐵 × 𝐵)))

Proof of Theorem mgmn0plusgplusf
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mgmn0plusgf.g . . . 4 (𝜑 → 𝐺 ∈ Mgm)
2 mgmn0plusgf.b . . . . 5 𝐵 = (Base‘𝐺)
3 mgmn0plusgplusf.p . . . . 5 ⨣ = (+𝑓‘𝐺)
42, 3mgmplusf 18819 . . . 4 (𝐺 ∈ Mgm → ⨣ :(𝐵 × 𝐵)⟶𝐵)
51, 4syl 18 . . 3 (𝜑 → ⨣ :(𝐵 × 𝐵)⟶𝐵)
65ffnd 6708 . 2 (𝜑 → ⨣ Fn (𝐵 × 𝐵))
7 mgmn0plusgf.p . . . 4 + = (+g‘𝐺)
8 mgmn0plusgf.0 . . . 4 (𝜑 → ∅ ∉ 𝐵)
9 eqid 2761 . . . 4 ( + ↾ (𝐵 × 𝐵)) = ( + ↾ (𝐵 × 𝐵))
102, 7, 1, 8, 9mgmn0plusgf 18820 . . 3 (𝜑 → ( + ↾ (𝐵 × 𝐵)):(𝐵 × 𝐵)⟶𝐵)
1110ffnd 6708 . 2 (𝜑 → ( + ↾ (𝐵 × 𝐵)) Fn (𝐵 × 𝐵))
12 elxp 5674 . . . 4 (𝑧 ∈ (𝐵 × 𝐵) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
13 df-ov 7421 . . . . . . . . 9 (𝑥 + 𝑦) = ( + ‘⟨𝑥, 𝑦⟩)
142, 7, 3plusfval 18816 . . . . . . . . . 10 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 ⨣ 𝑦) = (𝑥 + 𝑦))
1514ad2antlr 740 . . . . . . . . 9 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝑥 ⨣ 𝑦) = (𝑥 + 𝑦))
16 opelxpi 5688 . . . . . . . . . . 11 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵))
1716ad2antlr 740 . . . . . . . . . 10 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵))
1817fvresd 6903 . . . . . . . . 9 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (( + ↾ (𝐵 × 𝐵))‘⟨𝑥, 𝑦⟩) = ( + ‘⟨𝑥, 𝑦⟩))
1913, 15, 183eqtr4a 2822 . . . . . . . 8 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝑥 ⨣ 𝑦) = (( + ↾ (𝐵 × 𝐵))‘⟨𝑥, 𝑦⟩))
20 fveq2 6883 . . . . . . . . . . 11 (𝑧 = ⟨𝑥, 𝑦⟩ → ( ⨣ ‘𝑧) = ( ⨣ ‘⟨𝑥, 𝑦⟩))
21 df-ov 7421 . . . . . . . . . . 11 (𝑥 ⨣ 𝑦) = ( ⨣ ‘⟨𝑥, 𝑦⟩)
2220, 21eqtr4di 2814 . . . . . . . . . 10 (𝑧 = ⟨𝑥, 𝑦⟩ → ( ⨣ ‘𝑧) = (𝑥 ⨣ 𝑦))
23 fveq2 6883 . . . . . . . . . 10 (𝑧 = ⟨𝑥, 𝑦⟩ → (( + ↾ (𝐵 × 𝐵))‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘⟨𝑥, 𝑦⟩))
2422, 23eqeq12d 2777 . . . . . . . . 9 (𝑧 = ⟨𝑥, 𝑦⟩ → (( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧) ↔ (𝑥 ⨣ 𝑦) = (( + ↾ (𝐵 × 𝐵))‘⟨𝑥, 𝑦⟩)))
2524adantl 487 . . . . . . . 8 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧) ↔ (𝑥 ⨣ 𝑦) = (( + ↾ (𝐵 × 𝐵))‘⟨𝑥, 𝑦⟩)))
2619, 25mpbird 260 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → ( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧))
2726exp31 425 . . . . . 6 (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑧 = ⟨𝑥, 𝑦⟩ → ( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧))))
2827impcomd 417 . . . . 5 (𝜑 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧)))
2928exlimdvv 1967 . . . 4 (𝜑 → (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧)))
3012, 29biimtrid 245 . . 3 (𝜑 → (𝑧 ∈ (𝐵 × 𝐵) → ( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧)))
3130imp 412 . 2 ((𝜑 ∧ 𝑧 ∈ (𝐵 × 𝐵)) → ( ⨣ ‘𝑧) = (( + ↾ (𝐵 × 𝐵))‘𝑧))
326, 11, 31eqfnfvd 7030 1 (𝜑 → ⨣ = ( + ↾ (𝐵 × 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ∉ wnel 3062  ∅c0 4279  ⟨cop 4590   × cxp 5649   ↾ cres 5653  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +gcplusg 17421  +𝑓cplusf 18806  Mgmcmgm 18807
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-plusf 18808  df-mgm 18809
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator