| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infltoreq | Structured version Visualization version GIF version | ||
| Description: The infimum of a finite set is less than or equal to all the elements of the set. (Contributed by AV, 4-Sep-2020.) |
| Ref | Expression |
|---|---|
| infltoreq.1 | ⊢ (𝜑 → 𝑅 Or 𝐴) |
| infltoreq.2 | ⊢ (𝜑 → 𝐵 ⊆ 𝐴) |
| infltoreq.3 | ⊢ (𝜑 → 𝐵 ∈ Fin) |
| infltoreq.4 | ⊢ (𝜑 → 𝐶 ∈ 𝐵) |
| infltoreq.5 | ⊢ (𝜑 → 𝑆 = inf(𝐵, 𝐴, 𝑅)) |
| Ref | Expression |
|---|---|
| infltoreq | ⊢ (𝜑 → (𝑆𝑅𝐶 ∨ 𝐶 = 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | infltoreq.1 | . . . 4 ⊢ (𝜑 → 𝑅 Or 𝐴) | |
| 2 | cnvso 6315 | . . . 4 ⊢ (𝑅 Or 𝐴 ↔ ◡𝑅 Or 𝐴) | |
| 3 | 1, 2 | sylib 221 | . . 3 ⊢ (𝜑 → ◡𝑅 Or 𝐴) |
| 4 | infltoreq.2 | . . 3 ⊢ (𝜑 → 𝐵 ⊆ 𝐴) | |
| 5 | infltoreq.3 | . . 3 ⊢ (𝜑 → 𝐵 ∈ Fin) | |
| 6 | infltoreq.4 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
| 7 | infltoreq.5 | . . . 4 ⊢ (𝜑 → 𝑆 = inf(𝐵, 𝐴, 𝑅)) | |
| 8 | df-inf 9472 | . . . 4 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 9 | 7, 8 | eqtrdi 2814 | . . 3 ⊢ (𝜑 → 𝑆 = sup(𝐵, 𝐴, ◡𝑅)) |
| 10 | 3, 4, 5, 6, 9 | supgtoreq 9500 | . 2 ⊢ (𝜑 → (𝐶◡𝑅𝑆 ∨ 𝐶 = 𝑆)) |
| 11 | 6 | ne0d 4291 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ ∅) |
| 12 | fiinfcl 9532 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ Fin ∧ 𝐵 ≠ ∅ ∧ 𝐵 ⊆ 𝐴)) → inf(𝐵, 𝐴, 𝑅) ∈ 𝐵) | |
| 13 | 1, 5, 11, 4, 12 | syl13anc 1400 | . . . . 5 ⊢ (𝜑 → inf(𝐵, 𝐴, 𝑅) ∈ 𝐵) |
| 14 | 7, 13 | eqeltrd 2864 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝐵) |
| 15 | brcnvg 5869 | . . . . 5 ⊢ ((𝐶 ∈ 𝐵 ∧ 𝑆 ∈ 𝐵) → (𝐶◡𝑅𝑆 ↔ 𝑆𝑅𝐶)) | |
| 16 | 15 | bicomd 226 | . . . 4 ⊢ ((𝐶 ∈ 𝐵 ∧ 𝑆 ∈ 𝐵) → (𝑆𝑅𝐶 ↔ 𝐶◡𝑅𝑆)) |
| 17 | 6, 14, 16 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑆𝑅𝐶 ↔ 𝐶◡𝑅𝑆)) |
| 18 | 17 | orbi1d 930 | . 2 ⊢ (𝜑 → ((𝑆𝑅𝐶 ∨ 𝐶 = 𝑆) ↔ (𝐶◡𝑅𝑆 ∨ 𝐶 = 𝑆))) |
| 19 | 10, 18 | mpbird 260 | 1 ⊢ (𝜑 → (𝑆𝑅𝐶 ∨ 𝐶 = 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ⊆ wss 3900 ∅c0 4281 class class class wbr 5108 Or wor 5565 ◡ccnv 5657 Fincfn 9011 supcsup 9469 infcinf 9470 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-om 7912 df-en 9012 df-fin 9015 df-sup 9471 df-inf 9472 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |