![]() |
Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > elaltxp | Structured version Visualization version GIF version |
Description: Membership in alternate Cartesian products. (Contributed by Scott Fenton, 23-Mar-2012.) |
Ref | Expression |
---|---|
elaltxp | ⊢ (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3482 | . 2 ⊢ (𝑋 ∈ (𝐴 ×× 𝐵) → 𝑋 ∈ V) | |
2 | altopex 35784 | . . . . 5 ⊢ ⟪𝑥, 𝑦⟫ ∈ V | |
3 | eleq1 2814 | . . . . 5 ⊢ (𝑋 = ⟪𝑥, 𝑦⟫ → (𝑋 ∈ V ↔ ⟪𝑥, 𝑦⟫ ∈ V)) | |
4 | 2, 3 | mpbiri 257 | . . . 4 ⊢ (𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V) |
5 | 4 | a1i 11 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V)) |
6 | 5 | rexlimivv 3190 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫ → 𝑋 ∈ V) |
7 | eqeq1 2730 | . . . 4 ⊢ (𝑧 = 𝑋 → (𝑧 = ⟪𝑥, 𝑦⟫ ↔ 𝑋 = ⟪𝑥, 𝑦⟫)) | |
8 | 7 | 2rexbidv 3210 | . . 3 ⊢ (𝑧 = 𝑋 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫)) |
9 | df-altxp 35783 | . . 3 ⊢ (𝐴 ×× 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫} | |
10 | 8, 9 | elab2g 3668 | . 2 ⊢ (𝑋 ∈ V → (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫)) |
11 | 1, 6, 10 | pm5.21nii 377 | 1 ⊢ (𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑋 = ⟪𝑥, 𝑦⟫) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1534 ∈ wcel 2099 ∃wrex 3060 Vcvv 3462 ⟪caltop 35780 ×× caltxp 35781 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2697 ax-sep 5304 ax-nul 5311 ax-pr 5433 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-tru 1537 df-fal 1547 df-ex 1775 df-sb 2061 df-clab 2704 df-cleq 2718 df-clel 2803 df-rex 3061 df-v 3464 df-dif 3950 df-un 3952 df-nul 4326 df-sn 4634 df-pr 4636 df-altop 35782 df-altxp 35783 |
This theorem is referenced by: altopelaltxp 35800 altxpsspw 35801 |
Copyright terms: Public domain | W3C validator |