| 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 2736 | . . 3 ⊢ (𝑥 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶) | |
| 3 | fisupclrnmpt.c | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 ∈ 𝐴) | |
| 4 | 1, 2, 3 | rnmptssd 45440 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ⊆ 𝐴) |
| 5 | fisupclrnmpt.r | . . 3 ⊢ (𝜑 → 𝑅 Or 𝐴) | |
| 6 | fisupclrnmpt.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ Fin) | |
| 7 | 2 | rnmptfi 45415 | . . . 4 ⊢ (𝐵 ∈ Fin → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin) |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin) |
| 9 | fisupclrnmpt.n | . . . 4 ⊢ (𝜑 → 𝐵 ≠ ∅) | |
| 10 | 1, 3, 2, 9 | rnmptn0 6202 | . . 3 ⊢ (𝜑 → ran (𝑥 ∈ 𝐵 ↦ 𝐶) ≠ ∅) |
| 11 | fisupcl 9373 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ (ran (𝑥 ∈ 𝐵 ↦ 𝐶) ∈ Fin ∧ ran (𝑥 ∈ 𝐵 ↦ 𝐶) ≠ ∅ ∧ ran (𝑥 ∈ 𝐵 ↦ 𝐶) ⊆ 𝐴)) → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ ran (𝑥 ∈ 𝐵 ↦ 𝐶)) | |
| 12 | 5, 8, 10, 4, 11 | syl13anc 1374 | . 2 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ ran (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| 13 | 4, 12 | sseldd 3934 | 1 ⊢ (𝜑 → sup(ran (𝑥 ∈ 𝐵 ↦ 𝐶), 𝐴, 𝑅) ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 Ⅎwnf 1784 ∈ wcel 2113 ≠ wne 2932 ⊆ wss 3901 ∅c0 4285 ↦ cmpt 5179 Or wor 5531 ran crn 5625 Fincfn 8883 supcsup 9343 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-om 7809 df-1st 7933 df-2nd 7934 df-1o 8397 df-en 8884 df-dom 8885 df-fin 8887 df-sup 9345 |
| This theorem is referenced by: uzublem 45674 limsupubuzlem 45956 |
| Copyright terms: Public domain | W3C validator |