| 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 5992 | . 2 ⊢ (𝐶 ∈ V → (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∈ wcel 2150 Vcvv 3453 class class class wbr 5107 ↾ cres 5659 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-xp 5663 df-res 5669 |
| This theorem is used by: dfres2 6050 poirr2 6135 cores 6268 resco 6269 rnco 6271 rncoOLD 6272 dfpo2 6324 fnres 6695 fvres 6934 nfunsn 6954 eqfunresadj 7400 1stconst 8147 2ndconst 8148 fsplit 8164 fprlem1 8355 ttrclresv 9754 ttrclselem2 9763 frrlem15 9797 setrec2lem2 10012 dprd2da 20311 metustid 24930 dvres 26288 dvres2 26289 ltgov 29119 hlimadd 31854 hhcmpl 31861 hhcms 31864 hlim0 31896 dfdm5 36753 dfrn5 36754 txpss3v 36856 brtxp 36858 pprodss4v 36862 brpprod 36863 brimg 36915 brapply 36916 funpartfun 36923 dfrdg4 36931 coresrn 38206 xrnss3v 39581 funressnfv 48446 funressnvmo 48448 afv2res 48642 tposres0 50411 |
| Copyright terms: Public domain | W3C validator |