| 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 5815 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) | |
| 4 | 1, 2, 3 | mp2an 692 | 1 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∃wex 1780 ∈ wcel 2113 Vcvv 3440 class class class wbr 5098 ∘ ccom 5628 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-co 5633 |
| This theorem is referenced by: opelco 5820 cnvco 5834 cotrg 6068 resco 6208 imaco 6209 rnco 6210 rncoOLD 6211 coass 6224 dfpo2 6254 dffv2 6929 foeqcnvco 7246 f1eqcocnv 7247 ttrclss 9629 rtrclreclem3 14983 imasleval 17462 ustuqtop4 24188 metustexhalf 24500 dftr6 35945 coep 35946 coepr 35947 brtxp 36072 pprodss4v 36076 brpprod 36077 sscoid 36105 elfuns 36107 brimg 36129 brapply 36130 brcup 36131 brcap 36132 brsuccf 36134 funpartlem 36136 brrestrict 36143 dfrecs2 36144 dfrdg4 36145 cnvssco 43857 brpermmodel 45254 xpco2 49112 |
| Copyright terms: Public domain | W3C validator |