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

Theorem cntz2ss 19549
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 2760 . . . . . 6 (+g‘𝑀) = (+g‘𝑀)
2 cntzrec.z . . . . . 6 𝑍 = (Cntz‘𝑀)
31, 2cntzi 19543 . . . . 5 ((𝑥 ∈ (𝑍‘𝑆) ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
43ralrimiva 3154 . . . 4 (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
5 ssralv 3977 . . . . 5 (𝑇 ⊆ 𝑆 → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
65adantl 487 . . . 4 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (∀𝑦 ∈ 𝑆 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
74, 6syl5 35 . . 3 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → (𝑥 ∈ (𝑍‘𝑆) → ∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥)))
87ralrimiv 3153 . 2 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → ∀𝑥 ∈ (𝑍‘𝑆)∀𝑦 ∈ 𝑇 (𝑥(+g‘𝑀)𝑦) = (𝑦(+g‘𝑀)𝑥))
9 cntzrec.b . . . 4 𝐵 = (Base‘𝑀)
109, 2cntzssv 19542 . . 3 (𝑍‘𝑆) ⊆ 𝐵
11 sstr 3916 . . . 4 ((𝑇 ⊆ 𝑆 ∧ 𝑆 ⊆ 𝐵) → 𝑇 ⊆ 𝐵)
1211ancoms 464 . . 3 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝐵)
139, 1, 2sscntz 19540 . . 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 1569   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3895  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +gcplusg 17428  Cntzccntz 19529
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  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 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  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 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-cntz 19531
This theorem is used by:  cntzidss  19554  gsumzadd  20136  dprdfadd  20236  dprdss  20245  dprd2da  20258  dmdprdsplit2lem  20261  cntzsdrg  21059
  Copyright terms: Public domain W3C validator