Because
some people erroneously believe that phasing takes more moves than TSLE, and the forum search function is too useless to find any information to prove them wrong...
On a flight without a physical cube, I mentally went through all the possible last-slot F2L cases (<RU>) and came up with these statistics for creating+inserting a pair and phasing the LL edges:
To reduce the F2L state to either a pair in the U-layer (any AUF) or an R-U-R' type insert (just that single AUF), 4.667 moves are required.
(As a side note, to reduce the F2L state to a pair in the U-layer (any AUF), 5.573 moves are required.)
Of these, 20/75 are the R-U-R' type, which takes 5.667 moves to insert while phasing, using basic intuition of the 3 unique cases.
52/75 are pair-types that have edges at UR or UB. These all require a 1 move AUF before insertion while phasing.
1/75 has the edge at UL which requires .667 moves to AUF.
2/75 have the edge at UF which requires .333 moves to AUF (one of these is literally taking a LS-skipped pair out of the slot).
Of the pair types, 4.333 moves are required to insert the pair while phasing, using basic intuition of the 3 unique cases.
Combining those statistics and frequencies, we see that 10.067 moves <RU> are required to solve *any* LS case while phasing the LL edges.
And if you aren't dumb about how you deal with a LS-skip, I believe this number drops to 10.004 htm <RU>.
*although i believe i'm pretty (hopefully, by now, perfectly) efficient with <RU>, I may have missed something shorter, so these are upper bounds.
---
Now, according to
Phillip Espinoza, TSLE requires 10.37 htm (I think this is <RU>; if not, the <RU> movecount would exceed 10.37). Add .75 moves for AUF and you have
11.12 htm <RU> for TSLE from any initial F2L state.
---
Therefore, creating and inserting the final F2L pair while phasing the LL edges is more than 1 move <RU> shorter than TSLE.