| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opelco2g | Structured version Visualization version GIF version | ||
| Description: Ordered pair membership in a composition. (Contributed by NM, 27-Jan-1997.) (Revised by Mario Carneiro, 24-Feb-2015.) |
| Ref | Expression |
|---|---|
| opelco2g | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (〈𝐴, 𝐵〉 ∈ (𝐶 ∘ 𝐷) ↔ ∃𝑥(〈𝐴, 𝑥〉 ∈ 𝐷 ∧ 〈𝑥, 𝐵〉 ∈ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brcog 5811 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) | |
| 2 | df-br 5076 | . 2 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (𝐶 ∘ 𝐷)) | |
| 3 | df-br 5076 | . . . 4 ⊢ (𝐴𝐷𝑥 ↔ 〈𝐴, 𝑥〉 ∈ 𝐷) | |
| 4 | df-br 5076 | . . . 4 ⊢ (𝑥𝐶𝐵 ↔ 〈𝑥, 𝐵〉 ∈ 𝐶) | |
| 5 | 3, 4 | anbi12i 635 | . . 3 ⊢ ((𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵) ↔ (〈𝐴, 𝑥〉 ∈ 𝐷 ∧ 〈𝑥, 𝐵〉 ∈ 𝐶)) |
| 6 | 5 | exbii 1856 | . 2 ⊢ (∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵) ↔ ∃𝑥(〈𝐴, 𝑥〉 ∈ 𝐷 ∧ 〈𝑥, 𝐵〉 ∈ 𝐶)) |
| 7 | 1, 2, 6 | 3bitr3g 315 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (〈𝐴, 𝐵〉 ∈ (𝐶 ∘ 𝐷) ↔ ∃𝑥(〈𝐴, 𝑥〉 ∈ 𝐷 ∧ 〈𝑥, 𝐵〉 ∈ 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∃wex 1787 ∈ wcel 2121 〈cop 4564 class class class wbr 5075 ∘ ccom 5625 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5221 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-br 5076 df-opab 5138 df-co 5630 |
| This theorem is referenced by: dfco2 6200 dmfco 6927 dfatdmfcoafv2 47731 |
| Copyright terms: Public domain | W3C validator |