| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbcrel | Structured version Visualization version GIF version | ||
| Description: Distribute proper substitution through a relation predicate. (Contributed by Alexander van der Vekens, 23-Jul-2017.) |
| Ref | Expression |
|---|---|
| sbcrel | ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Rel 𝑅 ↔ Rel ⦋𝐴 / 𝑥⦌𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbcssg 4483 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑅 ⊆ (V × V) ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ ⦋𝐴 / 𝑥⦌(V × V))) | |
| 2 | csbconstg 3873 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(V × V) = (V × V)) | |
| 3 | 2 | sseq2d 3970 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑅 ⊆ ⦋𝐴 / 𝑥⦌(V × V) ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ (V × V))) |
| 4 | 1, 3 | bitrd 282 | . 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑅 ⊆ (V × V) ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ (V × V))) |
| 5 | df-rel 5670 | . . 3 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
| 6 | 5 | sbcbii 3801 | . 2 ⊢ ([𝐴 / 𝑥]Rel 𝑅 ↔ [𝐴 / 𝑥]𝑅 ⊆ (V × V)) |
| 7 | df-rel 5670 | . 2 ⊢ (Rel ⦋𝐴 / 𝑥⦌𝑅 ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ (V × V)) | |
| 8 | 4, 6, 7 | 3bitr4g 317 | 1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Rel 𝑅 ↔ Rel ⦋𝐴 / 𝑥⦌𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∈ wcel 2143 Vcvv 3455 [wsbc 3745 ⦋csb 3854 ⊆ wss 3906 × cxp 5661 Rel wrel 5668 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-ss 3923 df-nul 4288 df-rel 5670 |
| This theorem is referenced by: sbcfung 6562 |
| Copyright terms: Public domain | W3C validator |