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

Theorem infpr 9517
Description: The infimum of a pair. (Contributed by AV, 4-Sep-2020.)
Assertion
Ref Expression
infpr ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → inf({𝐵, 𝐶}, 𝐴, 𝑅) = if(𝐵𝑅𝐶, 𝐵, 𝐶))

Proof of Theorem infpr
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 simp1 1136 . 2 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → 𝑅 Or 𝐴)
2 ifcl 4546 . . 3 ((𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝐴)
323adant1 1130 . 2 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝐴)
4 ifpr 4669 . . 3 ((𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ {𝐵, 𝐶})
543adant1 1130 . 2 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ {𝐵, 𝐶})
6 breq2 5123 . . . . . 6 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐵𝑅𝐵𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
76notbid 318 . . . . 5 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐵𝑅𝐵 ↔ ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
8 breq2 5123 . . . . . 6 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐵𝑅𝐶𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
98notbid 318 . . . . 5 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐵𝑅𝐶 ↔ ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
10 sonr 5585 . . . . . . 7 ((𝑅 Or 𝐴𝐵𝐴) → ¬ 𝐵𝑅𝐵)
11103adant3 1132 . . . . . 6 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐵𝑅𝐵)
1211adantr 480 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ 𝐵𝑅𝐶) → ¬ 𝐵𝑅𝐵)
13 simpr 484 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ ¬ 𝐵𝑅𝐶) → ¬ 𝐵𝑅𝐶)
147, 9, 12, 13ifbothda 4539 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
15 breq2 5123 . . . . . 6 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐶𝑅𝐵𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
1615notbid 318 . . . . 5 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐶𝑅𝐵 ↔ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
17 breq2 5123 . . . . . 6 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐶𝑅𝐶𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
1817notbid 318 . . . . 5 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐶𝑅𝐶 ↔ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
19 so2nr 5589 . . . . . . . 8 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐵))
20193impb 1114 . . . . . . 7 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐵))
21 imnan 399 . . . . . . 7 ((𝐵𝑅𝐶 → ¬ 𝐶𝑅𝐵) ↔ ¬ (𝐵𝑅𝐶𝐶𝑅𝐵))
2220, 21sylibr 234 . . . . . 6 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → (𝐵𝑅𝐶 → ¬ 𝐶𝑅𝐵))
2322imp 406 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ 𝐵𝑅𝐶) → ¬ 𝐶𝑅𝐵)
24 sonr 5585 . . . . . . 7 ((𝑅 Or 𝐴𝐶𝐴) → ¬ 𝐶𝑅𝐶)
25243adant2 1131 . . . . . 6 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐶𝑅𝐶)
2625adantr 480 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ ¬ 𝐵𝑅𝐶) → ¬ 𝐶𝑅𝐶)
2716, 18, 23, 26ifbothda 4539 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
28 breq1 5122 . . . . . . 7 (𝑦 = 𝐵 → (𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
2928notbid 318 . . . . . 6 (𝑦 = 𝐵 → (¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
30 breq1 5122 . . . . . . 7 (𝑦 = 𝐶 → (𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
3130notbid 318 . . . . . 6 (𝑦 = 𝐶 → (¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
3229, 31ralprg 4672 . . . . 5 ((𝐵𝐴𝐶𝐴) → (∀𝑦 ∈ {𝐵, 𝐶} ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ (¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))))
33323adant1 1130 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → (∀𝑦 ∈ {𝐵, 𝐶} ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ (¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))))
3414, 27, 33mpbir2and 713 . . 3 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ∀𝑦 ∈ {𝐵, 𝐶} ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
3534r19.21bi 3234 . 2 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ 𝑦 ∈ {𝐵, 𝐶}) → ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
361, 3, 5, 35infmin 9508 1 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → inf({𝐵, 𝐶}, 𝐴, 𝑅) = if(𝐵𝑅𝐶, 𝐵, 𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2108  wral 3051  ifcif 4500  {cpr 4603   class class class wbr 5119   Or wor 5560  infcinf 9453
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-po 5561  df-so 5562  df-cnv 5662  df-iota 6484  df-riota 7362  df-sup 9454  df-inf 9455
This theorem is referenced by:  infsupprpr  9518  infsn  9519  liminf10ex  45803  prproropf1olem2  47518  prproropf1olem3  47519  prproropf1olem4  47520
  Copyright terms: Public domain W3C validator