| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > otel3xp | Structured version Visualization version GIF version | ||
| Description: An ordered triple is an element of a doubled Cartesian product. (Contributed by Alexander van der Vekens, 26-Feb-2018.) |
| Ref | Expression |
|---|---|
| otel3xp | ⊢ ((𝑇 = 〈𝐴, 𝐵, 𝐶〉 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍)) → 𝑇 ∈ ((𝑋 × 𝑌) × 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ot 4596 | . . . 4 ⊢ 〈𝐴, 𝐵, 𝐶〉 = 〈〈𝐴, 𝐵〉, 𝐶〉 | |
| 2 | 3simpa 1166 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) | |
| 3 | opelxp 5695 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 ∈ (𝑋 × 𝑌) ↔ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) | |
| 4 | 2, 3 | sylibr 237 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 〈𝐴, 𝐵〉 ∈ (𝑋 × 𝑌)) |
| 5 | simp3 1156 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 𝐶 ∈ 𝑍) | |
| 6 | 4, 5 | opelxpd 5698 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 〈〈𝐴, 𝐵〉, 𝐶〉 ∈ ((𝑋 × 𝑌) × 𝑍)) |
| 7 | 1, 6 | eqeltrid 2866 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 〈𝐴, 𝐵, 𝐶〉 ∈ ((𝑋 × 𝑌) × 𝑍)) |
| 8 | eleq1 2850 | . . 3 ⊢ (𝑇 = 〈𝐴, 𝐵, 𝐶〉 → (𝑇 ∈ ((𝑋 × 𝑌) × 𝑍) ↔ 〈𝐴, 𝐵, 𝐶〉 ∈ ((𝑋 × 𝑌) × 𝑍))) | |
| 9 | 7, 8 | imbitrrid 249 | . 2 ⊢ (𝑇 = 〈𝐴, 𝐵, 𝐶〉 → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → 𝑇 ∈ ((𝑋 × 𝑌) × 𝑍))) |
| 10 | 9 | imp 412 | 1 ⊢ ((𝑇 = 〈𝐴, 𝐵, 𝐶〉 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍)) → 𝑇 ∈ ((𝑋 × 𝑌) × 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 〈cop 4593 〈cotp 4595 × cxp 5657 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-ot 4596 df-opab 5172 df-xp 5665 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |