Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sbcbr1g | GIF version |
Description: Move substitution in and out of a binary relation. (Contributed by NM, 13-Dec-2005.) |
Ref | Expression |
---|---|
sbcbr1g | ⊢ (𝐴 ∈ 𝐷 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcbr12g 3978 | . 2 ⊢ (𝐴 ∈ 𝐷 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅⦋𝐴 / 𝑥⦌𝐶)) | |
2 | csbconstg 3011 | . . 3 ⊢ (𝐴 ∈ 𝐷 → ⦋𝐴 / 𝑥⦌𝐶 = 𝐶) | |
3 | 2 | breq2d 3936 | . 2 ⊢ (𝐴 ∈ 𝐷 → (⦋𝐴 / 𝑥⦌𝐵𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅𝐶)) |
4 | 1, 3 | bitrd 187 | 1 ⊢ (𝐴 ∈ 𝐷 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∈ wcel 1480 [wsbc 2904 ⦋csb 2998 class class class wbr 3924 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-v 2683 df-sbc 2905 df-csb 2999 df-un 3070 df-sn 3528 df-pr 3529 df-op 3531 df-br 3925 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |