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

Theorem ralxp3es 8156
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 3759 . 2 Ⅎ𝑦[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
2 nfcv 2923 . . 3 Ⅎ𝑧(1st ‘(1st ‘𝑥))
3 nfsbc1v 3759 . . 3 Ⅎ𝑧[(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
42, 3nfsbcw 3761 . 2 Ⅎ𝑧[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
5 nfcv 2923 . . 3 Ⅎ𝑤(1st ‘(1st ‘𝑥))
6 nfcv 2923 . . . 4 Ⅎ𝑤(2nd ‘(1st ‘𝑥))
7 nfsbc1v 3759 . . . 4 Ⅎ𝑤[(2nd ‘𝑥) / 𝑤]𝜑
86, 7nfsbcw 3761 . . 3 Ⅎ𝑤[(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
95, 8nfsbcw 3761 . 2 Ⅎ𝑤[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑
10 nfv 1947 . 2 Ⅎ𝑥𝜑
11 sbcoteq1a 8062 . 2 (𝑥 = ⟨𝑦, 𝑧, 𝑤⟩ → ([(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑 ↔ 𝜑))
121, 4, 9, 10, 11ralxp3f 8154 1 (∀𝑥 ∈ ((𝐴 × 𝐵) × 𝐶)[(1st ‘(1st ‘𝑥)) / 𝑦][(2nd ‘(1st ‘𝑥)) / 𝑧][(2nd ‘𝑥) / 𝑤]𝜑 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐶 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∀wral 3077  [wsbc 3739   × cxp 5649  ‘cfv 6538  1st c1st 7999  2nd c2nd 8000
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751
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-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-ot 4593  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6494  df-fun 6540  df-fv 6546  df-1st 8001  df-2nd 8002
This theorem is used by:  frpoins3xp3g  8158
  Copyright terms: Public domain W3C validator