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

Theorem sbss 4479
Description: Set substitution into the first argument of a subset relation. (Contributed by Rodolfo Medina, 7-Jul-2010.) (Proof shortened by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
sbss ([𝑦 / 𝑥]𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem sbss
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 sseq1 3938 . 2 (𝑥 = 𝑧 → (𝑥 ⊆ 𝐴 ↔ 𝑧 ⊆ 𝐴))
2 sseq1 3938 . 2 (𝑧 = 𝑦 → (𝑧 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴))
31, 2sbievw2 2137 1 ([𝑦 / 𝑥]𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  [wsb 2101   ⊆ wss 3900
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-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2102  df-cleq 2755  df-ss 3901
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator