ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ax-7 Unicode version

Axiom ax-7 1353
Description: Axiom of Quantifier Commutation. This axiom says universal quantifiers can be swapped. One of the predicate logic axioms which do not involve equality. Axiom scheme C6' in [Megill] p. 448 (p. 16 of the preprint). Also appears as Lemma 12 of [Monk2] p. 109 and Axiom C5-3 of [Monk2] p. 113. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
ax-7  |-  ( A. x A. y ph  ->  A. y A. x ph )

Detailed syntax breakdown of Axiom ax-7
StepHypRef Expression
1 wph . . . 4  wff  ph
2 vy . . . 4  setvar  y
31, 2wal 1257 . . 3  wff  A. y ph
4 vx . . 3  setvar  x
53, 4wal 1257 . 2  wff  A. x A. y ph
61, 4wal 1257 . . 3  wff  A. x ph
76, 2wal 1257 . 2  wff  A. y A. x ph
85, 7wi 4 1  wff  ( A. x A. y ph  ->  A. y A. x ph )
Colors of variables: wff set class
This axiom is referenced by:  a7s  1359  alcoms  1381  hbal  1382  alcom  1383  hbald  1396  hbae  1622  bj-hbalt  10269
  Copyright terms: Public domain W3C validator