| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brco | Structured version Visualization version GIF version | ||
| Description: Binary relation on a composition. (Contributed by NM, 21-Sep-2004.) (Revised by Mario Carneiro, 24-Feb-2015.) |
| Ref | Expression |
|---|---|
| opelco.1 | ⊢ 𝐴 ∈ V |
| opelco.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| brco | ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opelco.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | opelco.2 | . 2 ⊢ 𝐵 ∈ V | |
| 3 | brcog 5838 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) | |
| 4 | 1, 2, 3 | mp2an 702 | 1 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 ∃wex 1799 ∈ wcel 2142 Vcvv 3454 class class class wbr 5100 ∘ ccom 5651 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-co 5656 |
| This theorem is referenced by: opelco 5843 cnvco 5861 cotrg 6098 resco 6237 imaco 6238 rnco 6239 rncoOLD 6240 coass 6253 dfpo2 6283 dffv2 6962 foeqcnvco 7284 f1eqcocnv 7285 ttrclss 9675 rtrclreclem3 15073 imasleval 17571 ustuqtop4 24304 metustexhalf 24616 dftr6 36101 coep 36102 coepr 36103 brtxp 36228 pprodss4v 36232 brpprod 36233 sscoid 36261 elfuns 36263 brimg 36285 brapply 36286 brcup 36287 brcap 36288 brsuccf 36290 funpartlem 36292 brrestrict 36299 dfrecs2 36300 dfrdg4 36301 cnvssco 44182 brpermmodel 45579 xpco2 49478 |
| Copyright terms: Public domain | W3C validator |