MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infsupprpr Structured version   Visualization version   GIF version

Theorem infsupprpr 9499
Description: The infimum of a proper pair is less than the supremum of this pair. (Contributed by AV, 13-Mar-2023.)
Assertion
Ref Expression
infsupprpr ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → inf({𝐵, 𝐶}, 𝐴, 𝑅)𝑅sup({𝐵, 𝐶}, 𝐴, 𝑅))

Proof of Theorem infsupprpr
StepHypRef Expression
1 solin 5614 . . . 4 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → (𝐵𝑅𝐶𝐵 = 𝐶𝐶𝑅𝐵))
213adantr3 1172 . . 3 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → (𝐵𝑅𝐶𝐵 = 𝐶𝐶𝑅𝐵))
3 iftrue 4535 . . . . . . 7 (𝐵𝑅𝐶 → if(𝐵𝑅𝐶, 𝐵, 𝐶) = 𝐵)
43adantr 482 . . . . . 6 ((𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → if(𝐵𝑅𝐶, 𝐵, 𝐶) = 𝐵)
5 sotric 5617 . . . . . . . . 9 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → (𝐵𝑅𝐶 ↔ ¬ (𝐵 = 𝐶𝐶𝑅𝐵)))
653adantr3 1172 . . . . . . . 8 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → (𝐵𝑅𝐶 ↔ ¬ (𝐵 = 𝐶𝐶𝑅𝐵)))
76biimpac 480 . . . . . . 7 ((𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → ¬ (𝐵 = 𝐶𝐶𝑅𝐵))
8 ioran 983 . . . . . . . 8 (¬ (𝐵 = 𝐶𝐶𝑅𝐵) ↔ (¬ 𝐵 = 𝐶 ∧ ¬ 𝐶𝑅𝐵))
9 simprl 770 . . . . . . . . . 10 ((¬ 𝐶𝑅𝐵 ∧ (𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)))) → 𝐵𝑅𝐶)
10 iffalse 4538 . . . . . . . . . . 11 𝐶𝑅𝐵 → if(𝐶𝑅𝐵, 𝐵, 𝐶) = 𝐶)
1110adantr 482 . . . . . . . . . 10 ((¬ 𝐶𝑅𝐵 ∧ (𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)))) → if(𝐶𝑅𝐵, 𝐵, 𝐶) = 𝐶)
129, 11breqtrrd 5177 . . . . . . . . 9 ((¬ 𝐶𝑅𝐵 ∧ (𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)))) → 𝐵𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶))
1312ex 414 . . . . . . . 8 𝐶𝑅𝐵 → ((𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → 𝐵𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
148, 13simplbiim 506 . . . . . . 7 (¬ (𝐵 = 𝐶𝐶𝑅𝐵) → ((𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → 𝐵𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
157, 14mpcom 38 . . . . . 6 ((𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → 𝐵𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶))
164, 15eqbrtrd 5171 . . . . 5 ((𝐵𝑅𝐶 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶))
1716ex 414 . . . 4 (𝐵𝑅𝐶 → ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
18 eqneqall 2952 . . . . . . 7 (𝐵 = 𝐶 → (𝐵𝐶 → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
19182a1d 26 . . . . . 6 (𝐵 = 𝐶 → (𝐵𝐴 → (𝐶𝐴 → (𝐵𝐶 → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))))
20193impd 1349 . . . . 5 (𝐵 = 𝐶 → ((𝐵𝐴𝐶𝐴𝐵𝐶) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
2120adantld 492 . . . 4 (𝐵 = 𝐶 → ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
22 pm3.22 461 . . . . . . . . 9 ((𝐵𝐴𝐶𝐴) → (𝐶𝐴𝐵𝐴))
23223adant3 1133 . . . . . . . 8 ((𝐵𝐴𝐶𝐴𝐵𝐶) → (𝐶𝐴𝐵𝐴))
24 sotric 5617 . . . . . . . . 9 ((𝑅 Or 𝐴 ∧ (𝐶𝐴𝐵𝐴)) → (𝐶𝑅𝐵 ↔ ¬ (𝐶 = 𝐵𝐵𝑅𝐶)))
2524biimpd 228 . . . . . . . 8 ((𝑅 Or 𝐴 ∧ (𝐶𝐴𝐵𝐴)) → (𝐶𝑅𝐵 → ¬ (𝐶 = 𝐵𝐵𝑅𝐶)))
2623, 25sylan2 594 . . . . . . 7 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → (𝐶𝑅𝐵 → ¬ (𝐶 = 𝐵𝐵𝑅𝐶)))
2726impcom 409 . . . . . 6 ((𝐶𝑅𝐵 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → ¬ (𝐶 = 𝐵𝐵𝑅𝐶))
28 ioran 983 . . . . . . 7 (¬ (𝐶 = 𝐵𝐵𝑅𝐶) ↔ (¬ 𝐶 = 𝐵 ∧ ¬ 𝐵𝑅𝐶))
29 simpr 486 . . . . . . . . . 10 ((¬ 𝐵𝑅𝐶𝐶𝑅𝐵) → 𝐶𝑅𝐵)
30 iffalse 4538 . . . . . . . . . . 11 𝐵𝑅𝐶 → if(𝐵𝑅𝐶, 𝐵, 𝐶) = 𝐶)
31 iftrue 4535 . . . . . . . . . . 11 (𝐶𝑅𝐵 → if(𝐶𝑅𝐵, 𝐵, 𝐶) = 𝐵)
3230, 31breqan12d 5165 . . . . . . . . . 10 ((¬ 𝐵𝑅𝐶𝐶𝑅𝐵) → (if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶) ↔ 𝐶𝑅𝐵))
3329, 32mpbird 257 . . . . . . . . 9 ((¬ 𝐵𝑅𝐶𝐶𝑅𝐵) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶))
3433a1d 25 . . . . . . . 8 ((¬ 𝐵𝑅𝐶𝐶𝑅𝐵) → ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
3534expimpd 455 . . . . . . 7 𝐵𝑅𝐶 → ((𝐶𝑅𝐵 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
3628, 35simplbiim 506 . . . . . 6 (¬ (𝐶 = 𝐵𝐵𝑅𝐶) → ((𝐶𝑅𝐵 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
3727, 36mpcom 38 . . . . 5 ((𝐶𝑅𝐵 ∧ (𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶))) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶))
3837ex 414 . . . 4 (𝐶𝑅𝐵 → ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
3917, 21, 383jaoi 1428 . . 3 ((𝐵𝑅𝐶𝐵 = 𝐶𝐶𝑅𝐵) → ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
402, 39mpcom 38 . 2 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶))
41 infpr 9498 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → inf({𝐵, 𝐶}, 𝐴, 𝑅) = if(𝐵𝑅𝐶, 𝐵, 𝐶))
42 suppr 9466 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → sup({𝐵, 𝐶}, 𝐴, 𝑅) = if(𝐶𝑅𝐵, 𝐵, 𝐶))
4341, 42breq12d 5162 . . 3 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → (inf({𝐵, 𝐶}, 𝐴, 𝑅)𝑅sup({𝐵, 𝐶}, 𝐴, 𝑅) ↔ if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
44433adant3r3 1185 . 2 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → (inf({𝐵, 𝐶}, 𝐴, 𝑅)𝑅sup({𝐵, 𝐶}, 𝐴, 𝑅) ↔ if(𝐵𝑅𝐶, 𝐵, 𝐶)𝑅if(𝐶𝑅𝐵, 𝐵, 𝐶)))
4540, 44mpbird 257 1 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴𝐵𝐶)) → inf({𝐵, 𝐶}, 𝐴, 𝑅)𝑅sup({𝐵, 𝐶}, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 397  wo 846  w3o 1087  w3a 1088   = wceq 1542  wcel 2107  wne 2941  ifcif 4529  {cpr 4631   class class class wbr 5149   Or wor 5588  supcsup 9435  infcinf 9436
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-po 5589  df-so 5590  df-cnv 5685  df-iota 6496  df-riota 7365  df-sup 9437  df-inf 9438
This theorem is referenced by:  prproropf1olem2  46172
  Copyright terms: Public domain W3C validator