![]() |
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 43082 | . . . . 5 ⊢ (𝜑 → if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) ⊆ 𝐵) |
7 | 6 | sseld 3978 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → 𝑥 ∈ 𝐵)) |
8 | 7 | imim1d 82 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 → ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) → (𝑥 ∈ if(𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵) → ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦))) |
9 | 8 | ralimdv2 3153 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑥𝑅𝑦 → ∀𝑥 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦 ∈ 𝐶 𝑥𝑅𝑦)) |
10 | 1, 9 | mpd 15 | 1 ⊢ (𝜑 → ∀𝑥 ∈ if (𝑂 ≺ 𝐵, {sup(𝐵, 𝐴, 𝑅)}, 𝐵)∀𝑦 ∈ 𝐶 𝑥𝑅𝑦) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 845 = wceq 1534 ∈ wcel 2099 ∀wral 3051 ⊆ wss 3947 ∅c0 4325 ifcif 4533 {csn 4633 class class class wbr 5153 Or wor 5593 1oc1o 8489 ≺ csdm 8973 Fincfn 8974 supcsup 9483 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-br 5154 df-opab 5216 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-ord 6379 df-on 6380 df-lim 6381 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-riota 7380 df-om 7877 df-1o 8496 df-er 8734 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-sup 9485 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |