ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sscntz GIF version

Theorem sscntz 14158
Description: A centralizer expression for two sets elementwise commuting. (Contributed by Stefan O'Rear, 5-Sep-2015.)
Hypotheses
Ref Expression
cntzfval.b 𝐵 = (Base‘𝑀)
cntzfval.p + = (+g‘𝑀)
cntzfval.z 𝑍 = (Cntz‘𝑀)
Assertion
Ref Expression
sscntz ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑆 ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
Distinct variable groups:   𝑥,𝑦, +   𝑥,𝐵   𝑥,𝑀,𝑦   𝑥,𝑇,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐵(𝑦)   𝑍(𝑥, 𝑦)

Proof of Theorem sscntz
StepHypRef Expression
1 cntzfval.b . . . . 5 𝐵 = (Base‘𝑀)
2 cntzfval.p . . . . 5 + = (+g‘𝑀)
3 cntzfval.z . . . . 5 𝑍 = (Cntz‘𝑀)
41, 2, 3cntzval 14153 . . . 4 (𝑇 ⊆ 𝐵 → (𝑍‘𝑇) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
54sseq2d 3278 . . 3 (𝑇 ⊆ 𝐵 → (𝑆 ⊆ (𝑍‘𝑇) ↔ 𝑆 ⊆ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)}))
6 ssrab 3326 . . 3 (𝑆 ⊆ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ↔ (𝑆 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
75, 6bitrdi 196 . 2 (𝑇 ⊆ 𝐵 → (𝑆 ⊆ (𝑍‘𝑇) ↔ (𝑆 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥))))
8 ibar 301 . . 3 (𝑆 ⊆ 𝐵 → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ (𝑆 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥))))
98bicomd 141 . 2 (𝑆 ⊆ 𝐵 → ((𝑆 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
107, 9sylan9bbr 467 1 ((𝑆 ⊆ 𝐵 ∧ 𝑇 ⊆ 𝐵) → (𝑆 ⊆ (𝑍‘𝑇) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∀wral 2528  {crab 2532   ⊆ wss 3220  ‘cfv 5380  (class class class)co 6088  Basecbs 13410  +gcplusg 13490  Cntzccntz 14146
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-inn 9314  df-ndx 13413  df-slot 13414  df-base 13416  df-cntz 14148
This theorem is used by:  cntz2ss  14168  cntzrec  14169
  Copyright terms: Public domain W3C validator