| 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 2763 | . . 3 ⊢ (𝑥 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶) | |
| 3 | fisupclrnmpt.c | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 ∈ 𝐴) | |
| 4 | 1, 2, 3 | rnmptssd 7119 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ⊆ 𝐴) |
| 5 | fisupclrnmpt.r | . . 3 ⊢ (𝜑 → 𝑅 Or 𝐴) | |
| 6 | fisupclrnmpt.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ Fin) | |
| 7 | 2 | rnmptfi 45889 | . . . 4 ⊢ (𝐵 ∈ Fin → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin) |
| 8 | 6, 7 | syl 18 | . . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin) |
| 9 | fisupclrnmpt.n | . . . 4 ⊢ (𝜑 → 𝐵 ≠ ∅) | |
| 10 | 1, 3, 2, 9 | rnmptn0 6245 | . . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ≠ ∅) |
| 11 | fisupcl 9426 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ (ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin ∧ ran (𝑥 ∈ 𝐵 ↦ 𝐶) ≠ ∅ ∧ ran (𝑥 ∈ 𝐵 ↦ 𝐶) ⊆ 𝐴)) → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ ran (𝑥 ∈ 𝐵 ↦ 𝐶)) | |
| 12 | 5, 8, 10, 4, 11 | syl13anc 1399 | . 2 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ ran (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| 13 | 4, 12 | sseldd 3938 | 1 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 Ⅎwnf 1813 ∈ wcel 2143 ≠ wne 2958 ⊆ wss 3905 ∅c0 4286 ↦ cmpt 5192 Or wor 5568 ran crn 5662 Fincfn 8939 supcsup 9396 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 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 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-om 7859 df-1st 7982 df-2nd 7983 df-1o 8449 df-en 8940 df-dom 8941 df-fin 8943 df-sup 9398 |
| This theorem is referenced by: uzublem 46144 limsupubuzlem 46426 |
| Copyright terms: Public domain | W3C validator |