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

Theorem inflb 9457
Description: An infimum is a lower bound. See also infcl 9456 and infglb 9458. (Contributed by AV, 3-Sep-2020.)
Hypotheses
Ref Expression
infcl.1 (𝜑𝑅 Or 𝐴)
infcl.2 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦𝐴 (𝑥𝑅𝑦 → ∃𝑧𝐵 𝑧𝑅𝑦)))
Assertion
Ref Expression
inflb (𝜑 → (𝐶𝐵 → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅)))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)   𝐶(𝑥, 𝑦, 𝑧)

Proof of Theorem inflb
StepHypRef Expression
1 infcl.1 . . . . . 6 (𝜑𝑅 Or 𝐴)
2 cnvso 6293 . . . . . 6 (𝑅 Or 𝐴𝑅 Or 𝐴)
31, 2sylib 221 . . . . 5 (𝜑𝑅 Or 𝐴)
4 infcl.2 . . . . . 6 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦𝐴 (𝑥𝑅𝑦 → ∃𝑧𝐵 𝑧𝑅𝑦)))
51, 4infcllem 9455 . . . . 5 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
63, 5supub 9426 . . . 4 (𝜑 → (𝐶𝐵 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
76imp 412 . . 3 ((𝜑𝐶𝐵) → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶)
8 df-inf 9410 . . . . . 6 inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, 𝑅)
98a1i 11 . . . . 5 ((𝜑𝐶𝐵) → inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, 𝑅))
109breq2d 5123 . . . 4 ((𝜑𝐶𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
113, 5supcl 9425 . . . . 5 (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐴)
12 brcnvg 5867 . . . . . 6 ((sup(𝐵, 𝐴, 𝑅) ∈ 𝐴𝐶𝐵) → (sup(𝐵, 𝐴, 𝑅)𝑅𝐶𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
1312bicomd 226 . . . . 5 ((sup(𝐵, 𝐴, 𝑅) ∈ 𝐴𝐶𝐵) → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
1411, 13sylan 592 . . . 4 ((𝜑𝐶𝐵) → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
1510, 14bitrd 282 . . 3 ((𝜑𝐶𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
167, 15mtbird 328 . 2 ((𝜑𝐶𝐵) → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅))
1716ex 418 1 (𝜑 → (𝐶𝐵 → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wral 3081  wrex 3091   class class class wbr 5111   Or wor 5570  ccnv 5662  supcsup 9407  infcinf 9408
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-po 5571  df-so 5572  df-cnv 5671  df-iota 6496  df-riota 7376  df-sup 9409  df-inf 9410
This theorem is used by:  infssd  9461  infrelb  12217  infxrlb  13379  infxrge0lb  33181  omssubadd  34757  ballotlemimin  34963  ballotlemfrcn0  34987  wsuclb  36357
  Copyright terms: Public domain W3C validator