| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > frec2uzlt2d | GIF version | ||
| Description: The mapping 𝐺 (see frec2uz0d 10651) preserves order. (Contributed by Jim Kingdon, 16-May-2020.) |
| Ref | Expression |
|---|---|
| frec2uz.1 | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| frec2uz.2 | ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) |
| frec2uzzd.a | ⊢ (𝜑 → 𝐴 ∈ ω) |
| frec2uzltd.b | ⊢ (𝜑 → 𝐵 ∈ ω) |
| Ref | Expression |
|---|---|
| frec2uzlt2d | ⊢ (𝜑 → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) < (𝐺‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frec2uz.1 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
| 2 | frec2uz.2 | . . 3 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶) | |
| 3 | frec2uzzd.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ω) | |
| 4 | frec2uzltd.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ω) | |
| 5 | 1, 2, 3, 4 | frec2uzltd 10655 | . 2 ⊢ (𝜑 → (𝐴 ∈ 𝐵 → (𝐺‘𝐴) < (𝐺‘𝐵))) |
| 6 | nntri3or 6656 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) | |
| 7 | 3, 4, 6 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) |
| 8 | ax-1 6 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) | |
| 9 | 8 | a1i 9 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 10 | fveq2 5635 | . . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝐺‘𝐴) = (𝐺‘𝐵)) | |
| 11 | 10 | adantl 277 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐺‘𝐴) = (𝐺‘𝐵)) |
| 12 | 11 | breq2d 4098 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ((𝐺‘𝐴) < (𝐺‘𝐴) ↔ (𝐺‘𝐴) < (𝐺‘𝐵))) |
| 13 | 12 | biimpar 297 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) < (𝐺‘𝐴)) |
| 14 | 1, 2, 3 | frec2uzzd 10652 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐺‘𝐴) ∈ ℤ) |
| 15 | 14 | adantr 276 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐺‘𝐴) ∈ ℤ) |
| 16 | 15 | adantr 276 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) ∈ ℤ) |
| 17 | 16 | zred 9592 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) ∈ ℝ) |
| 18 | 17 | ltnrd 8281 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → ¬ (𝐺‘𝐴) < (𝐺‘𝐴)) |
| 19 | 13, 18 | pm2.21dd 623 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → 𝐴 ∈ 𝐵) |
| 20 | 19 | ex 115 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) |
| 21 | 20 | ex 115 | . . . 4 ⊢ (𝜑 → (𝐴 = 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 22 | 1, 2, 4 | frec2uzzd 10652 | . . . . . . . . 9 ⊢ (𝜑 → (𝐺‘𝐵) ∈ ℤ) |
| 23 | 22 | adantr 276 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) ∈ ℤ) |
| 24 | 23 | zred 9592 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) ∈ ℝ) |
| 25 | 14 | adantr 276 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐴) ∈ ℤ) |
| 26 | 25 | zred 9592 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐴) ∈ ℝ) |
| 27 | 1, 2, 4, 3 | frec2uzltd 10655 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) < (𝐺‘𝐴))) |
| 28 | 27 | imp 124 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) < (𝐺‘𝐴)) |
| 29 | 24, 26, 28 | ltnsymd 8289 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ¬ (𝐺‘𝐴) < (𝐺‘𝐵)) |
| 30 | 29 | pm2.21d 622 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) |
| 31 | 30 | ex 115 | . . . 4 ⊢ (𝜑 → (𝐵 ∈ 𝐴 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 32 | 9, 21, 31 | 3jaod 1338 | . . 3 ⊢ (𝜑 → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 33 | 7, 32 | mpd 13 | . 2 ⊢ (𝜑 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) |
| 34 | 5, 33 | impbid 129 | 1 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ↔ (𝐺‘𝐴) < (𝐺‘𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ w3o 1001 = wceq 1395 ∈ wcel 2200 class class class wbr 4086 ↦ cmpt 4148 ωcom 4686 ‘cfv 5324 (class class class)co 6013 freccfrec 6551 1c1 8023 + caddc 8025 < clt 8204 ℤcz 9469 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-recs 6466 df-frec 6552 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-n0 9393 df-z 9470 df-uz 9746 |
| This theorem is referenced by: frec2uzisod 10659 frec2uzled 10681 nninfctlemfo 12601 |
| Copyright terms: Public domain | W3C validator |