| 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 44359 | . . . . 5 ⊢ (𝜑 → if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) ⊆ 𝐵) |
| 7 | 6 | sseld 3929 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → 𝑥 ∈ 𝐵)) |
| 8 | 7 | imim1d 83 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 → ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) → (𝑥 ∈ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦))) |
| 9 | 8 | ralimdv2 3171 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦 → ∀𝑥 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦 ∈ 𝐶 𝑥𝑅𝑦)) |
| 10 | 1, 9 | mpd 16 | 1 ⊢ (𝜑 → ∀𝑥 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ⊆ wss 3898 ∅c0 4278 ifcif 4481 {csn 4583 class class class wbr 5102 Or wor 5554 1oc1o 8447 ≺ csdm 8950 Fincfn 8951 supcsup 9410 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-om 7861 df-1o 8454 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-fin 8955 df-sup 9412 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |