![]() |
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 5640 | . 2 ⊢ (𝐶 ∈ 𝑉 → (𝐵( S ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 S 𝐶))) | |
2 | brssr 34794 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (𝐵 S 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
3 | 2 | anbi2d 622 | . 2 ⊢ (𝐶 ∈ 𝑉 → ((𝐵 ∈ 𝐴 ∧ 𝐵 S 𝐶) ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 ⊆ 𝐶))) |
4 | 1, 3 | bitrd 271 | 1 ⊢ (𝐶 ∈ 𝑉 → (𝐵( S ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 ⊆ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 ∈ wcel 2164 ⊆ wss 3798 class class class wbr 4875 ↾ cres 5348 S cssr 34522 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-sep 5007 ax-nul 5015 ax-pr 5129 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ral 3122 df-rex 3123 df-rab 3126 df-v 3416 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-nul 4147 df-if 4309 df-sn 4400 df-pr 4402 df-op 4406 df-br 4876 df-opab 4938 df-xp 5352 df-rel 5353 df-res 5358 df-ssr 34791 |
This theorem is referenced by: br1cnvssrres 34798 |
Copyright terms: Public domain | W3C validator |