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

Theorem ralcomf 3090
Description: Commutation of restricted universal quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
Hypotheses
Ref Expression
ralcomf.1 𝑦𝐴
ralcomf.2 𝑥𝐵
Assertion
Ref Expression
ralcomf (∀𝑥𝐴𝑦𝐵 𝜑 ↔ ∀𝑦𝐵𝑥𝐴 𝜑)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)

Proof of Theorem ralcomf
StepHypRef Expression
1 ancomst 468 . . . 4 (((𝑥𝐴𝑦𝐵) → 𝜑) ↔ ((𝑦𝐵𝑥𝐴) → 𝜑))
212albii 1745 . . 3 (∀𝑥𝑦((𝑥𝐴𝑦𝐵) → 𝜑) ↔ ∀𝑥𝑦((𝑦𝐵𝑥𝐴) → 𝜑))
3 alcom 2034 . . 3 (∀𝑥𝑦((𝑦𝐵𝑥𝐴) → 𝜑) ↔ ∀𝑦𝑥((𝑦𝐵𝑥𝐴) → 𝜑))
42, 3bitri 264 . 2 (∀𝑥𝑦((𝑥𝐴𝑦𝐵) → 𝜑) ↔ ∀𝑦𝑥((𝑦𝐵𝑥𝐴) → 𝜑))
5 ralcomf.1 . . 3 𝑦𝐴
65r2alf 2934 . 2 (∀𝑥𝐴𝑦𝐵 𝜑 ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → 𝜑))
7 ralcomf.2 . . 3 𝑥𝐵
87r2alf 2934 . 2 (∀𝑦𝐵𝑥𝐴 𝜑 ↔ ∀𝑦𝑥((𝑦𝐵𝑥𝐴) → 𝜑))
94, 6, 83bitr4i 292 1 (∀𝑥𝐴𝑦𝐵 𝜑 ↔ ∀𝑦𝐵𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  wal 1478  wcel 1987  wnfc 2748  wral 2908
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2913
This theorem is referenced by:  ralcom  3092  ssiinf  4542  ralcom4f  29204
  Copyright terms: Public domain W3C validator