| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infdesc | Structured version Visualization version GIF version | ||
| Description: Infinite descent. The hypotheses say that 𝑆 is lower bounded, and that if 𝜓 holds for an integer in 𝑆, it holds for a smaller integer in 𝑆. By infinite descent, eventually we cannot go any smaller, therefore 𝜓 holds for no integer in 𝑆. (Contributed by SN, 20-Aug-2024.) |
| Ref | Expression |
|---|---|
| infdesc.x | ⊢ (𝑦 = 𝑥 → (𝜓 ↔ 𝜒)) |
| infdesc.z | ⊢ (𝑦 = 𝑧 → (𝜓 ↔ 𝜃)) |
| infdesc.s | ⊢ (𝜑 → 𝑆 ⊆ (ℤ≥‘𝑀)) |
| infdesc.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝜒)) → ∃𝑧 ∈ 𝑆 (𝜃 ∧ 𝑧 < 𝑥)) |
| Ref | Expression |
|---|---|
| infdesc | ⊢ (𝜑 → {𝑦 ∈ 𝑆 ∣ 𝜓} = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ne 2960 | . . 3 ⊢ ({𝑦 ∈ 𝑆 ∣ 𝜓} ≠ ∅ ↔ ¬ {𝑦 ∈ 𝑆 ∣ 𝜓} = ∅) | |
| 2 | ssrab2 4008 | . . . . . 6 ⊢ {𝑦 ∈ 𝑆 ∣ 𝜓} ⊆ 𝑆 | |
| 3 | infdesc.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ (ℤ≥‘𝑀)) | |
| 4 | 2, 3 | sstrid 3924 | . . . . 5 ⊢ (𝜑 → {𝑦 ∈ 𝑆 ∣ 𝜓} ⊆ (ℤ≥‘𝑀)) |
| 5 | uzwo 13078 | . . . . 5 ⊢ (({𝑦 ∈ 𝑆 ∣ 𝜓} ⊆ (ℤ≥‘𝑀) ∧ {𝑦 ∈ 𝑆 ∣ 𝜓} ≠ ∅) → ∃𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) | |
| 6 | 4, 5 | sylan 592 | . . . 4 ⊢ ((𝜑 ∧ {𝑦 ∈ 𝑆 ∣ 𝜓} ≠ ∅) → ∃𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) |
| 7 | infdesc.x | . . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝜓 ↔ 𝜒)) | |
| 8 | 7 | elrab 3648 | . . . . . . . . 9 ⊢ (𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ↔ (𝑥 ∈ 𝑆 ∧ 𝜒)) |
| 9 | infdesc.1 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝜒)) → ∃𝑧 ∈ 𝑆 (𝜃 ∧ 𝑧 < 𝑥)) | |
| 10 | uzssre 13027 | . . . . . . . . . . . . . . . . 17 ⊢ (ℤ≥‘𝑀) ⊆ ℝ | |
| 11 | 3, 10 | sstrdi 3925 | . . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑆 ⊆ ℝ) |
| 12 | 11 | adantr 486 | . . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ ℝ) |
| 13 | 12 | sselda 3913 | . . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑧 ∈ 𝑆) → 𝑧 ∈ ℝ) |
| 14 | 11 | sselda 3913 | . . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ ℝ) |
| 15 | 14 | adantr 486 | . . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑧 ∈ 𝑆) → 𝑥 ∈ ℝ) |
| 16 | 13, 15 | ltnled 11496 | . . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑧 ∈ 𝑆) → (𝑧 < 𝑥 ↔ ¬ 𝑥 ≤ 𝑧)) |
| 17 | 16 | anbi2d 642 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑧 ∈ 𝑆) → ((𝜃 ∧ 𝑧 < 𝑥) ↔ (𝜃 ∧ ¬ 𝑥 ≤ 𝑧))) |
| 18 | 17 | rexbidva 3188 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (∃𝑧 ∈ 𝑆 (𝜃 ∧ 𝑧 < 𝑥) ↔ ∃𝑧 ∈ 𝑆 (𝜃 ∧ ¬ 𝑥 ≤ 𝑧))) |
| 19 | 18 | adantrr 730 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝜒)) → (∃𝑧 ∈ 𝑆 (𝜃 ∧ 𝑧 < 𝑥) ↔ ∃𝑧 ∈ 𝑆 (𝜃 ∧ ¬ 𝑥 ≤ 𝑧))) |
| 20 | 9, 19 | mpbid 235 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝜒)) → ∃𝑧 ∈ 𝑆 (𝜃 ∧ ¬ 𝑥 ≤ 𝑧)) |
| 21 | 8, 20 | sylan2b 606 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}) → ∃𝑧 ∈ 𝑆 (𝜃 ∧ ¬ 𝑥 ≤ 𝑧)) |
| 22 | infdesc.z | . . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (𝜓 ↔ 𝜃)) | |
| 23 | 22 | rexrab 3657 | . . . . . . . 8 ⊢ (∃𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ 𝑥 ≤ 𝑧 ↔ ∃𝑧 ∈ 𝑆 (𝜃 ∧ ¬ 𝑥 ≤ 𝑧)) |
| 24 | 21, 23 | sylibr 237 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}) → ∃𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ 𝑥 ≤ 𝑧) |
| 25 | 24 | ralrimiva 3158 | . . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∃𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ 𝑥 ≤ 𝑧) |
| 26 | rexnal 3118 | . . . . . . . 8 ⊢ (∃𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ 𝑥 ≤ 𝑧 ↔ ¬ ∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) | |
| 27 | 26 | ralbii 3112 | . . . . . . 7 ⊢ (∀𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∃𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ 𝑥 ≤ 𝑧 ↔ ∀𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ ∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) |
| 28 | ralnex 3092 | . . . . . . 7 ⊢ (∀𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ ∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧 ↔ ¬ ∃𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) | |
| 29 | 27, 28 | bitri 278 | . . . . . 6 ⊢ (∀𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∃𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓} ¬ 𝑥 ≤ 𝑧 ↔ ¬ ∃𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) |
| 30 | 25, 29 | sylib 221 | . . . . 5 ⊢ (𝜑 → ¬ ∃𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) |
| 31 | 30 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ {𝑦 ∈ 𝑆 ∣ 𝜓} ≠ ∅) → ¬ ∃𝑥 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}∀𝑧 ∈ {𝑦 ∈ 𝑆 ∣ 𝜓}𝑥 ≤ 𝑧) |
| 32 | 6, 31 | pm2.21dd 198 | . . 3 ⊢ ((𝜑 ∧ {𝑦 ∈ 𝑆 ∣ 𝜓} ≠ ∅) → {𝑦 ∈ 𝑆 ∣ 𝜓} = ∅) |
| 33 | 1, 32 | sylan2br 607 | . 2 ⊢ ((𝜑 ∧ ¬ {𝑦 ∈ 𝑆 ∣ 𝜓} = ∅) → {𝑦 ∈ 𝑆 ∣ 𝜓} = ∅) |
| 34 | 33 | pm2.18da 812 | 1 ⊢ (𝜑 → {𝑦 ∈ 𝑆 ∣ 𝜓} = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∅c0 4281 class class class wbr 5108 ‘cfv 6566 ℝcr 11238 < clt 11382 ≤ cle 11383 ℤ≥cuz 13005 |
| 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-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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-nel 3066 df-ral 3081 df-rex 3091 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-op 4841 df-uni 4873 df-iun 4958 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-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 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-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 |
| This theorem is used by: nna4b4nsq 28047 |
| Copyright terms: Public domain | W3C validator |