proposition: Lemma pred_ext_nondep_6 : forall A1 A2 A3 A4 A5 A6 (P Q : A1 -> A2 -> A3 -> A4 -> A5 -> A6 -> Prop), (forall x1 x2 x3 x4 x5 x6, P x1 x2 x3 x4 x5 x6 <-> Q x1 x2 x3 x4 x5 x6) -> P = Q.
proof: Proof. Proof using. intros. apply~ pred_ext_6. Qed.
imports: TLC(LibTactics LibAxioms)