| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nnwos | Structured version Visualization version GIF version | ||
| Description: Well-ordering principle: any nonempty set of positive integers has a least element (schema form). (Contributed by NM, 17-Aug-2001.) |
| Ref | Expression |
|---|---|
| nnwos.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| nnwos | ⊢ (∃𝑥 ∈ ℕ 𝜑 → ∃𝑥 ∈ ℕ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfrab1 3435 | . . 3 ⊢ Ⅎ𝑥{𝑥 ∈ ℕ ∣ 𝜑} | |
| 2 | nfcv 2926 | . . 3 ⊢ Ⅎ𝑦{𝑥 ∈ ℕ ∣ 𝜑} | |
| 3 | 1, 2 | nnwof 13081 | . 2 ⊢ (({𝑥 ∈ ℕ ∣ 𝜑} ⊆ ℕ ∧ {𝑥 ∈ ℕ ∣ 𝜑} ≠ ∅) → ∃𝑥 ∈ {𝑥 ∈ ℕ ∣ 𝜑}∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦) |
| 4 | ssrab2 4008 | . . . 4 ⊢ {𝑥 ∈ ℕ ∣ 𝜑} ⊆ ℕ | |
| 5 | 4 | biantrur 540 | . . 3 ⊢ ({𝑥 ∈ ℕ ∣ 𝜑} ≠ ∅ ↔ ({𝑥 ∈ ℕ ∣ 𝜑} ⊆ ℕ ∧ {𝑥 ∈ ℕ ∣ 𝜑} ≠ ∅)) |
| 6 | rabn0 4342 | . . 3 ⊢ ({𝑥 ∈ ℕ ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ ℕ 𝜑) | |
| 7 | 5, 6 | bitr3i 280 | . 2 ⊢ (({𝑥 ∈ ℕ ∣ 𝜑} ⊆ ℕ ∧ {𝑥 ∈ ℕ ∣ 𝜑} ≠ ∅) ↔ ∃𝑥 ∈ ℕ 𝜑) |
| 8 | df-rex 3091 | . . 3 ⊢ (∃𝑥 ∈ {𝑥 ∈ ℕ ∣ 𝜑}∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦 ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦)) | |
| 9 | rabid 3436 | . . . . 5 ⊢ (𝑥 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑥 ∈ ℕ ∧ 𝜑)) | |
| 10 | df-ral 3081 | . . . . . 6 ⊢ (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦 ↔ ∀𝑦(𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑥 ≤ 𝑦)) | |
| 11 | nnwos.1 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 12 | 11 | elrab 3648 | . . . . . . . . 9 ⊢ (𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ↔ (𝑦 ∈ ℕ ∧ 𝜓)) |
| 13 | 12 | imbi1i 352 | . . . . . . . 8 ⊢ ((𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑥 ≤ 𝑦) ↔ ((𝑦 ∈ ℕ ∧ 𝜓) → 𝑥 ≤ 𝑦)) |
| 14 | impexp 456 | . . . . . . . 8 ⊢ (((𝑦 ∈ ℕ ∧ 𝜓) → 𝑥 ≤ 𝑦) ↔ (𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) | |
| 15 | 13, 14 | bitri 278 | . . . . . . 7 ⊢ ((𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑥 ≤ 𝑦) ↔ (𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) |
| 16 | 15 | albii 1852 | . . . . . 6 ⊢ (∀𝑦(𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑} → 𝑥 ≤ 𝑦) ↔ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) |
| 17 | 10, 16 | bitri 278 | . . . . 5 ⊢ (∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦 ↔ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) |
| 18 | 9, 17 | anbi12i 640 | . . . 4 ⊢ ((𝑥 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦) ↔ ((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦)))) |
| 19 | 18 | exbii 1881 | . . 3 ⊢ (∃𝑥(𝑥 ∈ {𝑥 ∈ ℕ ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦) ↔ ∃𝑥((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦)))) |
| 20 | df-ral 3081 | . . . . . . 7 ⊢ (∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦) ↔ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) | |
| 21 | 20 | anbi2i 635 | . . . . . 6 ⊢ (((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦)) ↔ ((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦)))) |
| 22 | anass 474 | . . . . . 6 ⊢ (((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦)) ↔ (𝑥 ∈ ℕ ∧ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦)))) | |
| 23 | 21, 22 | bitr3i 280 | . . . . 5 ⊢ (((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) ↔ (𝑥 ∈ ℕ ∧ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦)))) |
| 24 | 23 | exbii 1881 | . . . 4 ⊢ (∃𝑥((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) ↔ ∃𝑥(𝑥 ∈ ℕ ∧ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦)))) |
| 25 | df-rex 3091 | . . . 4 ⊢ (∃𝑥 ∈ ℕ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦)) ↔ ∃𝑥(𝑥 ∈ ℕ ∧ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦)))) | |
| 26 | 24, 25 | bitr4i 281 | . . 3 ⊢ (∃𝑥((𝑥 ∈ ℕ ∧ 𝜑) ∧ ∀𝑦(𝑦 ∈ ℕ → (𝜓 → 𝑥 ≤ 𝑦))) ↔ ∃𝑥 ∈ ℕ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦))) |
| 27 | 8, 19, 26 | 3bitri 300 | . 2 ⊢ (∃𝑥 ∈ {𝑥 ∈ ℕ ∣ 𝜑}∀𝑦 ∈ {𝑥 ∈ ℕ ∣ 𝜑}𝑥 ≤ 𝑦 ↔ ∃𝑥 ∈ ℕ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦))) |
| 28 | 3, 7, 27 | 3imtr3i 294 | 1 ⊢ (∃𝑥 ∈ ℕ 𝜑 → ∃𝑥 ∈ ℕ (𝜑 ∧ ∀𝑦 ∈ ℕ (𝜓 → 𝑥 ≤ 𝑦))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 ∃wex 1812 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∅c0 4281 class class class wbr 5108 ≤ cle 11383 ℕcn 12375 |
| 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: indstr 13083 infpnlem2 17133 |
| Copyright terms: Public domain | W3C validator |