| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elxp3 | GIF version | ||
| Description: Membership in a cross product. (Contributed by NM, 5-Mar-1995.) |
| Ref | Expression |
|---|---|
| elxp3 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxp 4789 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) | |
| 2 | eqcom 2240 | . . . 4 ⊢ (〈𝑥, 𝑦〉 = 𝐴 ↔ 𝐴 = 〈𝑥, 𝑦〉) | |
| 3 | opelxp 4802 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) | |
| 4 | 2, 3 | anbi12i 464 | . . 3 ⊢ ((〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶)) ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) |
| 5 | 4 | 2exbii 1659 | . 2 ⊢ (∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶)) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) |
| 6 | 1, 5 | bitr4i 187 | 1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1402 ∃wex 1545 ∈ wcel 2209 〈cop 3711 × cxp 4770 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-opab 4191 df-xp 4778 |
| This theorem is referenced by: optocl 4849 |
| Copyright terms: Public domain | W3C validator |