Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > brresi | Structured version Visualization version GIF version |
Description: Binary relation on a restriction. (Contributed by NM, 12-Dec-2006.) |
Ref | Expression |
---|---|
opelresi.1 | ⊢ 𝐶 ∈ V |
Ref | Expression |
---|---|
brresi | ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelresi.1 | . 2 ⊢ 𝐶 ∈ V | |
2 | brres 5862 | . 2 ⊢ (𝐶 ∈ V → (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶))) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ∈ wcel 2114 Vcvv 3496 class class class wbr 5068 ↾ cres 5559 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-opab 5131 df-xp 5563 df-res 5569 |
This theorem is referenced by: dfres2 5911 poirr2 5986 cores 6104 resco 6105 rnco 6107 fnres 6476 fvres 6691 nfunsn 6709 1stconst 7797 2ndconst 7798 fsplit 7814 fsplitOLD 7815 wfrlem5 7961 dprd2da 19166 metustid 23166 dvres 24511 dvres2 24512 ltgov 26385 hlimadd 28972 hhcmpl 28979 hhcms 28982 hlim0 29014 dfpo2 32993 eqfunresadj 33006 dfdm5 33018 dfrn5 33019 fprlem1 33139 frrlem15 33144 txpss3v 33341 brtxp 33343 pprodss4v 33347 brpprod 33348 brimg 33400 brapply 33401 funpartfun 33406 dfrdg4 33414 xrnss3v 35626 funressnfv 43285 funressnvmo 43287 afv2res 43445 setrec2lem2 44804 |
Copyright terms: Public domain | W3C validator |