![]() |
Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > altopelaltxp | Structured version Visualization version GIF version |
Description: Alternate ordered pair membership in a Cartesian product. Note that, unlike opelxp 5724, there is no sethood requirement here. (Contributed by Scott Fenton, 22-Mar-2012.) |
Ref | Expression |
---|---|
altopelaltxp | ⊢ (⟪𝑋, 𝑌⟫ ∈ (𝐴 ×× 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elaltxp 35956 | . 2 ⊢ (⟪𝑋, 𝑌⟫ ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ⟪𝑋, 𝑌⟫ = ⟪𝑥, 𝑦⟫) | |
2 | reeanv 3226 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 = 𝑋 ∧ 𝑦 = 𝑌) ↔ (∃𝑥 ∈ 𝐴 𝑥 = 𝑋 ∧ ∃𝑦 ∈ 𝐵 𝑦 = 𝑌)) | |
3 | eqcom 2741 | . . . . 5 ⊢ (⟪𝑋, 𝑌⟫ = ⟪𝑥, 𝑦⟫ ↔ ⟪𝑥, 𝑦⟫ = ⟪𝑋, 𝑌⟫) | |
4 | vex 3481 | . . . . . 6 ⊢ 𝑥 ∈ V | |
5 | vex 3481 | . . . . . 6 ⊢ 𝑦 ∈ V | |
6 | 4, 5 | altopth 35950 | . . . . 5 ⊢ (⟪𝑥, 𝑦⟫ = ⟪𝑋, 𝑌⟫ ↔ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) |
7 | 3, 6 | bitri 275 | . . . 4 ⊢ (⟪𝑋, 𝑌⟫ = ⟪𝑥, 𝑦⟫ ↔ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) |
8 | 7 | 2rexbii 3126 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ⟪𝑋, 𝑌⟫ = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) |
9 | risset 3230 | . . . 4 ⊢ (𝑋 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝑋) | |
10 | risset 3230 | . . . 4 ⊢ (𝑌 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐵 𝑦 = 𝑌) | |
11 | 9, 10 | anbi12i 628 | . . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ↔ (∃𝑥 ∈ 𝐴 𝑥 = 𝑋 ∧ ∃𝑦 ∈ 𝐵 𝑦 = 𝑌)) |
12 | 2, 8, 11 | 3bitr4i 303 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ⟪𝑋, 𝑌⟫ = ⟪𝑥, 𝑦⟫ ↔ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) |
13 | 1, 12 | bitri 275 | 1 ⊢ (⟪𝑋, 𝑌⟫ ∈ (𝐴 ×× 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1536 ∈ wcel 2105 ∃wrex 3067 ⟪caltop 35937 ×× caltxp 35938 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1539 df-fal 1549 df-ex 1776 df-sb 2062 df-clab 2712 df-cleq 2726 df-clel 2813 df-ral 3059 df-rex 3068 df-v 3479 df-dif 3965 df-un 3967 df-ss 3979 df-nul 4339 df-sn 4631 df-pr 4633 df-altop 35939 df-altxp 35940 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |