| 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 4470 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑅 ⊆ (V × V) ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ ⦋𝐴 / 𝑥⦌(V × V))) | |
| 2 | csbconstg 3869 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(V × V) = (V × V)) | |
| 3 | 2 | sseq2d 3967 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑅 ⊆ ⦋𝐴 / 𝑥⦌(V × V) ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ (V × V))) |
| 4 | 1, 3 | bitrd 279 | . 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑅 ⊆ (V × V) ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ (V × V))) |
| 5 | df-rel 5623 | . . 3 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
| 6 | 5 | sbcbii 3798 | . 2 ⊢ ([𝐴 / 𝑥]Rel 𝑅 ↔ [𝐴 / 𝑥]𝑅 ⊆ (V × V)) |
| 7 | df-rel 5623 | . 2 ⊢ (Rel ⦋𝐴 / 𝑥⦌𝑅 ↔ ⦋𝐴 / 𝑥⦌𝑅 ⊆ (V × V)) | |
| 8 | 4, 6, 7 | 3bitr4g 314 | 1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Rel 𝑅 ↔ Rel ⦋𝐴 / 𝑥⦌𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2111 Vcvv 3436 [wsbc 3741 ⦋csb 3850 ⊆ wss 3902 × cxp 5614 Rel wrel 5621 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-ss 3919 df-nul 4284 df-rel 5623 |
| This theorem is referenced by: sbcfung 6505 |
| Copyright terms: Public domain | W3C validator |