Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > toycom | Structured version Visualization version GIF version |
Description: Show the commutative law for an operation 𝑂 on a toy structure class 𝐶 of commuatitive 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.) |
Ref | Expression |
---|---|
toycom.1 | ⊢ 𝐶 = {𝑔 ∈ Abel ∣ (Base‘𝑔) = ℂ} |
toycom.2 | ⊢ + = (+g‘𝐾) |
Ref | Expression |
---|---|
toycom | ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | toycom.1 | . . . . . 6 ⊢ 𝐶 = {𝑔 ∈ Abel ∣ (Base‘𝑔) = ℂ} | |
2 | ssrab2 3979 | . . . . . 6 ⊢ {𝑔 ∈ Abel ∣ (Base‘𝑔) = ℂ} ⊆ Abel | |
3 | 1, 2 | eqsstri 3921 | . . . . 5 ⊢ 𝐶 ⊆ Abel |
4 | 3 | sseli 3883 | . . . 4 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ Abel) |
5 | 4 | 3ad2ant1 1135 | . . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐾 ∈ Abel) |
6 | simp2 1139 | . . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
7 | fveq2 6695 | . . . . . . . 8 ⊢ (𝑔 = 𝐾 → (Base‘𝑔) = (Base‘𝐾)) | |
8 | 7 | eqeq1d 2738 | . . . . . . 7 ⊢ (𝑔 = 𝐾 → ((Base‘𝑔) = ℂ ↔ (Base‘𝐾) = ℂ)) |
9 | 8, 1 | elrab2 3594 | . . . . . 6 ⊢ (𝐾 ∈ 𝐶 ↔ (𝐾 ∈ Abel ∧ (Base‘𝐾) = ℂ)) |
10 | 9 | simprbi 500 | . . . . 5 ⊢ (𝐾 ∈ 𝐶 → (Base‘𝐾) = ℂ) |
11 | 10 | 3ad2ant1 1135 | . . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (Base‘𝐾) = ℂ) |
12 | 6, 11 | eleqtrrd 2834 | . . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ (Base‘𝐾)) |
13 | simp3 1140 | . . . 4 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
14 | 13, 11 | eleqtrrd 2834 | . . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ (Base‘𝐾)) |
15 | eqid 2736 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
16 | eqid 2736 | . . . 4 ⊢ (+g‘𝐾) = (+g‘𝐾) | |
17 | 15, 16 | ablcom 19142 | . . 3 ⊢ ((𝐾 ∈ Abel ∧ 𝐴 ∈ (Base‘𝐾) ∧ 𝐵 ∈ (Base‘𝐾)) → (𝐴(+g‘𝐾)𝐵) = (𝐵(+g‘𝐾)𝐴)) |
18 | 5, 12, 14, 17 | syl3anc 1373 | . 2 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴(+g‘𝐾)𝐵) = (𝐵(+g‘𝐾)𝐴)) |
19 | toycom.2 | . . 3 ⊢ + = (+g‘𝐾) | |
20 | 19 | oveqi 7204 | . 2 ⊢ (𝐴 + 𝐵) = (𝐴(+g‘𝐾)𝐵) |
21 | 19 | oveqi 7204 | . 2 ⊢ (𝐵 + 𝐴) = (𝐵(+g‘𝐾)𝐴) |
22 | 18, 20, 21 | 3eqtr4g 2796 | 1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1089 = wceq 1543 ∈ wcel 2112 {crab 3055 ‘cfv 6358 (class class class)co 7191 ℂcc 10692 Basecbs 16666 +gcplusg 16749 Abelcabl 19125 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-12 2177 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-ral 3056 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-iota 6316 df-fv 6366 df-ov 7194 df-cmn 19126 df-abl 19127 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |