Unused premises go to the last premise of iApply (instead of the first).

ProofMode.md

@@ -17,8 +17,8 @@ Applying hypotheses and lemmas
   conclusion of `pm_trm` and generates goals for the premises of `pm_trm`. See
   proof mode terms below.
   If the applied term has more premises than given specialization patterns, the
-  pattern is extended with `[-] ... [-]`.  As a consequence, all unused spatial
-  hypotheses move to the first premise without an explicit specialization
+  pattern is extended with `[] ... []`.  As a consequence, all unused spatial
+  hypotheses move to the last premise without an explicit specialization
   pattern.
 
 Context management

theories/proofmode/tactics.v

@@ -431,7 +431,7 @@ Tactic Notation "iApply" open_constr(lem) :=
       [env_cbv; reflexivity
       |apply _
       |lazy beta (* reduce betas created by instantiation *)]
-    |iSpecializePat H "[-]"; last go H] in
+    |iSpecializePat H "[]"; last go H] in
   iPoseProofCore lem as false true (fun H =>
     first [iExact H|go H|iTypeOf H (fun Q => fail 1 "iApply: cannot apply" Q)]).
 

theories/tests/proofmode.v

@@ -118,5 +118,5 @@ Proof.
 Qed.
 
 Lemma demo_11 (M : ucmraT) (P Q R : uPred M) :
-  (P -∗ Q -∗ True -∗ True -∗ R) -∗ P -∗ Q -∗ R.
+  (P -∗ True -∗ True -∗ Q -∗ R) -∗ P -∗ Q -∗ R.
 Proof. iIntros "H HP HQ". by iApply ("H" with "[HP]"). Qed.