| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infempty | Structured version Visualization version GIF version | ||
| Description: The infimum of an empty set under a base set which has a unique greatest element is the greatest element of the base set. (Contributed by AV, 4-Sep-2020.) |
| Ref | Expression |
|---|---|
| infempty | ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑋𝑅𝑦) ∧ ∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) → inf(∅, 𝐴, 𝑅) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-inf 9334 | . 2 ⊢ inf(∅, 𝐴, 𝑅) = sup(∅, 𝐴, ◡𝑅) | |
| 2 | cnvso 6240 | . . 3 ⊢ (𝑅 Or 𝐴 ↔ ◡𝑅 Or 𝐴) | |
| 3 | brcnvg 5823 | . . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑦◡𝑅𝑋 ↔ 𝑋𝑅𝑦)) | |
| 4 | 3 | ancoms 458 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦◡𝑅𝑋 ↔ 𝑋𝑅𝑦)) |
| 5 | 4 | bicomd 223 | . . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑋𝑅𝑦 ↔ 𝑦◡𝑅𝑋)) |
| 6 | 5 | notbid 318 | . . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (¬ 𝑋𝑅𝑦 ↔ ¬ 𝑦◡𝑅𝑋)) |
| 7 | 6 | ralbidva 3154 | . . . 4 ⊢ (𝑋 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ¬ 𝑋𝑅𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑋)) |
| 8 | 7 | pm5.32i 574 | . . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑋𝑅𝑦) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑋)) |
| 9 | brcnvg 5823 | . . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦)) | |
| 10 | 9 | ancoms 458 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦)) |
| 11 | 10 | bicomd 223 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑦◡𝑅𝑥)) |
| 12 | 11 | notbid 318 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑦◡𝑅𝑥)) |
| 13 | 12 | ralbidva 3154 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥)) |
| 14 | 13 | reubiia 3354 | . . 3 ⊢ (∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦 ↔ ∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
| 15 | sup0 9358 | . . 3 ⊢ ((◡𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑋) ∧ ∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) → sup(∅, 𝐴, ◡𝑅) = 𝑋) | |
| 16 | 2, 8, 14, 15 | syl3anb 1161 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑋𝑅𝑦) ∧ ∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) → sup(∅, 𝐴, ◡𝑅) = 𝑋) |
| 17 | 1, 16 | eqtrid 2780 | 1 ⊢ ((𝑅 Or 𝐴 ∧ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑋𝑅𝑦) ∧ ∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) → inf(∅, 𝐴, 𝑅) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∀wral 3048 ∃!wreu 3345 ∅c0 4282 class class class wbr 5093 Or wor 5526 ◡ccnv 5618 supcsup 9331 infcinf 9332 |
| 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 5236 ax-nul 5246 ax-pr 5372 |
| 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-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-ss 3915 df-nul 4283 df-if 4475 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-br 5094 df-opab 5156 df-po 5527 df-so 5528 df-cnv 5627 df-iota 6442 df-riota 7309 df-sup 9333 df-inf 9334 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |