| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cntz2ss | Structured version Visualization version GIF version | ||
| Description: Centralizers reverse the subset relation. (Contributed by Mario Carneiro, 3-Oct-2015.) |
| Ref | Expression |
|---|---|
| cntzrec.b | ⊢ 𝐵 = (Base‘𝑀) |
| cntzrec.z | ⊢ 𝑍 = (Cntz‘𝑀) |
| Ref | Expression |
|---|---|
| cntz2ss | ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑍‘𝑆) ⊆ (𝑍‘𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . . . 6 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 2 | cntzrec.z | . . . . . 6 ⊢ 𝑍 = (Cntz‘𝑀) | |
| 3 | 1, 2 | cntzi 19403 | . . . . 5 ⊢ ((𝑥 ∈ (𝑍‘𝑆) ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)) |
| 4 | 3 | ralrimiva 3157 | . . . 4 ⊢ (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)) |
| 5 | ssralv 4006 | . . . . 5 ⊢ (𝑇 ⊆ 𝑆 → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))) | |
| 6 | 5 | adantl 486 | . . . 4 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))) |
| 7 | 4, 6 | syl5 35 | . . 3 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))) |
| 8 | 7 | ralrimiv 3156 | . 2 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)) |
| 9 | cntzrec.b | . . . 4 ⊢ 𝐵 = (Base‘𝑀) | |
| 10 | 9, 2 | cntzssv 19402 | . . 3 ⊢ (𝑍‘𝑆) ⊆ 𝐵 |
| 11 | sstr 3945 | . . . 4 ⊢ ((𝑇 ⊆ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑇 ⊆ 𝐵) | |
| 12 | 11 | ancoms 463 | . . 3 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝐵) |
| 13 | 9, 1, 2 | sscntz 19400 | . . 3 ⊢ (((𝑍‘𝑆) ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → ((𝑍‘𝑆) ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))) |
| 14 | 10, 12, 13 | sylancr 598 | . 2 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → ((𝑍‘𝑆) ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))) |
| 15 | 8, 14 | mpbird 260 | 1 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑍‘𝑆) ⊆ (𝑍‘𝑇)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ⊆ wss 3905 ‘cfv 6536 (class class class)co 7410 Basecbs 17273 +gcplusg 17314 Cntzccntz 19389 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 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 7413 df-cntz 19391 |
| This theorem is used by: cntzidss 19414 gsumzadd 19996 dprdfadd 20096 dprdss 20105 dprd2da 20118 dmdprdsplit2lem 20121 cntzsdrg 20914 |
| Copyright terms: Public domain | W3C validator |