| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iscom2 | Structured version Visualization version GIF version | ||
| Description: Obsolete theorem, used (as lemma) in other obsolete theorems only. A device to add commutativity to various sorts of rings. (Contributed by FL, 6-Sep-2009.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| iscom2 | ⊢ ((𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐵) → (〈𝐺, 𝐻〉 ∈ Com2 ↔ ∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-com2 38892 | . . . 4 ⊢ Com2 = {〈𝑥, 𝑦〉 ∣ ∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)} | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐵) → Com2 = {〈𝑥, 𝑦〉 ∣ ∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)}) |
| 3 | 2 | eleq2d 2847 | . 2 ⊢ ((𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐵) → (〈𝐺, 𝐻〉 ∈ Com2 ↔ 〈𝐺, 𝐻〉 ∈ {〈𝑥, 𝑦〉 ∣ ∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)})) |
| 4 | rneq 5918 | . . . 4 ⊢ (𝑥 = 𝐺 → ran 𝑥 = ran 𝐺) | |
| 5 | 4 | raleqdv 3320 | . . . 4 ⊢ (𝑥 = 𝐺 → (∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎))) |
| 6 | 4, 5 | raleqbidv 3335 | . . 3 ⊢ (𝑥 = 𝐺 → (∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎))) |
| 7 | oveq 7418 | . . . . 5 ⊢ (𝑦 = 𝐻 → (𝑎𝑦𝑏) = (𝑎𝐻𝑏)) | |
| 8 | oveq 7418 | . . . . 5 ⊢ (𝑦 = 𝐻 → (𝑏𝑦𝑎) = (𝑏𝐻𝑎)) | |
| 9 | 7, 8 | eqeq12d 2777 | . . . 4 ⊢ (𝑦 = 𝐻 → ((𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ (𝑎𝐻𝑏) = (𝑏𝐻𝑎))) |
| 10 | 9 | 2ralbidv 3227 | . . 3 ⊢ (𝑦 = 𝐻 → (∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎))) |
| 11 | 6, 10 | opelopabg 5513 | . 2 ⊢ ((𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐵) → (〈𝐺, 𝐻〉 ∈ {〈𝑥, 𝑦〉 ∣ ∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)} ↔ ∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎))) |
| 12 | 3, 11 | bitrd 282 | 1 ⊢ ((𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐵) → (〈𝐺, 𝐻〉 ∈ Com2 ↔ ∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 〈cop 4590 {copab 5167 ran crn 5652 (class class class)co 7412 Com2ccm2 38891 |
| 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-ext 2733 ax-sep 5249 ax-pr 5391 |
| 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-opab 5168 df-cnv 5659 df-dm 5661 df-rn 5662 df-iota 6487 df-fv 6539 df-ov 7415 df-com2 38892 |
| This theorem is used by: iscrngo2 38899 iscringd 38900 |
| Copyright terms: Public domain | W3C validator |