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

Theorem inflbti 7001
Description: An infimum is a lower bound. See also infclti 7000 and infglbti 7002. (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 6996 . . . . 5 ((𝜑 ∧ (𝑢𝐴𝑣𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)))
3 infclti.ex . . . . . 6 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦𝐴 (𝑥𝑅𝑦 → ∃𝑧𝐵 𝑧𝑅𝑦)))
43cnvinfex 6995 . . . . 5 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
52, 4supubti 6976 . . . 4 (𝜑 → (𝐶𝐵 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
65imp 123 . . 3 ((𝜑𝐶𝐵) → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶)
7 df-inf 6962 . . . . . 6 inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, 𝑅)
87a1i 9 . . . . 5 ((𝜑𝐶𝐵) → inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, 𝑅))
98breq2d 4001 . . . 4 ((𝜑𝐶𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
102, 4supclti 6975 . . . . 5 (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐴)
11 brcnvg 4792 . . . . . 6 ((sup(𝐵, 𝐴, 𝑅) ∈ 𝐴𝐶𝐵) → (sup(𝐵, 𝐴, 𝑅)𝑅𝐶𝐶𝑅sup(𝐵, 𝐴, 𝑅)))
1211bicomd 140 . . . . 5 ((sup(𝐵, 𝐴, 𝑅) ∈ 𝐴𝐶𝐵) → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
1310, 12sylan 281 . . . 4 ((𝜑𝐶𝐵) → (𝐶𝑅sup(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
149, 13bitrd 187 . . 3 ((𝜑𝐶𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, 𝑅)𝑅𝐶))
156, 14mtbird 668 . 2 ((𝜑𝐶𝐵) → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅))
1615ex 114 1 (𝜑 → (𝐶𝐵 → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104   = wceq 1348  wcel 2141  wral 2448  wrex 2449   class class class wbr 3989  ccnv 4610  supcsup 6959  infcinf 6960
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-cnv 4619  df-iota 5160  df-riota 5809  df-sup 6961  df-inf 6962
This theorem is referenced by:  infregelbex  9557  zssinfcl  11903  infssuzledc  11905
  Copyright terms: Public domain W3C validator