![]() |
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 5859 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))) | |
2 | df-br 5142 | . 2 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐶 ∘ 𝐷)) | |
3 | df-br 5142 | . . . 4 ⊢ (𝐴𝐷𝑥 ↔ ⟨𝐴, 𝑥⟩ ∈ 𝐷) | |
4 | df-br 5142 | . . . 4 ⊢ (𝑥𝐶𝐵 ↔ ⟨𝑥, 𝐵⟩ ∈ 𝐶) | |
5 | 3, 4 | anbi12i 626 | . . 3 ⊢ ((𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵) ↔ (⟨𝐴, 𝑥⟩ ∈ 𝐷 ∧ ⟨𝑥, 𝐵⟩ ∈ 𝐶)) |
6 | 5 | exbii 1842 | . 2 ⊢ (∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵) ↔ ∃𝑥(⟨𝐴, 𝑥⟩ ∈ 𝐷 ∧ ⟨𝑥, 𝐵⟩ ∈ 𝐶)) |
7 | 1, 2, 6 | 3bitr3g 313 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ ∈ (𝐶 ∘ 𝐷) ↔ ∃𝑥(⟨𝐴, 𝑥⟩ ∈ 𝐷 ∧ ⟨𝑥, 𝐵⟩ ∈ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∃wex 1773 ∈ wcel 2098 ⟨cop 4629 class class class wbr 5141 ∘ ccom 5673 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pr 5420 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2704 df-cleq 2718 df-clel 2804 df-rab 3427 df-v 3470 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-sn 4624 df-pr 4626 df-op 4630 df-br 5142 df-opab 5204 df-co 5678 |
This theorem is referenced by: dfco2 6237 dmfco 6980 dfatdmfcoafv2 46516 |
Copyright terms: Public domain | W3C validator |