Construct a formal proof which shows that the sentence below is a theorem of predicate logic. *the E's are existential quantifiers (usually designated by backwards E's). the & are "and". Do not use quantifier negation rules.
[(x)(~Rx or Nx)& ~(Ex)Nx or (Ey)(z)Szy] ->(~(Ex)Rx or (z)(Ey)Szy
A formal proof is provided to how that a sentence is a theorem of predicate logic.