Theorem ablcomd 33374

Description: An abelian group operation is commutative, deduction version. (Contributed by Thierry Arnoux, 15-Feb-2026.)

Hypotheses

Ref	Expression
ablcomd.1	⊢ 𝐵 = (Base‘𝐺)
ablcomd.2	⊢ + = (+g‘𝐺)
ablcomd.3	⊢ (𝜑 → 𝐺 ∈ Abel)
ablcomd.4	⊢ (𝜑 → 𝑋 ∈ 𝐵)
ablcomd.5	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
ablcomd	⊢ (𝜑 → (𝑋 + 𝑌) = (𝑌 + 𝑋))

Proof of Theorem ablcomd

Step	Hyp	Ref	Expression
1		ablcomd.3	. 2 ⊢ (𝜑 → 𝐺 ∈ Abel)
2		ablcomd.4	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
3		ablcomd.5	. 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
4		ablcomd.1	. . 3 ⊢ 𝐵 = (Base‘𝐺)
5		ablcomd.2	. . 3 ⊢ + = (+g‘𝐺)
6	4, 5	ablcom 19873	. 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋))
7	1, 2, 3, 6	syl3anc 1398	1 ⊢ (𝜑 → (𝑋 + 𝑌) = (𝑌 + 𝑋))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2143  ‘cfv 6536  (class class class)co 7410  Basecbs 17273  +_gcplusg 17314  Abelcabl 19855

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-12 2213  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-iota 6492  df-fv 6544  df-ov 7413  df-cmn 19856  df-abl 19857

This theorem is used by:  dflring2  33792  vietalem  33978