| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > frec2uzled | GIF version | ||
| Description: The mapping 𝐺 (see frec2uz0d 10857) 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 10862 | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) < (𝐺‘𝐵))) |
| 6 | 1, 2 | frec2uzf1od 10864 | . . . . . 6 ⊢ (𝜑 → 𝐺:ω–1-1-onto→(ℤ≥‘𝐶)) |
| 7 | f1of1 5641 | . . . . . 6 ⊢ (𝐺:ω–1-1-onto→(ℤ≥‘𝐶) → 𝐺:ω–1-1→(ℤ≥‘𝐶)) | |
| 8 | 6, 7 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐺:ω–1-1→(ℤ≥‘𝐶)) |
| 9 | f1fveq 5981 | . . . . 5 ⊢ ((𝐺:ω–1-1→(ℤ≥‘𝐶) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐺‘𝐴) = (𝐺‘𝐵) ↔ 𝐴 = 𝐵)) | |
| 10 | 8, 3, 4, 9 | syl12anc 1276 | . . . 4 ⊢ (𝜑 → ((𝐺‘𝐴) = (𝐺‘𝐵) ↔ 𝐴 = 𝐵)) |
| 11 | 10 | bicomd 141 | . . 3 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ (𝐺‘𝐴) = (𝐺‘𝐵))) |
| 12 | 5, 11 | orbi12d 805 | . 2 ⊢ (𝜑 → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ((𝐺‘𝐴) < (𝐺‘𝐵) ∨ (𝐺‘𝐴) = (𝐺‘𝐵)))) |
| 13 | nnsseleq 6778 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 14 | 3, 4, 13 | syl2anc 415 | . 2 ⊢ (𝜑 → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 15 | 1, 2, 3 | frec2uzzd 10858 | . . 3 ⊢ (𝜑 → (𝐺‘𝐴) ∈ ℤ) |
| 16 | 1, 2, 4 | frec2uzzd 10858 | . . 3 ⊢ (𝜑 → (𝐺‘𝐵) ∈ ℤ) |
| 17 | zleloe 9702 | . . 3 ⊢ (((𝐺‘𝐴) ∈ ℤ ∧ (𝐺‘𝐵) ∈ ℤ) → ((𝐺‘𝐴) ≤ (𝐺‘𝐵) ↔ ((𝐺‘𝐴) < (𝐺‘𝐵) ∨ (𝐺‘𝐴) = (𝐺‘𝐵)))) | |
| 18 | 15, 16, 17 | syl2anc 415 | . 2 ⊢ (𝜑 → ((𝐺‘𝐴) ≤ (𝐺‘𝐵) ↔ ((𝐺‘𝐴) < (𝐺‘𝐵) ∨ (𝐺‘𝐴) = (𝐺‘𝐵)))) |
| 19 | 12, 14, 18 | 3bitr4d 220 | 1 ⊢ (𝜑 → (𝐴 ⊆ 𝐵 ↔ (𝐺‘𝐴) ≤ (𝐺‘𝐵))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 105 ∨ wo 720 = wceq 1402 ∈ wcel 2209 ⊆ wss 3220 class class class wbr 4131 ↦ cmpt 4193 ωcom 4739 –1-1→wf1 5377 –1-1-onto→wf1o 5379 ‘cfv 5380 (class class class)co 6088 freccfrec 6665 1c1 8186 + caddc 8188 < clt 8366 ≤ cle 8367 ℤcz 9655 ℤ≥cuz 9937 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-recs 6580 df-frec 6666 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-uz 9938 |
| This theorem is used by: fihashdom 11265 ennnfonelemkh 13361 ctinfomlemom 13376 |
| Copyright terms: Public domain | W3C validator |