| 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 6291 | . . . 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 9435 | . . . 4 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
| 9 | 7, 8 | eqtrdi 2812 | . . 3 ⊢ (𝜑 → 𝑆 = sup(𝐵, 𝐴, ◡𝑅)) |
| 10 | 3, 4, 5, 6, 9 | supgtoreq 9463 | . 2 ⊢ (𝜑 → (𝐶◡𝑅𝑆 ∨ 𝐶 = 𝑆)) |
| 11 | 6 | ne0d 4288 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ ∅) |
| 12 | fiinfcl 9495 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ Fin ∧ 𝐵 ≠ ∅ ∧ 𝐵 ⊆ 𝐴)) → inf(𝐵, 𝐴, 𝑅) ∈ 𝐵) | |
| 13 | 1, 5, 11, 4, 12 | syl13anc 1399 | . . . . 5 ⊢ (𝜑 → inf(𝐵, 𝐴, 𝑅) ∈ 𝐵) |
| 14 | 7, 13 | eqeltrd 2861 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝐵) |
| 15 | brcnvg 5857 | . . . . 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 2145 ≠ wne 2956 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 Or wor 5558 ◡ccnv 5650 Fincfn 8973 supcsup 9432 infcinf 9433 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7751 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-om 7878 df-en 8974 df-fin 8977 df-sup 9434 df-inf 9435 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |