| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > om2noseqlt2 | Structured version Visualization version GIF version | ||
| Description: The mapping 𝐺 preserves order. (Contributed by Scott Fenton, 18-Apr-2025.) |
| Ref | Expression |
|---|---|
| om2noseq.1 | ⊢ (𝜑 → 𝐶 ∈ No) |
| om2noseq.2 | ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)) |
| om2noseq.3 | ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω)) |
| Ref | Expression |
|---|---|
| om2noseqlt2 | ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | om2noseq.1 | . . 3 ⊢ (𝜑 → 𝐶 ∈ No) | |
| 2 | om2noseq.2 | . . 3 ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)) | |
| 3 | om2noseq.3 | . . 3 ⊢ (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω)) | |
| 4 | 1, 2, 3 | om2noseqlt 28742 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ∈ 𝐵 → (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 5 | 1, 2, 3 | om2noseqlt 28742 | . . . . 5 ⊢ ((𝜑 ∧ (𝐵 ∈ ω ∧ 𝐴 ∈ ω)) → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) <s (𝐺‘𝐴))) |
| 6 | 5 | ancom2s 663 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) <s (𝐺‘𝐴))) |
| 7 | fveq2 6916 | . . . . 5 ⊢ (𝐵 = 𝐴 → (𝐺‘𝐵) = (𝐺‘𝐴)) | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐵 = 𝐴 → (𝐺‘𝐵) = (𝐺‘𝐴))) |
| 9 | 6, 8 | orim12d 979 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) → ((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)))) |
| 10 | nnon 7917 | . . . . 5 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On) | |
| 11 | nnon 7917 | . . . . 5 ⊢ (𝐴 ∈ ω → 𝐴 ∈ On) | |
| 12 | onsseleq 6430 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 ↔ (𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴))) | |
| 13 | ontri1 6423 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) | |
| 14 | 12, 13 | bitr3d 284 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
| 15 | 10, 11, 14 | syl2anr 609 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
| 16 | 15 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
| 17 | 1, 2, 3 | om2noseqfo 28741 | . . . . . . . 8 ⊢ (𝜑 → 𝐺:ω⟶onto𝑍) |
| 18 | fof 6826 | . . . . . . . 8 ⊢ (𝐺:ω⟶onto𝑍 → 𝐺:ω⟶𝑍) | |
| 19 | 17, 18 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝐺:ω⟶𝑍) |
| 20 | 3, 1 | noseqssno 28737 | . . . . . . 7 ⊢ (𝜑 → 𝑍 ⊆ No) |
| 21 | 19, 20 | fssd 6757 | . . . . . 6 ⊢ (𝜑 → 𝐺:ω⟶No) |
| 22 | 21 | ffvelcdmda 7116 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ ω) → (𝐺‘𝐵) ∈ No) |
| 23 | 22 | adantrl 729 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐺‘𝐵) ∈ No) |
| 24 | 21 | ffvelcdmda 7116 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐺‘𝐴) ∈ No) |
| 25 | 24 | adantrr 730 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐺‘𝐴) ∈ No) |
| 26 | lesloe 28168 | . . . . 5 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No) → ((𝐺‘𝐵) ≤s (𝐺‘𝐴) ↔ ((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)))) | |
| 27 | lenlts 28166 | . . . . 5 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No) → ((𝐺‘𝐵) ≤s (𝐺‘𝐴) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) | |
| 28 | 26, 27 | bitr3d 284 | . . . 4 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No) → (((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 29 | 23, 25, 28 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 30 | 9, 16, 29 | 3imtr3d 296 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (¬ 𝐴 ∈ 𝐵 → ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 31 | 4, 30 | impcon4bid 230 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 class class class wbr 5108 ↦ cmpt 5192 ↾ cres 5660 “ cima 5661 Oncon0 6388 ⟶wf 6562 ⟶ontowfo 6564 ‘cfv 6566 (class class class)co 7451 ωcom 7911 reccrdg 8455 Nocsur 28054 <s clts 28055 ≤s cles 28158 1s c1s 28249 +s cadds 28402 |
| 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-ot 4864 df-uni 4873 df-int 4913 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-se 5612 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-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-oadd 8518 df-nadd 8713 df-no 28057 df-lts 28058 df-bday 28059 df-les 28159 df-slts 28201 df-cuts 28203 df-0s 28250 df-1s 28251 df-made 28270 df-old 28271 df-left 28273 df-right 28274 df-norec2 28392 df-adds 28403 |
| This theorem is used by: om2noseqiso 28745 |
| Copyright terms: Public domain | W3C validator |