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

Theorem ralxp3es 8128
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 3797 . 2 𝑦[(1st ‘(1st𝑥)) / 𝑦][(2nd ‘(1st𝑥)) / 𝑧][(2nd𝑥) / 𝑤]𝜑
2 nfcv 2902 . . 3 𝑧(1st ‘(1st𝑥))
3 nfsbc1v 3797 . . 3 𝑧[(2nd ‘(1st𝑥)) / 𝑧][(2nd𝑥) / 𝑤]𝜑
42, 3nfsbcw 3799 . 2 𝑧[(1st ‘(1st𝑥)) / 𝑦][(2nd ‘(1st𝑥)) / 𝑧][(2nd𝑥) / 𝑤]𝜑
5 nfcv 2902 . . 3 𝑤(1st ‘(1st𝑥))
6 nfcv 2902 . . . 4 𝑤(2nd ‘(1st𝑥))
7 nfsbc1v 3797 . . . 4 𝑤[(2nd𝑥) / 𝑤]𝜑
86, 7nfsbcw 3799 . . 3 𝑤[(2nd ‘(1st𝑥)) / 𝑧][(2nd𝑥) / 𝑤]𝜑
95, 8nfsbcw 3799 . 2 𝑤[(1st ‘(1st𝑥)) / 𝑦][(2nd ‘(1st𝑥)) / 𝑧][(2nd𝑥) / 𝑤]𝜑
10 nfv 1916 . 2 𝑥𝜑
11 sbcoteq1a 8040 . 2 (𝑥 = ⟨𝑦, 𝑧, 𝑤⟩ → ([(1st ‘(1st𝑥)) / 𝑦][(2nd ‘(1st𝑥)) / 𝑧][(2nd𝑥) / 𝑤]𝜑𝜑))
121, 4, 9, 10, 11ralxp3f 8126 1 (∀𝑥 ∈ ((𝐴 × 𝐵) × 𝐶)[(1st ‘(1st𝑥)) / 𝑦][(2nd ‘(1st𝑥)) / 𝑧][(2nd𝑥) / 𝑤]𝜑 ↔ ∀𝑦𝐴𝑧𝐵𝑤𝐶 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wral 3060  [wsbc 3777   × cxp 5674  cfv 6543  1st c1st 7976  2nd c2nd 7977
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7728
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-ot 4637  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-iota 6495  df-fun 6545  df-fv 6551  df-1st 7978  df-2nd 7979
This theorem is referenced by:  frpoins3xp3g  8130
  Copyright terms: Public domain W3C validator