| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbss | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| sbss | ⊢ ([𝑦 / 𝑥]𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq1 4009 | . 2 ⊢ (𝑥 = 𝑧 → (𝑥 ⊆ 𝐴 ↔ 𝑧 ⊆ 𝐴)) | |
| 2 | sseq1 4009 | . 2 ⊢ (𝑧 = 𝑦 → (𝑧 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴)) | |
| 3 | 1, 2 | sbievw2 2098 | 1 ⊢ ([𝑦 / 𝑥]𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 [wsb 2064 ⊆ wss 3951 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-9 2118 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-sb 2065 df-cleq 2729 df-ss 3968 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |