ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xrminltinf Unicode version
Theorem xrminltinf 11293
Description: Two ways of saying an extended real is greater than the minimum of two others. (Contributed by Jim Kingdon, 19-May-2023.)
Assertion
Ref Expression
xrminltinf |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> (inf ( { B , C } , RR* , < ) < A <-> ( B < A \/ C < A ) ) )
Proof of Theorem xrminltinf
StepHypRef Expression
1 xnegcl 9845 . . . 4 |- ( B e. RR* -> -e B e. RR* )
213ad2ant2 1020 . . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> -e B e. RR* )
3 xnegcl 9845 . . . 4 |- ( C e. RR* -> -e C e. RR* )
433ad2ant3 1021 . . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> -e C e. RR* )
5 xnegcl 9845 . . . 4 |- ( A e. RR* -> -e A e. RR* )
653ad2ant1 1019 . . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> -e A e. RR* )
7 xrltmaxsup 11278 . . 3 |- ( ( -e B e. RR* /\ -e C e. RR* /\ -e A e. RR* ) -> ( -e A < sup ( { -e B , -e C } , RR* , < ) <-> ( -e A < -e B \/ -e A < -e C ) ) )
82, 4, 6, 7syl3anc 1248 . 2 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( -e A < sup ( { -e B , -e C } , RR* , < ) <-> ( -e A < -e B \/ -e A < -e C ) ) )
9 xrminmax 11286 . . . . 5 |- ( ( B e. RR* /\ C e. RR* ) -> inf ( { B , C } , RR* , < ) = -e sup ( { -e B , -e C } , RR* , < ) )
1093adant1 1016 . . . 4 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> inf ( { B , C } , RR* , < ) = -e sup ( { -e B , -e C } , RR* , < ) )
11 xnegneg 9846 . . . . . 6 |- ( A e. RR* -> -e -e A = A )
1211eqcomd 2193 . . . . 5 |- ( A e. RR* -> A = -e -e A )
13123ad2ant1 1019 . . . 4 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> A = -e -e A )
1410, 13breq12d 4028 . . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> (inf ( { B , C } , RR* , < ) < A <-> -e sup ( { -e B , -e C } , RR* , < ) < -e -e A ) )
15 xrmaxcl 11273 . . . . 5 |- ( ( -e B e. RR* /\ -e C e. RR* ) -> sup ( { -e B , -e C } , RR* , < ) e. RR* )
162, 4, 15syl2anc 411 . . . 4 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> sup ( { -e B , -e C } , RR* , < ) e. RR* )
17 xltneg 9849 . . . 4 |- ( ( -e A e. RR* /\ sup ( { -e B , -e C } , RR* , < ) e. RR* ) -> ( -e A < sup ( { -e B , -e C } , RR* , < ) <-> -e sup ( { -e B , -e C } , RR* , < ) < -e -e A ) )
186, 16, 17syl2anc 411 . . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( -e A < sup ( { -e B , -e C } , RR* , < ) <-> -e sup ( { -e B , -e C } , RR* , < ) < -e -e A ) )
1914, 18bitr4d 191 . 2 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> (inf ( { B , C } , RR* , < ) < A <-> -e A < sup ( { -e B , -e C } , RR* , < ) ) )
20 simp2 999 . . . 4 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> B e. RR* )
21 simp1 998 . . . 4 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> A e. RR* )
22 xltneg 9849 . . . 4 |- ( ( B e. RR* /\ A e. RR* ) -> ( B < A <-> -e A < -e B ) )
2320, 21, 22syl2anc 411 . . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( B < A <-> -e A < -e B ) )
24 simp3 1000 . . . 4 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> C e. RR* )
25 xltneg 9849 . . . 4 |- ( ( C e. RR* /\ A e. RR* ) -> ( C < A <-> -e A < -e C ) )
2624, 21, 25syl2anc 411 . . 3 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( C < A <-> -e A < -e C ) )
2723, 26orbi12d 794 . 2 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( ( B < A \/ C < A ) <-> ( -e A < -e B \/ -e A < -e C ) ) )
288, 19, 273bitr4d 220 1 |- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> (inf ( { B , C } , RR* , < ) < A <-> ( B < A \/ C < A ) ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   <-> wb 105   \/ wo 709   /\ w3a 979   = wceq 1363   e. wcel 2158   {cpr 3605   class class class wbr 4015   supcsup 6994  infcinf 6995   RR*cxr 8004   < clt 8005   -ecxne 9782
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-iinf 4599  ax-cnex 7915  ax-resscn 7916  ax-1cn 7917  ax-1re 7918  ax-icn 7919  ax-addcl 7920  ax-addrcl 7921  ax-mulcl 7922  ax-mulrcl 7923  ax-addcom 7924  ax-mulcom 7925  ax-addass 7926  ax-mulass 7927  ax-distr 7928  ax-i2m1 7929  ax-0lt1 7930  ax-1rid 7931  ax-0id 7932  ax-rnegex 7933  ax-precex 7934  ax-cnre 7935  ax-pre-ltirr 7936  ax-pre-ltwlin 7937  ax-pre-lttrn 7938  ax-pre-apti 7939  ax-pre-ltadd 7940  ax-pre-mulgt0 7941  ax-pre-mulext 7942  ax-arch 7943  ax-caucvg 7944
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rmo 2473  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-if 3547  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-id 4305  df-po 4308  df-iso 4309  df-iord 4378  df-on 4380  df-ilim 4381  df-suc 4383  df-iom 4602  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-isom 5237  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6154  df-2nd 6155  df-recs 6319  df-frec 6405  df-sup 6996  df-inf 6997  df-pnf 8007  df-mnf 8008  df-xr 8009  df-ltxr 8010  df-le 8011  df-sub 8143  df-neg 8144  df-reap 8545  df-ap 8552  df-div 8643  df-inn 8933  df-2 8991  df-3 8992  df-4 8993  df-n0 9190  df-z 9267  df-uz 9542  df-rp 9667  df-xneg 9785  df-seqfrec 10459  df-exp 10533  df-cj 10864  df-re 10865  df-im 10866  df-rsqrt 11020  df-abs 11021
This theorem is referenced by:  bdbl  14274
  Copyright terms: Public domain W3C validator