intros Q a b c nZb nZc p q r Cpxc Cpxb red_r0 Cpxa divP_ab in_bp_Q divP_ac
in_cr_Q Rec red1 red2 r1 s1 reds1 reds2.
cut (canonical A0 eqA ltM p);
[ intros Op1 | apply canonical_imp_canonical with a; auto ].
cut (canonical A0 eqA ltM r);
[ intros Op2 | apply canonical_imp_canonical with c; auto ].
cut (canonical A0 eqA ltM q);
[ intros Op3 | apply canonical_imp_canonical with b; auto ].
cut (~ zeroP (A:=A) A0 eqA (n:=n) a); [ intros nZa | idtac ].
cut (~ zeroP (A:=A) A0 eqA (n:=n) (ppc (A:=A) A1 (n:=n) c b));
[ intros nZppcd | idtac ].
cut
(eqP A eqA n
(mults (A:=A) multA (n:=n)
(divTerm (A:=A) (A0:=A0) (eqA:=eqA) divA (n:=n) a
(b:=ppc (A:=A) A1 (n:=n) c b) nZppcd)
(spolyf (pX c r) (pX b q) Cpxc Cpxb))
(minuspf A A0 A1 eqA invA minusA multA eqA_dec n ltM ltM_dec
(spminusf A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec a b
nZb p q)
(spminusf A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec a c
nZc p r))); [ intros red3 | apply eqTerm_spolyf_red2; auto ].
2: apply ppc_nZ with (1 := cs); auto.
2: apply canonical_nzeroP with (ltM := ltM) (p := p); auto.
inversion_clear red_r0.
lapply
(reduceplus_mults _ _ _ _ _ _ _ _ _ cs eqA_dec n ltM ltM_dec os Q
(divTerm (A:=A) (A0:=A0) (eqA:=eqA) divA (n:=n) a
(b:=ppc (A:=A) A1 (n:=n) c b) nZppcd)
(spolyf (pX c r) (pX b q) Cpxc Cpxb) (pO A n));
[ intros H'3; lapply H'3;
[ intros H'4; lapply H'4; [ intros H'5; clear H'4 H'3 | clear H'4 H'3 ]
| clear H'3 ]
| idtac ]; auto.
elim
(red_minus_zero_reduce _ _ _ _ _ _ _ _ _ cs eqA_dec _ _ ltM_dec os Q
(spminusf A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec a b
nZb p q)
(spminusf A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec a c
nZc p r));
[ intros r2 E; elim E; intros H'6 H'7; clear E | idtac | idtac | idtac ];
auto.
2: apply canonical_spminusf with (1 := cs); auto.
2: apply canonical_spminusf with (1 := cs); auto.
elim
reduce0_reducestar
with (1 := cs) (Q := Q) (p := r2) (ltM_dec := ltM_dec) (eqA_dec := eqA_dec);
auto.
intros t0 E;
lapply
(Rec
(spminusf A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec a b
nZb p q));
[ intros H'1; lapply H'1; [ intros H'2; elim H'2; clear H'1 | clear H'1 ]
| idtac ]; auto.
intros H'.
lapply
(Rec
(spminusf A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec a c
nZc p r));
[ intros H'1; lapply H'1; [ intros H'3; elim H'3; clear H'1 | clear H'1 ]
| idtac ]; auto.
intros H'1.
apply (eqp_trans _ _ _ _ _ _ _ _ _ cs n) with (y := t0).
apply H'; auto.
auto;
apply
(reducestar_trans A A0 A1 eqA plusA invA minusA multA divA cs eqA_dec n ltM
ltM_dec os Q) with (y := r2); auto.
apply canonical_spminusf with (1 := cs); auto.
apply H'1; auto.
apply
(reducestar_trans A A0 A1 eqA plusA invA minusA multA divA cs eqA_dec n ltM
ltM_dec os Q) with (y := r2); auto.
apply canonical_spminusf with (1 := cs); auto.
apply
ltP_reduce with (Q := Q) (1 := cs) (ltM_dec := ltM_dec) (eqA_dec := eqA_dec);
auto.
apply canonical_spminusf with (1 := cs); auto.
apply
ltP_reduce with (Q := Q) (1 := cs) (ltM_dec := ltM_dec) (eqA_dec := eqA_dec);
auto.
apply canonical_spminusf with (1 := cs); auto.
apply canonical_reduceplus with (1 := cs) (3 := H'7); auto.
apply canonical_spminusf with (1 := cs); auto.
apply
reduceplus_eqp_com
with
(p := mults (A:=A) multA (n:=n)
(divTerm (A:=A) (A0:=A0) (eqA:=eqA) divA (n:=n) a
(b:=ppc (A:=A) A1 (n:=n) c b) nZppcd)
(spolyf (pX c r) (pX b q) Cpxc Cpxb))
(q := mults (A:=A) multA (n:=n)
(divTerm (A:=A) (A0:=A0) (eqA:=eqA) divA (n:=n) a
(b:=ppc (A:=A) A1 (n:=n) c b) nZppcd)
(pO A n))
(1 := cs); auto; simpl in |- *; auto.
Qed.

(* Specifications: *)
Theorem fconfl_top :
forall (Q : list (poly A0 eqA ltM)) (q r : list (Term A n)),
Spoly_1 Q q r ->
forall p : list (Term A n),
Reducep Q p q r ->
canonical A0 eqA ltM p ->
canonical A0 eqA ltM q ->
canonical A0 eqA ltM r ->
(forall q0 : list (Term A n),
canonical A0 eqA ltM q0 ->
ltP (A:=A) (n:=n) ltM q0 p -> ReduStarConfluent Q q0) ->
Confluent Q p q r.