My head obviously agrees with you Sir " :) " , but my heart most certainly doesn't " :( ". Please forgive me for utter nonsense , Sir . . Still , I think my proof's a little bit more " fullproof " , Sir , please respond if you enjoy it as well :) :)
Let another function " g " be defined such that ,
g ( x ) = 1 - f ( x )
It is now clear as water that ,
g ( 0 ) = 1 ............ And g ( 1 ) = 0
So , " g " must have a fixed point lying between ( 0 , 1 ) .
Hence , let that fixed point be " c " .
So , g ( c ) = 1 - f ( c ) = c
Or , f ( c ) = 1 - c .
Apply Langrange's Theorem for two intervals , " ( 0 , c ) " and " ( c , 1 ) " .
Clearly , for some " x1 , x2 " in the respective said intervals ,
f ' ( x1 ) = 1 - cc
And , f ' ( x2 ) = c1 - c
Clearly , " f ' ( x1 ) + f ' ( x2 ) = c1 - c + 1 - cc ≥ 2"
And obviously , " 1f ' ( x1 ) + 1f ' ( x2 ) = 1 - cc + c1 - c ≥ 2 "
Both inequalities are readily established by " AM - GM " inequality , with equality being achieved at " c = 12 " .
I don't know how obvious it is , but spotting the equality condition , I immediately thought of using a point " x " for which " f ( x ) = 12 " in Langrange's theorem and solved the initial question .