| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brinxp | Structured version Visualization version GIF version | ||
| Description: Intersection of binary relation with Cartesian product. (Contributed by NM, 9-Mar-1997.) |
| Ref | Expression |
|---|---|
| brinxp | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brinxp2 5744 | . 2 ⊢ (𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵 ↔ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ 𝐴𝑅𝐵)) | |
| 2 | 1 | baibr 546 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝐴(𝑅 ∩ (𝐶 × 𝐷))𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2146 ∩ cin 3907 class class class wbr 5114 × cxp 5664 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5672 |
| This theorem is used by: poinxp 5747 soinxp 5748 frinxp 5749 seinxp 5750 exfo 7107 isores2 7342 ltpiord 10890 ordpinq 10946 pwsleval 17572 tsrss 18670 ordtrest 23396 ordtrest2lem 23397 ordtrestNEW 34342 ordtrest2NEWlem 34343 satefvfmla0 35931 |
| Copyright terms: Public domain | W3C validator |