| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > safesnsupfiub | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| safesnsupfiub.small | ⊢ (𝜑 → (𝑂 = ∅ ∨ 𝑂 = 1o)) |
| safesnsupfiub.finite | ⊢ (𝜑 → 𝐵 ∈ Fin) |
| safesnsupfiub.subset | ⊢ (𝜑 → 𝐵 ⊆ 𝐴) |
| safesnsupfiub.ordered | ⊢ (𝜑 → 𝑅 Or 𝐴) |
| safesnsupfiub.ub | ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) |
| Ref | Expression |
|---|---|
| safesnsupfiub | ⊢ (𝜑 → ∀𝑥 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | safesnsupfiub.ub | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) | |
| 2 | safesnsupfiub.small | . . . . . 6 ⊢ (𝜑 → (𝑂 = ∅ ∨ 𝑂 = 1o)) | |
| 3 | safesnsupfiub.finite | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ Fin) | |
| 4 | safesnsupfiub.subset | . . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ 𝐴) | |
| 5 | safesnsupfiub.ordered | . . . . . 6 ⊢ (𝜑 → 𝑅 Or 𝐴) | |
| 6 | 2, 3, 4, 5 | safesnsupfiss 43857 | . . . . 5 ⊢ (𝜑 → if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) ⊆ 𝐵) |
| 7 | 6 | sseld 3921 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → 𝑥 ∈ 𝐵)) |
| 8 | 7 | imim1d 82 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 → ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) → (𝑥 ∈ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦))) |
| 9 | 8 | ralimdv2 3147 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦 → ∀𝑥 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦 ∈ 𝐶 𝑥𝑅𝑦)) |
| 10 | 1, 9 | mpd 15 | 1 ⊢ (𝜑 → ∀𝑥 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ⊆ wss 3890 ∅c0 4274 ifcif 4467 {csn 4568 class class class wbr 5086 Or wor 5529 1oc1o 8389 ≺ csdm 8883 Fincfn 8884 supcsup 9344 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-om 7809 df-1o 8396 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-sup 9346 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |