| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cutmax | Structured version Visualization version GIF version | ||
| Description: If 𝐴 has a maximum, then the maximum may be used alone in the cut. (Contributed by Scott Fenton, 20-Aug-2025.) |
| Ref | Expression |
|---|---|
| cutmax.1 | ⊢ (𝜑 → 𝐴 <<s 𝐵) |
| cutmax.2 | ⊢ (𝜑 → 𝑋 ∈ 𝐴) |
| cutmax.3 | ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 𝑦 ≤s 𝑋) |
| Ref | Expression |
|---|---|
| cutmax | ⊢ (𝜑 → (𝐴 |s 𝐵) = ({𝑋} |s 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cutmax.1 | . 2 ⊢ (𝜑 → 𝐴 <<s 𝐵) | |
| 2 | cutmax.3 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 𝑦 ≤s 𝑋) | |
| 3 | cutmax.2 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
| 4 | breq2 5112 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑦 ≤s 𝑥 ↔ 𝑦 ≤s 𝑋)) | |
| 5 | 4 | rexsng 4638 | . . . . 5 ⊢ (𝑋 ∈ 𝐴 → (∃𝑥 ∈ {𝑋}𝑦 ≤s 𝑥 ↔ 𝑦 ≤s 𝑋)) |
| 6 | 3, 5 | syl 18 | . . . 4 ⊢ (𝜑 → (∃𝑥 ∈ {𝑋}𝑦 ≤s 𝑥 ↔ 𝑦 ≤s 𝑋)) |
| 7 | 6 | ralbidv 3189 | . . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 ∃𝑥 ∈ {𝑋}𝑦 ≤s 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ≤s 𝑋)) |
| 8 | 2, 7 | mpbird 260 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ {𝑋}𝑦 ≤s 𝑥) |
| 9 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 10 | sltsss2 28209 | . . . . . . 7 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No) | |
| 11 | 1, 10 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ No) |
| 12 | 11 | sselda 3913 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ No) |
| 13 | lesid 28181 | . . . . 5 ⊢ (𝑥 ∈ No → 𝑥 ≤s 𝑥) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ≤s 𝑥) |
| 15 | breq1 5111 | . . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦 ≤s 𝑥 ↔ 𝑥 ≤s 𝑥)) | |
| 16 | 15 | rspcev 3580 | . . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 ≤s 𝑥) → ∃𝑦 ∈ 𝐵 𝑦 ≤s 𝑥) |
| 17 | 9, 14, 16 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 𝑦 ≤s 𝑥) |
| 18 | 17 | ralrimiva 3158 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 𝑦 ≤s 𝑥) |
| 19 | cutcuts 28224 | . . . . 5 ⊢ (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No ∧ 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)) | |
| 20 | 1, 19 | syl 18 | . . . 4 ⊢ (𝜑 → ((𝐴 |s 𝐵) ∈ No ∧ 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)) |
| 21 | 20 | simp2d 1161 | . . 3 ⊢ (𝜑 → 𝐴 <<s {(𝐴 |s 𝐵)}) |
| 22 | 3 | snssd 4749 | . . 3 ⊢ (𝜑 → {𝑋} ⊆ 𝐴) |
| 23 | ssslts1 28216 | . . 3 ⊢ ((𝐴 <<s {(𝐴 |s 𝐵)} ∧ {𝑋} ⊆ 𝐴) → {𝑋} <<s {(𝐴 |s 𝐵)}) | |
| 24 | 21, 22, 23 | syl2anc 596 | . 2 ⊢ (𝜑 → {𝑋} <<s {(𝐴 |s 𝐵)}) |
| 25 | 20 | simp3d 1162 | . 2 ⊢ (𝜑 → {(𝐴 |s 𝐵)} <<s 𝐵) |
| 26 | 1, 8, 18, 24, 25 | cofcut1d 28364 | 1 ⊢ (𝜑 → (𝐴 |s 𝐵) = ({𝑋} |s 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 {csn 4588 class class class wbr 5108 (class class class)co 7451 Nocsur 28054 ≤s cles 28158 <<s cslts 28200 |s ccuts 28202 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ord 6391 df-on 6392 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1o 8514 df-2o 8515 df-no 28057 df-lts 28058 df-bday 28059 df-les 28159 df-slts 28201 df-cuts 28203 |
| This theorem is used by: cutminmax 28379 |
| Copyright terms: Public domain | W3C validator |