| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inflb | Structured version Visualization version GIF version | ||
| Description: An infimum is a lower bound. See also infcl 9383 and infglb 9385. (Contributed by AV, 3-Sep-2020.) |
| Ref | Expression |
|---|---|
| infcl.1 | ⊢ (𝜑 → 𝑅 Or 𝐴) |
| infcl.2 | ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦))) |
| Ref | Expression |
|---|---|
| inflb | ⊢ (𝜑 → (𝐶 ∈ 𝐵 → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | infcl.1 | . . . . . 6 ⊢ (𝜑 → 𝑅 Or 𝐴) | |
| 2 | cnvso 6243 | . . . . . 6 ⊢ (𝑅 Or 𝐴 ↔ ◡𝑅 Or 𝐴) | |
| 3 | 1, 2 | sylib 218 | . . . . 5 ⊢ (𝜑 → ◡𝑅 Or 𝐴) |
| 4 | infcl.2 | . . . . . 6 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦))) | |
| 5 | 1, 4 | infcllem 9382 | . . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))) |
| 6 | 3, 5 | supub 9353 | . . . 4 ⊢ (𝜑 → (𝐶 ∈ 𝐵 → ¬ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶)) |
| 7 | 6 | imp 406 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → ¬ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶) |
| 8 | df-inf 9337 | . . . . . 6 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)) |
| 10 | 9 | breq2d 5107 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, ◡𝑅))) |
| 11 | 3, 5 | supcl 9352 | . . . . 5 ⊢ (𝜑 → sup(𝐵, 𝐴, ◡𝑅) ∈ 𝐴) |
| 12 | brcnvg 5826 | . . . . . 6 ⊢ ((sup(𝐵, 𝐴, ◡𝑅) ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶 ↔ 𝐶𝑅sup(𝐵, 𝐴, ◡𝑅))) | |
| 13 | 12 | bicomd 223 | . . . . 5 ⊢ ((sup(𝐵, 𝐴, ◡𝑅) ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐶𝑅sup(𝐵, 𝐴, ◡𝑅) ↔ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶)) |
| 14 | 11, 13 | sylan 580 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → (𝐶𝑅sup(𝐵, 𝐴, ◡𝑅) ↔ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶)) |
| 15 | 10, 14 | bitrd 279 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶)) |
| 16 | 7, 15 | mtbird 325 | . 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅)) |
| 17 | 16 | ex 412 | 1 ⊢ (𝜑 → (𝐶 ∈ 𝐵 → ¬ 𝐶𝑅inf(𝐵, 𝐴, 𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3049 ∃wrex 3058 class class class wbr 5095 Or wor 5528 ◡ccnv 5620 supcsup 9334 infcinf 9335 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4285 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-po 5529 df-so 5530 df-cnv 5629 df-iota 6445 df-riota 7312 df-sup 9336 df-inf 9337 |
| This theorem is referenced by: infssd 9388 infrelb 12117 infxrlb 13244 infxrge0lb 32758 omssubadd 34324 ballotlemimin 34530 ballotlemfrcn0 34554 wsuclb 35881 |
| Copyright terms: Public domain | W3C validator |