Theorem mincom 10111

Description: The minimum of two reals is commutative. (Contributed by Jim Kingdon, 8-Feb-2021.)

Assertion

Ref	Expression
mincom	|- inf ( { A , B } , RR , < ) = inf ( { B , A } , RR , < )

Proof of Theorem mincom

Step	Hyp	Ref	Expression
1		prcom 3468	. 2 |- { A , B } = { B , A }
2	1	infeq1i 6426	1 |- inf ( { A , B } , RR , < ) = inf ( { B , A } , RR , < )

Syntax hints:   = wceq 1284   {cpr 3399  infcinf 6396   RRcr 6980   < clt 7153

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-un 2977  df-pr 3405  df-uni 3602  df-sup 6397  df-inf 6398

This theorem is referenced by: (None)