Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fisupclrnmpt Structured version   Visualization version   GIF version

Theorem fisupclrnmpt 42828
Description: A nonempty finite indexed set contains its supremum. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
fisupclrnmpt.x 𝑥𝜑
fisupclrnmpt.r (𝜑𝑅 Or 𝐴)
fisupclrnmpt.b (𝜑𝐵 ∈ Fin)
fisupclrnmpt.n (𝜑𝐵 ≠ ∅)
fisupclrnmpt.c ((𝜑𝑥𝐵) → 𝐶𝐴)
Assertion
Ref Expression
fisupclrnmpt (𝜑 → sup(ran (𝑥𝐵𝐶), 𝐴, 𝑅) ∈ 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝐶(𝑥)   𝑅(𝑥)

Proof of Theorem fisupclrnmpt
StepHypRef Expression
1 fisupclrnmpt.x . . 3 𝑥𝜑
2 eqid 2738 . . 3 (𝑥𝐵𝐶) = (𝑥𝐵𝐶)
3 fisupclrnmpt.c . . 3 ((𝜑𝑥𝐵) → 𝐶𝐴)
41, 2, 3rnmptssd 42624 . 2 (𝜑 → ran (𝑥𝐵𝐶) ⊆ 𝐴)
5 fisupclrnmpt.r . . 3 (𝜑𝑅 Or 𝐴)
6 fisupclrnmpt.b . . . 4 (𝜑𝐵 ∈ Fin)
72rnmptfi 42596 . . . 4 (𝐵 ∈ Fin → ran (𝑥𝐵𝐶) ∈ Fin)
86, 7syl 17 . . 3 (𝜑 → ran (𝑥𝐵𝐶) ∈ Fin)
9 fisupclrnmpt.n . . . 4 (𝜑𝐵 ≠ ∅)
101, 3, 2, 9rnmptn0 6136 . . 3 (𝜑 → ran (𝑥𝐵𝐶) ≠ ∅)
11 fisupcl 9158 . . 3 ((𝑅 Or 𝐴 ∧ (ran (𝑥𝐵𝐶) ∈ Fin ∧ ran (𝑥𝐵𝐶) ≠ ∅ ∧ ran (𝑥𝐵𝐶) ⊆ 𝐴)) → sup(ran (𝑥𝐵𝐶), 𝐴, 𝑅) ∈ ran (𝑥𝐵𝐶))
125, 8, 10, 4, 11syl13anc 1370 . 2 (𝜑 → sup(ran (𝑥𝐵𝐶), 𝐴, 𝑅) ∈ ran (𝑥𝐵𝐶))
134, 12sseldd 3918 1 (𝜑 → sup(ran (𝑥𝐵𝐶), 𝐴, 𝑅) ∈ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wnf 1787  wcel 2108  wne 2942  wss 3883  c0 4253  cmpt 5153   Or wor 5493  ran crn 5581  Fincfn 8691  supcsup 9129
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-om 7688  df-1st 7804  df-2nd 7805  df-1o 8267  df-er 8456  df-en 8692  df-dom 8693  df-fin 8695  df-sup 9131
This theorem is referenced by:  uzublem  42860  limsupubuzlem  43143
  Copyright terms: Public domain W3C validator