![]() |
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 5151 | . . . 4 ⊢ (𝑦 = 𝐴 → (𝑦𝐷𝑥 ↔ 𝐴𝐷𝑥)) | |
2 | breq2 5152 | . . . 4 ⊢ (𝑧 = 𝐵 → (𝑥𝐶𝑧 ↔ 𝑥𝐶𝐵)) | |
3 | 1, 2 | bi2anan9 637 | . . 3 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = 𝐵) → ((𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧) ↔ (𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) |
4 | 3 | exbidv 1924 | . 2 ⊢ ((𝑦 = 𝐴 ∧ 𝑧 = 𝐵) → (∃𝑥(𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧) ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) |
5 | df-co 5685 | . 2 ⊢ (𝐶 ∘ 𝐷) = {⟨𝑦, 𝑧⟩ ∣ ∃𝑥(𝑦𝐷𝑥 ∧ 𝑥𝐶𝑧)} | |
6 | 4, 5 | brabga 5534 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∃wex 1781 ∈ wcel 2106 class class class wbr 5148 ∘ ccom 5680 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-rab 3433 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-opab 5211 df-co 5685 |
This theorem is referenced by: opelco2g 5867 brcogw 5868 brco 5870 brcodir 6120 predtrss 6323 brtpos2 8216 ertr 8717 relexpindlem 15009 znleval 21109 fcoinvbr 31831 opelco3 34741 brxrn 37239 eqvreltr 37472 frege124d 42502 funressnfv 45743 dfatcolem 45953 |
Copyright terms: Public domain | W3C validator |