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

Theorem moanim 2260
 Description: Introduction of a conjunct into "at most one" quantifier. (Contributed by NM, 3-Dec-2001.)
Hypothesis
Ref Expression
moanim.1
Assertion
Ref Expression
moanim

Proof of Theorem moanim
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 impexp 433 . . . . 5
21albii 1566 . . . 4
3 moanim.1 . . . . 5
4319.21 1796 . . . 4
52, 4bitri 240 . . 3
65exbii 1582 . 2
7 nfv 1619 . . 3
87mo2 2233 . 2
9 nfv 1619 . . . . 5
109mo2 2233 . . . 4
1110imbi2i 303 . . 3
12 19.37v 1899 . . 3
1311, 12bitr4i 243 . 2
146, 8, 133bitr4i 268 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176   wa 358  wal 1540  wex 1541  wnf 1544  wmo 2205 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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  df-eu 2208  df-mo 2209 This theorem is referenced by:  moanimv  2262  moaneu  2263  moanmo  2264  2eu1  2284
 Copyright terms: Public domain W3C validator