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

Theorem r19.30 2756
Description: Theorem 19.30 of [Margaris] p. 90 with restricted quantifiers. (Contributed by Scott Fenton, 25-Feb-2011.)
Assertion
Ref Expression
r19.30

Proof of Theorem r19.30
StepHypRef Expression
1 ralim 2685 . 2
2 orcom 376 . . . 4
3 df-or 359 . . . 4
42, 3bitri 240 . . 3
54ralbii 2638 . 2
6 orcom 376 . . 3
7 dfrex2 2627 . . . 4
87orbi2i 505 . . 3
9 imor 401 . . 3
106, 8, 93bitr4i 268 . 2
111, 5, 103imtr4i 257 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4   wo 357  wral 2614  wrex 2615
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-11 1746
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-ral 2619  df-rex 2620
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator