proposition: Theorem not_ex_all_not_rel3_realizer : forall T₁ T₂ T₃ (P₁ : T₁ -> formula) (P₂ : T₂ -> formula) (P₃ : T₃ -> formula) (F : T₁ -> T₂ -> T₃ -> formula), forall e, not_ex_all_not_rel3↓e ⊩ ¬(∃₃x,y,z∈P₁×P₂×P₃, F x y z) → ∀₃x,y,z∈P₁×P₂×P₃, ¬F x y z.
proof: Proof. repeat Ksolve. Qed.
imports: ClassicalRealizability.Tactics ClassicalRealizability.BasicResults ClassicalRealizability.Subtyping