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

Theorem inflb 9519
Description: An infimum is a lower bound. See also infcl 9518 and infglb 9520. (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 6315 . . . . . 6 (𝑅 Or 𝐴 ↔ ◡𝑅 Or 𝐴)
31, 2sylib 221 . . . . 5 (𝜑 → ◡𝑅 Or 𝐴)
4 infcl.2 . . . . . 6 (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦)))
51, 4infcllem 9517 . . . . 5 (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧)))
63, 5supub 9488 . . . 4 (𝜑 → (𝐶 ∈ 𝐵 → ¬ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶))
76imp 412 . . 3 ((𝜑 ∧ 𝐶 ∈ 𝐵) → ¬ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶)
8 df-inf 9472 . . . . . 6 inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)
98a1i 11 . . . . 5 ((𝜑 ∧ 𝐶 ∈ 𝐵) → inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅))
109breq2d 5120 . . . 4 ((𝜑 ∧ 𝐶 ∈ 𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, ◡𝑅)))
113, 5supcl 9487 . . . . 5 (𝜑 → sup(𝐵, 𝐴, ◡𝑅) ∈ 𝐴)
12 brcnvg 5869 . . . . . 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 2147  ∀wral 3080  ∃wrex 3090   class class class wbr 5108   Or wor 5565  ◡ccnv 5657  supcsup 9469  infcinf 9470
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-po 5566  df-so 5567  df-cnv 5666  df-iota 6520  df-riota 7408  df-sup 9471  df-inf 9472
This theorem is used by:  infssd  9523  infrelb  12342  infxrlb  13505  infxrge0lb  33452  weinflb  33637  omssubadd  35043  ballotlemimin  35249  ballotlemfrcn0  35273  wsuclb  36805
  Copyright terms: Public domain W3C validator