| 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 5729 | . 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 2145 ∩ cin 3898 class class class wbr 5103 × cxp 5649 |
| 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 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| 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 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5657 |
| This theorem is used by: poinxp 5732 soinxp 5733 frinxp 5734 seinxp 5735 exfo 7097 isores2 7333 ltpiord 10953 ordpinq 11009 pwsleval 17645 tsrss 18743 ordtrest 23500 ordtrest2lem 23501 ordtrestNEW 34535 ordtrest2NEWlem 34536 satefvfmla0 36152 |
| Copyright terms: Public domain | W3C validator |