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

Theorem ralxp3es 8169
Description: Restricted for-all over a triple Cartesian product with explicit substitution. (Contributed by Scott Fenton, 22-Aug-2024.)
Assertion
Ref Expression
ralxp3es (∀𝑥 ∈ ((𝐴 × 𝐵) × 𝐶)[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐶 𝜑)
Distinct variable groups:   𝑤,𝐴,𝑥,𝑦,𝑧   𝑤,𝐵,𝑥,𝑦,𝑧   𝑤,𝐶,𝑥,𝑦,𝑧   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑤)

Proof of Theorem ralxp3es
StepHypRef Expression
1 nfsbc1v 3762 . 2 Ⅎ𝑦[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
2 nfcv 2926 . . 3 Ⅎ𝑧(1st ‘(1st ‘𝑥))
3 nfsbc1v 3762 . . 3 Ⅎ𝑧[(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
42, 3nfsbcw 3764 . 2 Ⅎ𝑧[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
5 nfcv 2926 . . 3 Ⅎ𝑤(1st ‘(1st ‘𝑥))
6 nfcv 2926 . . . 4 Ⅎ𝑤(2nd ‘(1st ‘𝑥))
7 nfsbc1v 3762 . . . 4 Ⅎ𝑤[(2nd ‘𝑥) / 𝑤]𝜑
86, 7nfsbcw 3764 . . 3 Ⅎ𝑤[(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
95, 8nfsbcw 3764 . 2 Ⅎ𝑤[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
10 nfv 1948 . 2 Ⅎ𝑥𝜑
11 sbcoteq1a 8073 . 2 (𝑥 = ⟨𝑦, 𝑧, 𝑤⟩ → ([(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑 ↔ 𝜑))
121, 4, 9, 10, 11ralxp3f 8167 1 (∀𝑥 ∈ ((𝐴 × 𝐵) × 𝐶)[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐶 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∀wral 3080  [wsbc 3742   × cxp 5653  ‘cfv 6547  1st c1st 8009  2nd c2nd 8010
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-ot 4862  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6501  df-fun 6549  df-fv 6555  df-1st 8011  df-2nd 8012
This theorem is used by:  frpoins3xp3g  8171
  Copyright terms: Public domain W3C validator