![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > frec2uzled | GIF version |
Description: The mapping 𝐺 (see frec2uz0d 10402) preserves order. (Contributed by Jim Kingdon, 24-Feb-2022.) |
Ref | Expression |
---|---|
frec2uzled.1 | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
frec2uzled.2 | ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) |
frec2uzled.a | ⊢ (𝜑 → 𝐴 ∈ ω) |
frec2uzled.b | ⊢ (𝜑 → 𝐵 ∈ ω) |
Ref | Expression |
---|---|
frec2uzled | ⊢ (𝜑 → (𝐴 ⊆ 𝐵 ↔ (𝐺‘𝐴) ≤ (𝐺‘𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frec2uzled.1 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
2 | frec2uzled.2 | . . . 4 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) | |
3 | frec2uzled.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ω) | |
4 | frec2uzled.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ω) | |
5 | 1, 2, 3, 4 | frec2uzlt2d 10407 | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) < (𝐺‘𝐵))) |
6 | 1, 2 | frec2uzf1od 10409 | . . . . . 6 ⊢ (𝜑 → 𝐺:ω–1-1-onto→(ℤ≥‘𝐶)) |
7 | f1of1 5462 | . . . . . 6 ⊢ (𝐺:ω–1-1-onto→(ℤ≥‘𝐶) → 𝐺:ω–1-1→(ℤ≥‘𝐶)) | |
8 | 6, 7 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐺:ω–1-1→(ℤ≥‘𝐶)) |
9 | f1fveq 5776 | . . . . 5 ⊢ ((𝐺:ω–1-1→(ℤ≥‘𝐶) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐺‘𝐴) = (𝐺‘𝐵) ↔ 𝐴 = 𝐵)) | |
10 | 8, 3, 4, 9 | syl12anc 1236 | . . . 4 ⊢ (𝜑 → ((𝐺‘𝐴) = (𝐺‘𝐵) ↔ 𝐴 = 𝐵)) |
11 | 10 | bicomd 141 | . . 3 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ (𝐺‘𝐴) = (𝐺‘𝐵))) |
12 | 5, 11 | orbi12d 793 | . 2 ⊢ (𝜑 → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ((𝐺‘𝐴) < (𝐺‘𝐵) ∨ (𝐺‘𝐴) = (𝐺‘𝐵)))) |
13 | nnsseleq 6505 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
14 | 3, 4, 13 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
15 | 1, 2, 3 | frec2uzzd 10403 | . . 3 ⊢ (𝜑 → (𝐺‘𝐴) ∈ ℤ) |
16 | 1, 2, 4 | frec2uzzd 10403 | . . 3 ⊢ (𝜑 → (𝐺‘𝐵) ∈ ℤ) |
17 | zleloe 9303 | . . 3 ⊢ (((𝐺‘𝐴) ∈ ℤ ∧ (𝐺‘𝐵) ∈ ℤ) → ((𝐺‘𝐴) ≤ (𝐺‘𝐵) ↔ ((𝐺‘𝐴) < (𝐺‘𝐵) ∨ (𝐺‘𝐴) = (𝐺‘𝐵)))) | |
18 | 15, 16, 17 | syl2anc 411 | . 2 ⊢ (𝜑 → ((𝐺‘𝐴) ≤ (𝐺‘𝐵) ↔ ((𝐺‘𝐴) < (𝐺‘𝐵) ∨ (𝐺‘𝐴) = (𝐺‘𝐵)))) |
19 | 12, 14, 18 | 3bitr4d 220 | 1 ⊢ (𝜑 → (𝐴 ⊆ 𝐵 ↔ (𝐺‘𝐴) ≤ (𝐺‘𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 ∨ wo 708 = wceq 1353 ∈ wcel 2148 ⊆ wss 3131 class class class wbr 4005 ↦ cmpt 4066 ωcom 4591 –1-1→wf1 5215 –1-1-onto→wf1o 5217 ‘cfv 5218 (class class class)co 5878 freccfrec 6394 1c1 7815 + caddc 7817 < clt 7995 ≤ cle 7996 ℤcz 9256 ℤ≥cuz 9531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7905 ax-resscn 7906 ax-1cn 7907 ax-1re 7908 ax-icn 7909 ax-addcl 7910 ax-addrcl 7911 ax-mulcl 7912 ax-addcom 7914 ax-addass 7916 ax-distr 7918 ax-i2m1 7919 ax-0lt1 7920 ax-0id 7922 ax-rnegex 7923 ax-cnre 7925 ax-pre-ltirr 7926 ax-pre-ltwlin 7927 ax-pre-lttrn 7928 ax-pre-ltadd 7930 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-riota 5834 df-ov 5881 df-oprab 5882 df-mpo 5883 df-recs 6309 df-frec 6395 df-pnf 7997 df-mnf 7998 df-xr 7999 df-ltxr 8000 df-le 8001 df-sub 8133 df-neg 8134 df-inn 8923 df-n0 9180 df-z 9257 df-uz 9532 |
This theorem is referenced by: fihashdom 10786 ennnfonelemkh 12416 ctinfomlemom 12431 |
Copyright terms: Public domain | W3C validator |