| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elxp3 | Structured version Visualization version GIF version | ||
| Description: Membership in a Cartesian product. (Contributed by NM, 5-Mar-1995.) |
| Ref | Expression |
|---|---|
| elxp3 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxp 5641 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) | |
| 2 | eqcom 2746 | . . . 4 ⊢ (〈𝑥, 𝑦〉 = 𝐴 ↔ 𝐴 = 〈𝑥, 𝑦〉) | |
| 3 | opelxp 5654 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) | |
| 4 | 2, 3 | anbi12i 634 | . . 3 ⊢ ((〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶)) ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) |
| 5 | 4 | 2exbii 1856 | . 2 ⊢ (∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶)) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) |
| 6 | 1, 5 | bitr4i 279 | 1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 ∧ wa 396 = wceq 1547 ∃wex 1786 ∈ wcel 2119 〈cop 4561 × cxp 5616 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-opab 5135 df-xp 5624 |
| This theorem is referenced by: optoclOLD 5713 unixp0 6234 |
| Copyright terms: Public domain | W3C validator |