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

Theorem infpr 9418
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 1137 . 2 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → 𝑅 Or 𝐴)
2 ifcl 4512 . . 3 ((𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝐴)
323adant1 1131 . 2 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ 𝐴)
4 ifpr 4637 . . 3 ((𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ {𝐵, 𝐶})
543adant1 1131 . 2 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → if(𝐵𝑅𝐶, 𝐵, 𝐶) ∈ {𝐵, 𝐶})
6 breq2 5089 . . . . . 6 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐵𝑅𝐵𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
76notbid 318 . . . . 5 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐵𝑅𝐵 ↔ ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
8 breq2 5089 . . . . . 6 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐵𝑅𝐶𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
98notbid 318 . . . . 5 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐵𝑅𝐶 ↔ ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
10 sonr 5563 . . . . . . 7 ((𝑅 Or 𝐴𝐵𝐴) → ¬ 𝐵𝑅𝐵)
11103adant3 1133 . . . . . 6 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐵𝑅𝐵)
1211adantr 480 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ 𝐵𝑅𝐶) → ¬ 𝐵𝑅𝐵)
13 simpr 484 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ ¬ 𝐵𝑅𝐶) → ¬ 𝐵𝑅𝐶)
147, 9, 12, 13ifbothda 4505 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
15 breq2 5089 . . . . . 6 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐶𝑅𝐵𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
1615notbid 318 . . . . 5 (𝐵 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐶𝑅𝐵 ↔ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
17 breq2 5089 . . . . . 6 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (𝐶𝑅𝐶𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
1817notbid 318 . . . . 5 (𝐶 = if(𝐵𝑅𝐶, 𝐵, 𝐶) → (¬ 𝐶𝑅𝐶 ↔ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
19 so2nr 5567 . . . . . . . 8 ((𝑅 Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐵))
20193impb 1115 . . . . . . 7 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ (𝐵𝑅𝐶𝐶𝑅𝐵))
21 imnan 399 . . . . . . 7 ((𝐵𝑅𝐶 → ¬ 𝐶𝑅𝐵) ↔ ¬ (𝐵𝑅𝐶𝐶𝑅𝐵))
2220, 21sylibr 234 . . . . . 6 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → (𝐵𝑅𝐶 → ¬ 𝐶𝑅𝐵))
2322imp 406 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ 𝐵𝑅𝐶) → ¬ 𝐶𝑅𝐵)
24 sonr 5563 . . . . . . 7 ((𝑅 Or 𝐴𝐶𝐴) → ¬ 𝐶𝑅𝐶)
25243adant2 1132 . . . . . 6 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐶𝑅𝐶)
2625adantr 480 . . . . 5 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ ¬ 𝐵𝑅𝐶) → ¬ 𝐶𝑅𝐶)
2716, 18, 23, 26ifbothda 4505 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
28 breq1 5088 . . . . . . 7 (𝑦 = 𝐵 → (𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
2928notbid 318 . . . . . 6 (𝑦 = 𝐵 → (¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ ¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
30 breq1 5088 . . . . . . 7 (𝑦 = 𝐶 → (𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
3130notbid 318 . . . . . 6 (𝑦 = 𝐶 → (¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶)))
3229, 31ralprg 4640 . . . . 5 ((𝐵𝐴𝐶𝐴) → (∀𝑦 ∈ {𝐵, 𝐶} ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ (¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))))
33323adant1 1131 . . . 4 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → (∀𝑦 ∈ {𝐵, 𝐶} ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ↔ (¬ 𝐵𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶) ∧ ¬ 𝐶𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))))
3414, 27, 33mpbir2and 714 . . 3 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → ∀𝑦 ∈ {𝐵, 𝐶} ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
3534r19.21bi 3229 . 2 (((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) ∧ 𝑦 ∈ {𝐵, 𝐶}) → ¬ 𝑦𝑅if(𝐵𝑅𝐶, 𝐵, 𝐶))
361, 3, 5, 35infmin 9409 1 ((𝑅 Or 𝐴𝐵𝐴𝐶𝐴) → inf({𝐵, 𝐶}, 𝐴, 𝑅) = if(𝐵𝑅𝐶, 𝐵, 𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  ifcif 4466  {cpr 4569   class class class wbr 5085   Or wor 5538  infcinf 9354
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-po 5539  df-so 5540  df-cnv 5639  df-iota 6454  df-riota 7324  df-sup 9355  df-inf 9356
This theorem is referenced by:  infsupprpr  9419  infsn  9420  liminf10ex  46202  prproropf1olem2  47964  prproropf1olem3  47965  prproropf1olem4  47966
  Copyright terms: Public domain W3C validator