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

Theorem cntz2ss 19602
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 2766 . . . . . 6 (+g‘𝑀) = (+g‘𝑀)
2 cntzrec.z . . . . . 6 𝑍 = (Cntz‘𝑀)
31, 2cntzi 19596 . . . . 5 ((𝑥 ∈ (𝑍‘𝑆) ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
43ralrimiva 3161 . . . 4 (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
5 ssralv 3981 . . . . 5 (𝑇 ⊆ 𝑆 → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
65adantl 487 . . . 4 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
74, 6syl5 35 . . 3 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
87ralrimiv 3160 . 2 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
9 cntzrec.b . . . 4 𝐵 = (Base‘𝑀)
109, 2cntzssv 19595 . . 3 (𝑍‘𝑆) ⊆ 𝐵
11 sstr 3920 . . . 4 ((𝑇 ⊆ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑇 ⊆ 𝐵)
1211ancoms 464 . . 3 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝐵)
139, 1, 2sscntz 19593 . . 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 1572   ∈ wcel 2150  ∀wral 3083   ⊆ wss 3899  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  +gcplusg 17474  Cntzccntz 19582
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-cntz 19584
This theorem is used by:  cntzidss  19607  gsumzadd  20189  dprdfadd  20289  dprdss  20298  dprd2da  20311  dmdprdsplit2lem  20314  cntzsdrg  21112
  Copyright terms: Public domain W3C validator