Theorem toycom 39558

Description: Show the commutative law for an operation 𝑂 on a toy structure class 𝐶 of commutative operations on ℂ. This illustrates how a structure class can be partially specialized. In practice, we would ordinarily define a new constant such as "CAbel" in place of 𝐶. (Contributed by NM, 17-Mar-2013.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
toycom.1	⊢ 𝐶 = {𝑔 ∈ Abel ∣ (Base‘𝑔) = ℂ}
toycom.2	⊢ + = (+g‘𝐾)

Assertion

Ref	Expression
toycom	⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴))

Distinct variable group:   𝑔,𝐾

Allowed substitution hints:   𝐴(𝑔)   𝐵(𝑔)   𝐶(𝑔)   + (𝑔)

Proof of Theorem toycom

Step	Hyp	Ref	Expression
1		toycom.1	. . . . . 6 ⊢ 𝐶 = {𝑔 ∈ Abel ∣ (Base‘𝑔) = ℂ}
2		ssrab2 4031	. . . . . 6 ⊢ {𝑔 ∈ Abel ∣ (Base‘𝑔) = ℂ} ⊆ Abel
3	1, 2	eqsstri 3980	. . . . 5 ⊢ 𝐶 ⊆ Abel
4	3	sseli 3930	. . . 4 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ Abel)
5	4	3ad2ant1 1145	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐾 ∈ Abel)
6		simp2 1149	. . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ)
7		fveq2 6862	. . . . . . . 8 ⊢ (𝑔 = 𝐾 → (Base‘𝑔) = (Base‘𝐾))
8	7	eqeq1d 2763	. . . . . . 7 ⊢ (𝑔 = 𝐾 → ((Base‘𝑔) = ℂ ↔ (Base‘𝐾) = ℂ))
9	8, 1	elrab2 3652	. . . . . 6 ⊢ (𝐾 ∈ 𝐶 ↔ (𝐾 ∈ Abel ∧ (Base‘𝐾) = ℂ))
10	9	simprbi 501	. . . . 5 ⊢ (𝐾 ∈ 𝐶 → (Base‘𝐾) = ℂ)
11	10	3ad2ant1 1145	. . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (Base‘𝐾) = ℂ)
12	6, 11	eleqtrrd 2864	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ (Base‘𝐾))
13		simp3 1150	. . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
14	13, 11	eleqtrrd 2864	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ (Base‘𝐾))
15		eqid 2761	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
16		eqid 2761	. . . 4 ⊢ (+g‘𝐾) = (+g‘𝐾)
17	15, 16	ablcom 19830	. . 3 ⊢ ((𝐾 ∈ Abel ∧ 𝐴 ∈ (Base‘𝐾) ∧ 𝐵 ∈ (Base‘𝐾)) → (𝐴(+g‘𝐾)𝐵) = (𝐵(+g‘𝐾)𝐴))
18	5, 12, 14, 17	syl3anc 1389	. 2 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴(+g‘𝐾)𝐵) = (𝐵(+g‘𝐾)𝐴))
19		toycom.2	. . 3 ⊢ + = (+g‘𝐾)
20	19	oveqi 7404	. 2 ⊢ (𝐴 + 𝐵) = (𝐴(+g‘𝐾)𝐵)
21	19	oveqi 7404	. 2 ⊢ (𝐵 + 𝐴) = (𝐵(+g‘𝐾)𝐴)
22	18, 20, 21	3eqtr4g 2821	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴))

Syntax hints:   → wi 4   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  {crab 3413  ‘cfv 6516  (class class class)co 7391  ℂcc 11065  Basecbs 17236  +_gcplusg 17277  Abelcabl 19812

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-12 2211  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-iota 6472  df-fv 6524  df-ov 7394  df-cmn 19813  df-abl 19814

This theorem is referenced by: (None)