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

Theorem cbvral3v 3413
Description: Change bound variables of triple restricted universal quantification, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2379. Use the weaker cbvral3vw 3410 when possible. (Contributed by NM, 10-May-2005.) (New usage is discouraged.)
Hypotheses
Ref Expression
cbvral3v.1 (𝑥 = 𝑤 → (𝜑𝜒))
cbvral3v.2 (𝑦 = 𝑣 → (𝜒𝜃))
cbvral3v.3 (𝑧 = 𝑢 → (𝜃𝜓))
Assertion
Ref Expression
cbvral3v (∀𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∀𝑤𝐴𝑣𝐵𝑢𝐶 𝜓)
Distinct variable groups:   𝜑,𝑤   𝜓,𝑧   𝜒,𝑥   𝜒,𝑣   𝑦,𝑢,𝜃   𝑥,𝐴   𝑤,𝐴   𝑥,𝑦,𝐵   𝑦,𝑤,𝐵   𝑣,𝐵   𝑥,𝑧,𝐶,𝑦   𝑧,𝑤,𝐶   𝑧,𝑣,𝐶   𝑢,𝐶
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑣,𝑢)   𝜓(𝑥,𝑦,𝑤,𝑣,𝑢)   𝜒(𝑦,𝑧,𝑤,𝑢)   𝜃(𝑥,𝑧,𝑤,𝑣)   𝐴(𝑦,𝑧,𝑣,𝑢)   𝐵(𝑧,𝑢)

Proof of Theorem cbvral3v
StepHypRef Expression
1 cbvral3v.1 . . . 4 (𝑥 = 𝑤 → (𝜑𝜒))
212ralbidv 3164 . . 3 (𝑥 = 𝑤 → (∀𝑦𝐵𝑧𝐶 𝜑 ↔ ∀𝑦𝐵𝑧𝐶 𝜒))
32cbvralv 3399 . 2 (∀𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∀𝑤𝐴𝑦𝐵𝑧𝐶 𝜒)
4 cbvral3v.2 . . . 4 (𝑦 = 𝑣 → (𝜒𝜃))
5 cbvral3v.3 . . . 4 (𝑧 = 𝑢 → (𝜃𝜓))
64, 5cbvral2v 3411 . . 3 (∀𝑦𝐵𝑧𝐶 𝜒 ↔ ∀𝑣𝐵𝑢𝐶 𝜓)
76ralbii 3133 . 2 (∀𝑤𝐴𝑦𝐵𝑧𝐶 𝜒 ↔ ∀𝑤𝐴𝑣𝐵𝑢𝐶 𝜓)
83, 7bitri 278 1 (∀𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∀𝑤𝐴𝑣𝐵𝑢𝐶 𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wral 3106
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-10 2142  ax-11 2158  ax-12 2175  ax-13 2379
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clel 2870  df-nfc 2938  df-ral 3111
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator