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 5764 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) | |
2 | df-br 5071 | . 2 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (𝐶 ∘ 𝐷)) | |
3 | df-br 5071 | . . . 4 ⊢ (𝐴𝐷𝑥 ↔ 〈𝐴, 𝑥〉 ∈ 𝐷) | |
4 | df-br 5071 | . . . 4 ⊢ (𝑥𝐶𝐵 ↔ 〈𝑥, 𝐵〉 ∈ 𝐶) | |
5 | 3, 4 | anbi12i 626 | . . 3 ⊢ ((𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵) ↔ (〈𝐴, 𝑥〉 ∈ 𝐷 ∧ 〈𝑥, 𝐵〉 ∈ 𝐶)) |
6 | 5 | exbii 1851 | . 2 ⊢ (∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵) ↔ ∃𝑥(〈𝐴, 𝑥〉 ∈ 𝐷 ∧ 〈𝑥, 𝐵〉 ∈ 𝐶)) |
7 | 1, 2, 6 | 3bitr3g 312 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (〈𝐴, 𝐵〉 ∈ (𝐶 ∘ 𝐷) ↔ ∃𝑥(〈𝐴, 𝑥〉 ∈ 𝐷 ∧ 〈𝑥, 𝐵〉 ∈ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∃wex 1783 ∈ wcel 2108 〈cop 4564 class class class wbr 5070 ∘ ccom 5584 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-co 5589 |
This theorem is referenced by: dfco2 6138 dmfco 6846 dfatdmfcoafv2 44633 |
Copyright terms: Public domain | W3C validator |