| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cutmin | Structured version Visualization version GIF version | ||
| Description: If 𝐵 has a minimum, then the minimum may be used alone in the cut. (Contributed by Scott Fenton, 20-Aug-2025.) |
| Ref | Expression |
|---|---|
| cutmin.1 | ⊢ (𝜑 → 𝐴 <<s 𝐵) |
| cutmin.2 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| cutmin.3 | ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 𝑋 ≤s 𝑦) |
| Ref | Expression |
|---|---|
| cutmin | ⊢ (𝜑 → (𝐴 |s 𝐵) = (𝐴 |s {𝑋})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cutmin.1 | . 2 ⊢ (𝜑 → 𝐴 <<s 𝐵) | |
| 2 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 3 | sltsss1 28210 | . . . . . . 7 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No) | |
| 4 | 1, 3 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ No) |
| 5 | 4 | sselda 3912 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ No) |
| 6 | lesid 28183 | . . . . 5 ⊢ (𝑥 ∈ No → 𝑥 ≤s 𝑥) | |
| 7 | 5, 6 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤s 𝑥) |
| 8 | breq2 5111 | . . . . 5 ⊢ (𝑦 = 𝑥 → (𝑥 ≤s 𝑦 ↔ 𝑥 ≤s 𝑥)) | |
| 9 | 8 | rspcev 3579 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ≤s 𝑥) → ∃𝑦 ∈ 𝐴 𝑥 ≤s 𝑦) |
| 10 | 2, 7, 9 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐴 𝑥 ≤s 𝑦) |
| 11 | 10 | ralrimiva 3161 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≤s 𝑦) |
| 12 | cutmin.3 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 𝑋 ≤s 𝑦) | |
| 13 | cutmin.2 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 14 | breq1 5110 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ≤s 𝑦 ↔ 𝑋 ≤s 𝑦)) | |
| 15 | 14 | rexsng 4637 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → (∃𝑥 ∈ {𝑋}𝑥 ≤s 𝑦 ↔ 𝑋 ≤s 𝑦)) |
| 16 | 13, 15 | syl 18 | . . . 4 ⊢ (𝜑 → (∃𝑥 ∈ {𝑋}𝑥 ≤s 𝑦 ↔ 𝑋 ≤s 𝑦)) |
| 17 | 16 | ralbidv 3192 | . . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ {𝑋}𝑥 ≤s 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑋 ≤s 𝑦)) |
| 18 | 12, 17 | mpbird 260 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ {𝑋}𝑥 ≤s 𝑦) |
| 19 | cutcuts 28226 | . . . 4 ⊢ (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No ∧ 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)) | |
| 20 | 1, 19 | syl 18 | . . 3 ⊢ (𝜑 → ((𝐴 |s 𝐵) ∈ No ∧ 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)) |
| 21 | 20 | simp2d 1162 | . 2 ⊢ (𝜑 → 𝐴 <<s {(𝐴 |s 𝐵)}) |
| 22 | 20 | simp3d 1163 | . . 3 ⊢ (𝜑 → {(𝐴 |s 𝐵)} <<s 𝐵) |
| 23 | 13 | snssd 4748 | . . 3 ⊢ (𝜑 → {𝑋} ⊆ 𝐵) |
| 24 | ssslts2 28219 | . . 3 ⊢ (({(𝐴 |s 𝐵)} <<s 𝐵 ∧ {𝑋} ⊆ 𝐵) → {(𝐴 |s 𝐵)} <<s {𝑋}) | |
| 25 | 22, 23, 24 | syl2anc 596 | . 2 ⊢ (𝜑 → {(𝐴 |s 𝐵)} <<s {𝑋}) |
| 26 | 1, 11, 18, 21, 25 | cofcut1d 28366 | 1 ⊢ (𝜑 → (𝐴 |s 𝐵) = (𝐴 |s {𝑋})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ∀wral 3083 ∃wrex 3093 ⊆ wss 3899 {csn 4587 class class class wbr 5107 (class class class)co 7450 Nocsur 28056 ≤s cles 28160 <<s cslts 28202 |s ccuts 28204 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-int 4912 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-ord 6390 df-on 6391 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-1o 8513 df-2o 8514 df-no 28059 df-lts 28060 df-bday 28061 df-les 28161 df-slts 28203 df-cuts 28205 |
| This theorem is used by: cutminmax 28381 |
| Copyright terms: Public domain | W3C validator |