![]() |
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 28323 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ∈ 𝐵 → (𝐺‘𝐴) <s (𝐺‘𝐵))) |
5 | 1, 2, 3 | om2noseqlt 28323 | . . . . 5 ⊢ ((𝜑 ∧ (𝐵 ∈ ω ∧ 𝐴 ∈ ω)) → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) <s (𝐺‘𝐴))) |
6 | 5 | ancom2s 649 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) <s (𝐺‘𝐴))) |
7 | fveq2 6920 | . . . . 5 ⊢ (𝐵 = 𝐴 → (𝐺‘𝐵) = (𝐺‘𝐴)) | |
8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐵 = 𝐴 → (𝐺‘𝐵) = (𝐺‘𝐴))) |
9 | 6, 8 | orim12d 965 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) → ((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)))) |
10 | nnon 7909 | . . . . 5 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On) | |
11 | nnon 7909 | . . . . 5 ⊢ (𝐴 ∈ ω → 𝐴 ∈ On) | |
12 | onsseleq 6436 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 ↔ (𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴))) | |
13 | ontri1 6429 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) | |
14 | 12, 13 | bitr3d 281 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
15 | 10, 11, 14 | syl2anr 596 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
16 | 15 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ ¬ 𝐴 ∈ 𝐵)) |
17 | 1, 2, 3 | om2noseqfo 28322 | . . . . . . . 8 ⊢ (𝜑 → 𝐺:ω–onto→𝑍) |
18 | fof 6834 | . . . . . . . 8 ⊢ (𝐺:ω–onto→𝑍 → 𝐺:ω⟶𝑍) | |
19 | 17, 18 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐺:ω⟶𝑍) |
20 | 3, 1 | noseqssno 28318 | . . . . . . 7 ⊢ (𝜑 → 𝑍 ⊆ No ) |
21 | 19, 20 | fssd 6764 | . . . . . 6 ⊢ (𝜑 → 𝐺:ω⟶ No ) |
22 | 21 | ffvelcdmda 7118 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ ω) → (𝐺‘𝐵) ∈ No ) |
23 | 22 | adantrl 715 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐺‘𝐵) ∈ No ) |
24 | 21 | ffvelcdmda 7118 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐺‘𝐴) ∈ No ) |
25 | 24 | adantrr 716 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐺‘𝐴) ∈ No ) |
26 | sleloe 27817 | . . . . 5 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No ) → ((𝐺‘𝐵) ≤s (𝐺‘𝐴) ↔ ((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)))) | |
27 | slenlt 27815 | . . . . 5 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No ) → ((𝐺‘𝐵) ≤s (𝐺‘𝐴) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) | |
28 | 26, 27 | bitr3d 281 | . . . 4 ⊢ (((𝐺‘𝐵) ∈ No ∧ (𝐺‘𝐴) ∈ No ) → (((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
29 | 23, 25, 28 | syl2anc 583 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝐺‘𝐵) <s (𝐺‘𝐴) ∨ (𝐺‘𝐵) = (𝐺‘𝐴)) ↔ ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
30 | 9, 16, 29 | 3imtr3d 293 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (¬ 𝐴 ∈ 𝐵 → ¬ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
31 | 4, 30 | impcon4bid 227 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) <s (𝐺‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 846 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ⊆ wss 3976 class class class wbr 5166 ↦ cmpt 5249 ↾ cres 5702 “ cima 5703 Oncon0 6395 ⟶wf 6569 –onto→wfo 6571 ‘cfv 6573 (class class class)co 7448 ωcom 7903 reccrdg 8465 No csur 27702 <s cslt 27703 ≤s csle 27807 1s c1s 27886 +s cadds 28010 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-ot 4657 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-oadd 8526 df-nadd 8722 df-no 27705 df-slt 27706 df-bday 27707 df-sle 27808 df-sslt 27844 df-scut 27846 df-0s 27887 df-1s 27888 df-made 27904 df-old 27905 df-left 27907 df-right 27908 df-norec2 28000 df-adds 28011 |
This theorem is referenced by: om2noseqiso 28326 |
Copyright terms: Public domain | W3C validator |