Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  safesnsupfiub Structured version   Visualization version   GIF version

Theorem safesnsupfiub 44004
Description: If 𝐵 is a finite subset of ordered class 𝐴, we can safely create a small subset with the same largest element and upper bound, if any. (Contributed by RP, 1-Sep-2024.)
Hypotheses
Ref Expression
safesnsupfiub.small (𝜑 → (𝑂 = ∅ ∨ 𝑂 = 1o))
safesnsupfiub.finite (𝜑𝐵 ∈ Fin)
safesnsupfiub.subset (𝜑𝐵𝐴)
safesnsupfiub.ordered (𝜑𝑅 Or 𝐴)
safesnsupfiub.ub (𝜑 → ∀𝑥𝐵𝑦𝐶 𝑥𝑅𝑦)
Assertion
Ref Expression
safesnsupfiub (𝜑 → ∀𝑥 ∈ if (𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦𝐶 𝑥𝑅𝑦)
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝑂(𝑥,𝑦)

Proof of Theorem safesnsupfiub
StepHypRef Expression
1 safesnsupfiub.ub . 2 (𝜑 → ∀𝑥𝐵𝑦𝐶 𝑥𝑅𝑦)
2 safesnsupfiub.small . . . . . 6 (𝜑 → (𝑂 = ∅ ∨ 𝑂 = 1o))
3 safesnsupfiub.finite . . . . . 6 (𝜑𝐵 ∈ Fin)
4 safesnsupfiub.subset . . . . . 6 (𝜑𝐵𝐴)
5 safesnsupfiub.ordered . . . . . 6 (𝜑𝑅 Or 𝐴)
62, 3, 4, 5safesnsupfiss 44003 . . . . 5 (𝜑 → if(𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) ⊆ 𝐵)
76sseld 3938 . . . 4 (𝜑 → (𝑥 ∈ if(𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → 𝑥𝐵))
87imim1d 83 . . 3 (𝜑 → ((𝑥𝐵 → ∀𝑦𝐶 𝑥𝑅𝑦) → (𝑥 ∈ if(𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → ∀𝑦𝐶 𝑥𝑅𝑦)))
98ralimdv2 3174 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐶 𝑥𝑅𝑦 → ∀𝑥 ∈ if (𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦𝐶 𝑥𝑅𝑦))
101, 9mpd 16 1 (𝜑 → ∀𝑥 ∈ if (𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦𝐶 𝑥𝑅𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 860   = wceq 1563  wcel 2145  wral 3079  wss 3907  c0 4288  ifcif 4483  {csn 4585   class class class wbr 5105   Or wor 5559  1oc1o 8434  csdm 8930  Fincfn 8931  supcsup 9388
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-om 7851  df-1o 8441  df-er 8682  df-en 8932  df-dom 8933  df-sdom 8934  df-fin 8935  df-sup 9390
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator