| 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 9396 and infglb 9398. (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 6247 | . . . . . 6 ⊢ (𝑅 Or 𝐴 ↔ ◡𝑅 Or 𝐴) | |
| 3 | 1, 2 | sylib 218 | . . . . 5 ⊢ (𝜑 → ◡𝑅 Or 𝐴) |
| 4 | infcl.2 | . . . . . 6 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦))) | |
| 5 | 1, 4 | infcllem 9395 | . . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥◡𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦◡𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦◡𝑅𝑧))) |
| 6 | 3, 5 | supub 9366 | . . . 4 ⊢ (𝜑 → (𝐶 ∈ 𝐵 → ¬ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶)) |
| 7 | 6 | imp 406 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → ¬ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶) |
| 8 | df-inf 9350 | . . . . . 6 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)) |
| 10 | 9 | breq2d 5098 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐵) → (𝐶𝑅inf(𝐵, 𝐴, 𝑅) ↔ 𝐶𝑅sup(𝐵, 𝐴, ◡𝑅))) |
| 11 | 3, 5 | supcl 9365 | . . . . 5 ⊢ (𝜑 → sup(𝐵, 𝐴, ◡𝑅) ∈ 𝐴) |
| 12 | brcnvg 5829 | . . . . . 6 ⊢ ((sup(𝐵, 𝐴, ◡𝑅) ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶 ↔ 𝐶𝑅sup(𝐵, 𝐴, ◡𝑅))) | |
| 13 | 12 | bicomd 223 | . . . . 5 ⊢ ((sup(𝐵, 𝐴, ◡𝑅) ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐶𝑅sup(𝐵, 𝐴, ◡𝑅) ↔ sup(𝐵, 𝐴, ◡𝑅)◡𝑅𝐶)) |
| 14 | 11, 13 | sylan 581 | . . . 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 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 class class class wbr 5086 Or wor 5532 ◡ccnv 5624 supcsup 9347 infcinf 9348 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-po 5533 df-so 5534 df-cnv 5633 df-iota 6449 df-riota 7318 df-sup 9349 df-inf 9350 |
| This theorem is referenced by: infssd 9401 infrelb 12135 infxrlb 13281 infxrge0lb 32855 omssubadd 34463 ballotlemimin 34669 ballotlemfrcn0 34693 wsuclb 36027 |
| Copyright terms: Public domain | W3C validator |