ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  inflbti GIF version

Theorem inflbti 7266
Description: An infimum is a lower bound. See also infclti 7265 and infglbti 7267. (Contributed by Jim Kingdon, 18-Dec-2021.)
Hypotheses
Ref Expression
infclti.ti ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
infclti.ex (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦𝐴 (𝑥𝑅𝑦 → ∃𝑧𝐵 𝑧𝑅𝑦)))
Assertion
Ref Expression
inflbti (𝜑 → (𝐶𝐵 → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅)))
Distinct variable groups:   𝑢,𝐴,𝑣,𝑥,𝑦,𝑧   𝑢,𝐵,𝑣,𝑥,𝑦,𝑧   𝑢,𝑅,𝑣,𝑥,𝑦,𝑧   𝜑,𝑢,𝑣,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐶(𝑥,𝑦,𝑧,𝑣,𝑢)

Proof of Theorem inflbti
StepHypRef Expression
1 infclti.ti . . . . . 6 ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
21cnvti 7261 . . . . 5 ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
3 infclti.ex . . . . . 6 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦𝐴 (𝑥𝑅𝑦 → ∃𝑧𝐵 𝑧𝑅𝑦)))
43cnvinfex 7260 . . . . 5 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
52, 4supubti 7241 . . . 4 (𝜑 → (𝐶𝐵 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
65imp 124 . . 3 ((𝜑𝐶𝐵) → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶)
7 df-inf 7227 . . . . . 6 inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, 𝑅)
87a1i 9 . . . . 5 ((𝜑𝐶𝐵) → inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, 𝑅))
98breq2d 4105 . . . 4 ((𝜑𝐶𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
102, 4supclti 7240 . . . . 5 (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐴)
11 brcnvg 4917 . . . . . 6 ((sup(𝐵, 𝐴, 𝑅) ∈ 𝐴𝐶𝐵) → (sup(𝐵, 𝐴, 𝑅)𝑅𝐶𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
1211bicomd 141 . . . . 5 ((sup(𝐵, 𝐴, 𝑅) ∈ 𝐴𝐶𝐵) → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
1310, 12sylan 283 . . . 4 ((𝜑𝐶𝐵) → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
149, 13bitrd 188 . . 3 ((𝜑𝐶𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
156, 14mtbird 680 . 2 ((𝜑𝐶𝐵) → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅))
1615ex 115 1 (𝜑 → (𝐶𝐵 → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105   = wceq 1398  wcel 2202  wral 2511  wrex 2512   class class class wbr 4093  ccnv 4730  supcsup 7224  infcinf 7225
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-cnv 4739  df-iota 5293  df-riota 5981  df-sup 7226  df-inf 7227
This theorem is referenced by:  infregelbex  9876  zssinfcl  10538  infssuzledc  10540
  Copyright terms: Public domain W3C validator