| 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 3290 | . . . 4 ⊢ (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)) | |
| 2 | eqcom 2767 | . . . . 5 ⊢ ((𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) ↔ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)) | |
| 3 | 2 | 2ralbii 3137 | . . . 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 2760 | . . 3 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 8 | cntzrec.z | . . 3 ⊢ 𝑍 = (Cntz‘𝑀) | |
| 9 | 6, 7, 8 | sscntz 19501 | . 2 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑆 ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))) |
| 10 | 6, 7, 8 | sscntz 19501 | . . 3 ⊢ ((𝑇 ⊆ 𝐵 ∧ 𝑆 ⊆ 𝐵) → (𝑇 ⊆ (𝑍‘𝑆) ↔ ∀𝑦 ∈ 𝑇 ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))) |
| 11 | 10 | ancoms 464 | . 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 401 = wceq 1570 ∀wral 3076 ⊆ wss 3898 ‘cfv 6527 (class class class)co 7408 Basecbs 17348 +gcplusg 17389 Cntzccntz 19490 |
| 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-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 |
| 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-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-cntz 19492 |
| This theorem is used by: cntzrecd 19853 lsmcntzr 19855 cntzspan 20019 dprdfadd 20197 |
| Copyright terms: Public domain | W3C validator |