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 43398
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 43397 . . . . 5 (𝜑 → if(𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) ⊆ 𝐵)
76sseld 3942 . . . 4 (𝜑 → (𝑥 ∈ if(𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → 𝑥𝐵))
87imim1d 82 . . 3 (𝜑 → ((𝑥𝐵 → ∀𝑦𝐶 𝑥𝑅𝑦) → (𝑥 ∈ if(𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → ∀𝑦𝐶 𝑥𝑅𝑦)))
98ralimdv2 3142 . 2 (𝜑 → (∀𝑥𝐵𝑦𝐶 𝑥𝑅𝑦 → ∀𝑥 ∈ if (𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦𝐶 𝑥𝑅𝑦))
101, 9mpd 15 1 (𝜑 → ∀𝑥 ∈ if (𝑂𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦𝐶 𝑥𝑅𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 847   = wceq 1540  wcel 2109  wral 3044  wss 3911  c0 4292  ifcif 4484  {csn 4585   class class class wbr 5102   Or wor 5538  1oc1o 8404  csdm 8894  Fincfn 8895  supcsup 9367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5103  df-opab 5165  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-om 7823  df-1o 8411  df-er 8648  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-sup 9369
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator