NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  sb9i Unicode version

Theorem sb9i 2094
Description: Commutation of quantification and substitution variables. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
sb9i

Proof of Theorem sb9i
StepHypRef Expression
1 drsb1 2022 . . . . 5
2 drsb2 2061 . . . . 5
31, 2bitr3d 246 . . . 4
43dral1 1965 . . 3
54biimprd 214 . 2
6 nfnae 1956 . . . 4  F/
7 hbsb2 2057 . . . 4
86, 7alimd 1764 . . 3
9 stdpc4 2024 . . . . . 6
10 sbco 2083 . . . . . 6
119, 10sylib 188 . . . . 5
1211alimi 1559 . . . 4
1312a7s 1735 . . 3
148, 13syl6 29 . 2
155, 14pm2.61i 156 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4  wal 1540  wsb 1648
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649
This theorem is referenced by:  sb9  2095
  Copyright terms: Public domain W3C validator