| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fisupclrnmpt | Structured version Visualization version GIF version | ||
| Description: A nonempty finite indexed set contains its supremum. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
| Ref | Expression |
|---|---|
| fisupclrnmpt.x | ⊢ Ⅎ𝑥𝜑 |
| fisupclrnmpt.r | ⊢ (𝜑 → 𝑅 Or 𝐴) |
| fisupclrnmpt.b | ⊢ (𝜑 → 𝐵 ∈ Fin) |
| fisupclrnmpt.n | ⊢ (𝜑 → 𝐵 ≠ ∅) |
| fisupclrnmpt.c | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| fisupclrnmpt | ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fisupclrnmpt.x | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 2 | eqid 2739 | . . 3 ⊢ (𝑥 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶) | |
| 3 | fisupclrnmpt.c | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 ∈ 𝐴) | |
| 4 | 1, 2, 3 | rnmptssd 7065 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ⊆ 𝐴) |
| 5 | fisupclrnmpt.r | . . 3 ⊢ (𝜑 → 𝑅 Or 𝐴) | |
| 6 | fisupclrnmpt.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ Fin) | |
| 7 | 2 | rnmptfi 45618 | . . . 4 ⊢ (𝐵 ∈ Fin → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin) |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin) |
| 9 | fisupclrnmpt.n | . . . 4 ⊢ (𝜑 → 𝐵 ≠ ∅) | |
| 10 | 1, 3, 2, 9 | rnmptn0 6195 | . . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ≠ ∅) |
| 11 | fisupcl 9373 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ (ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin ∧ ran (𝑥 ∈ 𝐵 ↦ 𝐶) ≠ ∅ ∧ ran (𝑥 ∈ 𝐵 ↦ 𝐶) ⊆ 𝐴)) → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ ran (𝑥 ∈ 𝐵 ↦ 𝐶)) | |
| 12 | 5, 8, 10, 4, 11 | syl13anc 1380 | . 2 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ ran (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| 13 | 4, 12 | sseldd 3916 | 1 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 Ⅎwnf 1790 ∈ wcel 2119 ≠ wne 2934 ⊆ wss 3883 ∅c0 4261 ↦ cmpt 5153 Or wor 5525 ran crn 5619 Fincfn 8883 supcsup 9343 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-om 7807 df-1st 7931 df-2nd 7932 df-1o 8395 df-en 8884 df-dom 8885 df-fin 8887 df-sup 9345 |
| This theorem is referenced by: uzublem 45873 limsupubuzlem 46155 |
| Copyright terms: Public domain | W3C validator |