| 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 5830 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) | |
| 4 | 1, 2, 3 | mp2an 692 | 1 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∃wex 1779 ∈ wcel 2109 Vcvv 3447 class class class wbr 5107 ∘ ccom 5642 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-opab 5170 df-co 5647 |
| This theorem is referenced by: opelco 5835 cnvco 5849 cotrg 6080 cotrgOLD 6081 resco 6223 imaco 6224 rnco 6225 coass 6238 dfpo2 6269 dffv2 6956 foeqcnvco 7275 f1eqcocnv 7276 ttrclss 9673 rtrclreclem3 15026 imasleval 17504 ustuqtop4 24132 metustexhalf 24444 dftr6 35738 coep 35739 coepr 35740 brtxp 35868 pprodss4v 35872 brpprod 35873 sscoid 35901 elfuns 35903 brimg 35925 brapply 35926 brcup 35927 brcap 35928 brsuccf 35929 funpartlem 35930 brrestrict 35937 dfrecs2 35938 dfrdg4 35939 cnvssco 43595 brpermmodel 44993 xpco2 48842 |
| Copyright terms: Public domain | W3C validator |