![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > brcog | Structured version Visualization version GIF version |
Description: Ordered pair membership in a composition. (Contributed by NM, 24-Feb-2015.) |
Ref | Expression |
---|---|
brcog | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1 5033 | . . . 4 ⊢ (𝑦 = 𝐴 → (𝑦𝐷𝑥 ↔ 𝐴𝐷𝑥)) | |
2 | breq2 5034 | . . . 4 ⊢ (𝑧 = 𝐵 → (𝑥𝐶𝑧 ↔ 𝑥𝐶𝐵)) | |
3 | 1, 2 | bi2anan9 638 | . . 3 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = 𝐵) → ((𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧) ↔ (𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) |
4 | 3 | exbidv 1922 | . 2 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = 𝐵) → (∃𝑥(𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧) ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) |
5 | df-co 5528 | . 2 ⊢ (𝐶 ∘ 𝐷) = {〈𝑦, 𝑧〉 ∣ ∃𝑥(𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧)} | |
6 | 4, 5 | brabga 5386 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 class class class wbr 5030 ∘ ccom 5523 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-co 5528 |
This theorem is referenced by: opelco2g 5702 brcogw 5703 brco 5705 brcodir 5946 brtpos2 7881 ertr 8287 relexpindlem 14414 znleval 20246 fcoinvbr 30371 opelco3 33131 brxrn 35786 eqvreltr 36002 frege124d 40462 funressnfv 43635 dfatcolem 43811 |
Copyright terms: Public domain | W3C validator |