| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cntzrec | Structured version Visualization version GIF version | ||
| Description: Reciprocity relationship for centralizers. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
| Ref | Expression |
|---|---|
| cntzrec.b | ⊢ 𝐵 = (Base‘𝑀) |
| cntzrec.z | ⊢ 𝑍 = (Cntz‘𝑀) |
| Ref | Expression |
|---|---|
| cntzrec | ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑆 ⊆ (𝑍‘𝑇) ↔ 𝑇 ⊆ (𝑍‘𝑆))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ralcom 3292 | . . . 4 ⊢ (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)) | |
| 2 | eqcom 2769 | . . . . 5 ⊢ ((𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) ↔ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)) | |
| 3 | 2 | 2ralbii 3139 | . . . 4 ⊢ (∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)) |
| 4 | 1, 3 | bitri 278 | . . 3 ⊢ (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))) |
| 6 | cntzrec.b | . . 3 ⊢ 𝐵 = (Base‘𝑀) | |
| 7 | eqid 2762 | . . 3 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 8 | cntzrec.z | . . 3 ⊢ 𝑍 = (Cntz‘𝑀) | |
| 9 | 6, 7, 8 | sscntz 19402 | . 2 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑆 ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))) |
| 10 | 6, 7, 8 | sscntz 19402 | . . 3 ⊢ ((𝑇 ⊆ 𝐵 ∧ 𝑆 ⊆ 𝐵) → (𝑇 ⊆ (𝑍‘𝑆) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))) |
| 11 | 10 | ancoms 463 | . 2 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑇 ⊆ (𝑍‘𝑆) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))) |
| 12 | 5, 9, 11 | 3bitr4d 314 | 1 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑆 ⊆ (𝑍‘𝑇) ↔ 𝑇 ⊆ (𝑍‘𝑆))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∀wral 3078 ⊆ wss 3904 ‘cfv 6536 (class class class)co 7412 Basecbs 17275 +gcplusg 17316 Cntzccntz 19391 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7415 df-cntz 19393 |
| This theorem is used by: cntzrecd 19754 lsmcntzr 19756 cntzspan 19920 dprdfadd 20098 |
| Copyright terms: Public domain | W3C validator |