Theorem toycom 40010

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 4028	. . . . . 6 ⊢ {𝑔 ∈ Abel ∣ (Base‘𝑔) = ℂ} ⊆ Abel
3	1, 2	eqsstri 3977	. . . . 5 ⊢ 𝐶 ⊆ Abel
4	3	sseli 3927	. . . 4 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ Abel)
5	4	3ad2ant1 1151	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐾 ∈ Abel)
6		simp2 1155	. . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ)
7		fveq2 6883	. . . . . . . 8 ⊢ (𝑔 = 𝐾 → (Base‘𝑔) = (Base‘𝐾))
8	7	eqeq1d 2763	. . . . . . 7 ⊢ (𝑔 = 𝐾 → ((Base‘𝑔) = ℂ ↔ (Base‘𝐾) = ℂ))
9	8, 1	elrab2 3649	. . . . . 6 ⊢ (𝐾 ∈ 𝐶 ↔ (𝐾 ∈ Abel ∧ (Base‘𝐾) = ℂ))
10	9	simprbi 503	. . . . 5 ⊢ (𝐾 ∈ 𝐶 → (Base‘𝐾) = ℂ)
11	10	3ad2ant1 1151	. . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (Base‘𝐾) = ℂ)
12	6, 11	eleqtrrd 2864	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ (Base‘𝐾))
13		simp3 1156	. . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
14	13, 11	eleqtrrd 2864	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ (Base‘𝐾))
15		eqid 2761	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
16		eqid 2761	. . . 4 ⊢ (+g‘𝐾) = (+g‘𝐾)
17	15, 16	ablcom 20006	. . 3 ⊢ ((𝐾 ∈ Abel ∧ 𝐴 ∈ (Base‘𝐾) ∧ 𝐵 ∈ (Base‘𝐾)) → (𝐴(+g‘𝐾)𝐵) = (𝐵(+g‘𝐾)𝐴))
18	5, 12, 14, 17	syl3anc 1398	. 2 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴(+g‘𝐾)𝐵) = (𝐵(+g‘𝐾)𝐴))
19		toycom.2	. . 3 ⊢ + = (+g‘𝐾)
20	19	oveqi 7431	. 2 ⊢ (𝐴 + 𝐵) = (𝐴(+g‘𝐾)𝐵)
21	19	oveqi 7431	. 2 ⊢ (𝐵 + 𝐴) = (𝐵(+g‘𝐾)𝐴)
22	18, 20, 21	3eqtr4g 2821	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {crab 3413  ‘cfv 6537  (class class class)co 7418  ℂcc 11191  Basecbs 17380  +_gcplusg 17421  Abelcabl 19988

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-12 2213  ax-ext 2733

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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6493  df-fv 6545  df-ov 7421  df-cmn 19989  df-abl 19990

This theorem is used by: (None)