| 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 6297 | . . . 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 9445 | . . . 4 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 9 | 7, 8 | eqtrdi 2814 | . . 3 ⊢ (𝜑 → 𝑆 = sup(𝐵, 𝐴, ◡𝑅)) |
| 10 | 3, 4, 5, 6, 9 | supgtoreq 9473 | . 2 ⊢ (𝜑 → (𝐶◡𝑅𝑆 ∨ 𝐶 = 𝑆)) |
| 11 | 6 | ne0d 4290 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ ∅) |
| 12 | fiinfcl 9505 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ Fin ∧ 𝐵 ≠ ∅ ∧ 𝐵 ⊆ 𝐴)) → inf(𝐵, 𝐴, 𝑅) ∈ 𝐵) | |
| 13 | 1, 5, 11, 4, 12 | syl13anc 1399 | . . . . 5 ⊢ (𝜑 → inf(𝐵, 𝐴, 𝑅) ∈ 𝐵) |
| 14 | 7, 13 | eqeltrd 2863 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝐵) |
| 15 | brcnvg 5861 | . . . . 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 1569 ∈ wcel 2146 ≠ wne 2958 ⊆ wss 3899 ∅c0 4280 class class class wbr 5105 Or wor 5561 ◡ccnv 5653 Fincfn 8984 supcsup 9442 infcinf 9443 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pr 5394 ax-un 7758 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-om 7885 df-en 8985 df-fin 8988 df-sup 9444 df-inf 9445 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |