MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  el2xpss Structured version   Visualization version   GIF version

Theorem el2xpss 8018
Description: Version of elrel 5770 for triple Cartesian products. (Contributed by Scott Fenton, 1-Feb-2025.)
Assertion
Ref Expression
el2xpss ((𝐴𝑅𝑅 ⊆ ((𝐵 × 𝐶) × 𝐷)) → ∃𝑥𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐷,𝑦,𝑧
Allowed substitution hints:   𝑅(𝑥,𝑦,𝑧)

Proof of Theorem el2xpss
StepHypRef Expression
1 ssel2 3931 . . 3 ((𝑅 ⊆ ((𝐵 × 𝐶) × 𝐷) ∧ 𝐴𝑅) → 𝐴 ∈ ((𝐵 × 𝐶) × 𝐷))
21ancoms 462 . 2 ((𝐴𝑅𝑅 ⊆ ((𝐵 × 𝐶) × 𝐷)) → 𝐴 ∈ ((𝐵 × 𝐶) × 𝐷))
3 el2xptp 8016 . . 3 (𝐴 ∈ ((𝐵 × 𝐶) × 𝐷) ↔ ∃𝑥𝐵𝑦𝐶𝑧𝐷 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
4 rexex 3092 . . . . . . 7 (∃𝑧𝐷 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
54reximi 3100 . . . . . 6 (∃𝑦𝐶𝑧𝐷 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑦𝐶𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
6 rexex 3092 . . . . . 6 (∃𝑦𝐶𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
75, 6syl 17 . . . . 5 (∃𝑦𝐶𝑧𝐷 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
87reximi 3100 . . . 4 (∃𝑥𝐵𝑦𝐶𝑧𝐷 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑥𝐵𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
9 rexex 3092 . . . 4 (∃𝑥𝐵𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑥𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
108, 9syl 17 . . 3 (∃𝑥𝐵𝑦𝐶𝑧𝐷 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑥𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
113, 10sylbi 219 . 2 (𝐴 ∈ ((𝐵 × 𝐶) × 𝐷) → ∃𝑥𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
122, 11syl 17 1 ((𝐴𝑅𝑅 ⊆ ((𝐵 × 𝐶) × 𝐷)) → ∃𝑥𝑦𝑧 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1560  wex 1799  wcel 2142  wrex 3086  wss 3904  cotp 4590   × cxp 5645
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-ot 4591  df-iun 4951  df-opab 5163  df-xp 5653  df-rel 5654
This theorem is referenced by:  frxp3  8131
  Copyright terms: Public domain W3C validator