| 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 28492 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ∈ 𝐵 → (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 5 | 1, 2, 3 | om2noseqlt 28492 | . . . . 5 ⊢ ((𝜑 ∧ (𝐵 ∈ ω ∧ 𝐴 ∈ ω)) → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) <s (𝐺‘𝐴))) |
| 6 | 5 | ancom2s 662 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) <s (𝐺‘𝐴))) |
| 7 | fveq2 6881 | . . . . 5 ⊢ (𝐵 = 𝐴 → (𝐺‘𝐵) = (𝐺‘𝐴)) | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐵 = 𝐴 → (𝐺‘𝐵) = (𝐺‘𝐴))) |
| 9 | 6, 8 | orim12d 979 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) → ((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)))) |
| 10 | nnon 7864 | . . . . 5 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On) | |
| 11 | nnon 7864 | . . . . 5 ⊢ (𝐴 ∈ ω → 𝐴 ∈ On) | |
| 12 | onsseleq 6402 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 ↔ (𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴))) | |
| 13 | ontri1 6395 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) | |
| 14 | 12, 13 | bitr3d 284 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
| 15 | 10, 11, 14 | syl2anr 608 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
| 16 | 15 | adantl 486 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
| 17 | 1, 2, 3 | om2noseqfo 28491 | . . . . . . . 8 ⊢ (𝜑 → 𝐺:ω–onto→𝑍) |
| 18 | fof 6792 | . . . . . . . 8 ⊢ (𝐺:ω–onto→𝑍 → 𝐺:ω⟶𝑍) | |
| 19 | 17, 18 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝐺:ω⟶𝑍) |
| 20 | 3, 1 | noseqssno 28487 | . . . . . . 7 ⊢ (𝜑 → 𝑍 ⊆ No ) |
| 21 | 19, 20 | fssd 6723 | . . . . . 6 ⊢ (𝜑 → 𝐺:ω⟶ No ) |
| 22 | 21 | ffvelcdmda 7079 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ ω) → (𝐺‘𝐵) ∈ No ) |
| 23 | 22 | adantrl 728 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐺‘𝐵) ∈ No ) |
| 24 | 21 | ffvelcdmda 7079 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐺‘𝐴) ∈ No ) |
| 25 | 24 | adantrr 729 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐺‘𝐴) ∈ No ) |
| 26 | lesloe 27918 | . . . . 5 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No ) → ((𝐺‘𝐵) ≤s (𝐺‘𝐴) ↔ ((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)))) | |
| 27 | lenlts 27916 | . . . . 5 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No ) → ((𝐺‘𝐵) ≤s (𝐺‘𝐴) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) | |
| 28 | 26, 27 | bitr3d 284 | . . . 4 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No ) → (((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 29 | 23, 25, 28 | syl2anc 595 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 30 | 9, 16, 29 | 3imtr3d 296 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (¬ 𝐴 ∈ 𝐵 → ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| 31 | 4, 30 | impcon4bid 230 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ⊆ wss 3905 class class class wbr 5109 ↦ cmpt 5192 ↾ cres 5663 “ cima 5664 Oncon0 6360 ⟶wf 6532 –onto→wfo 6534 ‘cfv 6536 (class class class)co 7410 ωcom 7858 reccrdg 8392 No csur 27804 <s clts 27805 ≤s cles 27908 1s c1s 27999 +s cadds 28152 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-ot 4598 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-oadd 8453 df-nadd 8648 df-no 27807 df-lts 27808 df-bday 27809 df-les 27909 df-slts 27951 df-cuts 27953 df-0s 28000 df-1s 28001 df-made 28020 df-old 28021 df-left 28023 df-right 28024 df-norec2 28142 df-adds 28153 |
| This theorem is referenced by: om2noseqiso 28495 |
| Copyright terms: Public domain | W3C validator |