MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cntz2ss Structured version   Visualization version   GIF version

Theorem cntz2ss 19576
Description: Centralizers reverse the subset relation. (Contributed by Mario Carneiro, 3-Oct-2015.)
Hypotheses
Ref Expression
cntzrec.b 𝐵 = (Base‘𝑀)
cntzrec.z 𝑍 = (Cntz‘𝑀)
Assertion
Ref Expression
cntz2ss ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑍‘𝑆) ⊆ (𝑍‘𝑇))

Proof of Theorem cntz2ss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . . . 6 (+g‘𝑀) = (+g‘𝑀)
2 cntzrec.z . . . . . 6 𝑍 = (Cntz‘𝑀)
31, 2cntzi 19570 . . . . 5 ((𝑥 ∈ (𝑍‘𝑆) ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
43ralrimiva 3158 . . . 4 (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
5 ssralv 3982 . . . . 5 (𝑇 ⊆ 𝑆 → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
65adantl 487 . . . 4 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
74, 6syl5 35 . . 3 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
87ralrimiv 3157 . 2 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
9 cntzrec.b . . . 4 𝐵 = (Base‘𝑀)
109, 2cntzssv 19569 . . 3 (𝑍‘𝑆) ⊆ 𝐵
11 sstr 3921 . . . 4 ((𝑇 ⊆ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑇 ⊆ 𝐵)
1211ancoms 464 . . 3 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝐵)
139, 1, 2sscntz 19567 . . 3 (((𝑍‘𝑆) ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → ((𝑍‘𝑆) ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
1410, 12, 13sylancr 599 . 2 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → ((𝑍‘𝑆) ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
158, 14mpbird 260 1 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑍‘𝑆) ⊆ (𝑍‘𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  +gcplusg 17454  Cntzccntz 19556
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-cntz 19558
This theorem is used by:  cntzidss  19581  gsumzadd  20163  dprdfadd  20263  dprdss  20272  dprd2da  20285  dmdprdsplit2lem  20288  cntzsdrg  21086
  Copyright terms: Public domain W3C validator