| 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 38682 | . . . 4 ⊢ Com2 = {〈𝑥, 𝑦〉 ∣ ∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)} | |
| 2 | 1 | a1i 11 | . . 3 ⊢ ((𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐵) → Com2 = {〈𝑥, 𝑦〉 ∣ ∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)}) |
| 3 | 2 | eleq2d 2852 | . 2 ⊢ ((𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐵) → (〈𝐺, 𝐻〉 ∈ Com2 ↔ 〈𝐺, 𝐻〉 ∈ {〈𝑥, 𝑦〉 ∣ ∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎)})) |
| 4 | rneq 5931 | . . . 4 ⊢ (𝑥 = 𝐺 → ran 𝑥 = ran 𝐺) | |
| 5 | 4 | raleqdv 3326 | . . . 4 ⊢ (𝑥 = 𝐺 → (∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎))) |
| 6 | 4, 5 | raleqbidv 3341 | . . 3 ⊢ (𝑥 = 𝐺 → (∀𝑎 ∈ ran 𝑥∀𝑏 ∈ ran 𝑥(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎))) |
| 7 | oveq 7429 | . . . . 5 ⊢ (𝑦 = 𝐻 → (𝑎𝑦𝑏) = (𝑎𝐻𝑏)) | |
| 8 | oveq 7429 | . . . . 5 ⊢ (𝑦 = 𝐻 → (𝑏𝑦𝑎) = (𝑏𝐻𝑎)) | |
| 9 | 7, 8 | eqeq12d 2782 | . . . 4 ⊢ (𝑦 = 𝐻 → ((𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ (𝑎𝐻𝑏) = (𝑏𝐻𝑎))) |
| 10 | 9 | 2ralbidv 3232 | . . 3 ⊢ (𝑦 = 𝐻 → (∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝑦𝑏) = (𝑏𝑦𝑎) ↔ ∀𝑎 ∈ ran 𝐺∀𝑏 ∈ ran 𝐺(𝑎𝐻𝑏) = (𝑏𝐻𝑎))) |
| 11 | 6, 10 | opelopabg 5528 | . 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 2146 ∀wral 3082 〈cop 4600 {copab 5178 ran crn 5667 (class class class)co 7423 Com2ccm2 38681 |
| 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 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-cnv 5674 df-dm 5676 df-rn 5677 df-iota 6499 df-fv 6551 df-ov 7426 df-com2 38682 |
| This theorem is used by: iscrngo2 38689 iscringd 38690 |
| Copyright terms: Public domain | W3C validator |