Metamath Proof Explorer


Theorem ltgov

Description: Strict "shorter than" geometric relation between segments. (Contributed by Thierry Arnoux, 15-Dec-2019)

Ref Expression
Hypotheses legval.p P=BaseG
legval.d -˙=distG
legval.i I=ItvG
legval.l ˙=𝒢G
legval.g φG𝒢Tarski
legso.a E=-˙P×P
legso.f φFun-˙
legso.l <˙=˙EI
legso.d φP×Pdom-˙
ltgov.a φAP
ltgov.b φBP
Assertion ltgov φA-˙B<˙C-˙DA-˙B˙C-˙DA-˙BC-˙D

Proof

Step Hyp Ref Expression
1 legval.p P=BaseG
2 legval.d -˙=distG
3 legval.i I=ItvG
4 legval.l ˙=𝒢G
5 legval.g φG𝒢Tarski
6 legso.a E=-˙P×P
7 legso.f φFun-˙
8 legso.l <˙=˙EI
9 legso.d φP×Pdom-˙
10 ltgov.a φAP
11 ltgov.b φBP
12 8 breqi A-˙B<˙C-˙DA-˙B˙EIC-˙D
13 brdif A-˙B˙EIC-˙DA-˙B˙EC-˙D¬A-˙BIC-˙D
14 12 13 bitri A-˙B<˙C-˙DA-˙B˙EC-˙D¬A-˙BIC-˙D
15 ovex C-˙DV
16 15 brresi A-˙B˙EC-˙DA-˙BEA-˙B˙C-˙D
17 16 anbi1i A-˙B˙EC-˙D¬A-˙BIC-˙DA-˙BEA-˙B˙C-˙D¬A-˙BIC-˙D
18 an21 A-˙BEA-˙B˙C-˙D¬A-˙BIC-˙DA-˙B˙C-˙DA-˙BE¬A-˙BIC-˙D
19 14 17 18 3bitri A-˙B<˙C-˙DA-˙B˙C-˙DA-˙BE¬A-˙BIC-˙D
20 10 11 7 9 elovimad φA-˙B-˙P×P
21 20 6 eleqtrrdi φA-˙BE
22 21 biantrurd φ¬A-˙BIC-˙DA-˙BE¬A-˙BIC-˙D
23 15 ideq A-˙BIC-˙DA-˙B=C-˙D
24 23 necon3bbii ¬A-˙BIC-˙DA-˙BC-˙D
25 22 24 bitr3di φA-˙BE¬A-˙BIC-˙DA-˙BC-˙D
26 25 anbi2d φA-˙B˙C-˙DA-˙BE¬A-˙BIC-˙DA-˙B˙C-˙DA-˙BC-˙D
27 19 26 syl5bb φA-˙B<˙C-˙DA-˙B˙C-˙DA-˙BC-˙D