| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brssrres | Structured version Visualization version GIF version | ||
| Description: Restricted subset binary relation. (Contributed by Peter Mazsa, 25-Nov-2019.) |
| Ref | Expression |
|---|---|
| brssrres | ⊢ (𝐶 ∈ 𝑉 → (𝐵( S ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 ⊆ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brres 5972 | . 2 ⊢ (𝐶 ∈ 𝑉 → (𝐵( S ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 S 𝐶))) | |
| 2 | brssr 39085 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (𝐵 S 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
| 3 | 2 | anbi2d 639 | . 2 ⊢ (𝐶 ∈ 𝑉 → ((𝐵 ∈ 𝐴 ∧ 𝐵 S 𝐶) ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 ⊆ 𝐶))) |
| 4 | 1, 3 | bitrd 281 | 1 ⊢ (𝐶 ∈ 𝑉 → (𝐵( S ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 ⊆ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∈ wcel 2143 ⊆ wss 3905 class class class wbr 5101 ↾ cres 5650 S cssr 38690 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5247 ax-pr 5391 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5102 df-opab 5164 df-xp 5654 df-rel 5655 df-res 5660 df-ssr 39082 |
| This theorem is referenced by: br1cnvssrres 39089 |
| Copyright terms: Public domain | W3C validator |