| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > frec2uzlt2d | GIF version | ||
| Description: The mapping 𝐺 (see frec2uz0d 10525) 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 10529 | . 2 ⊢ (𝜑 → (𝐴 ∈ 𝐵 → (𝐺‘𝐴) < (𝐺‘𝐵))) |
| 6 | nntri3or 6569 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) | |
| 7 | 3, 4, 6 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) |
| 8 | ax-1 6 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) | |
| 9 | 8 | a1i 9 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 10 | fveq2 5570 | . . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝐺‘𝐴) = (𝐺‘𝐵)) | |
| 11 | 10 | adantl 277 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐺‘𝐴) = (𝐺‘𝐵)) |
| 12 | 11 | breq2d 4055 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ((𝐺‘𝐴) < (𝐺‘𝐴) ↔ (𝐺‘𝐴) < (𝐺‘𝐵))) |
| 13 | 12 | biimpar 297 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) < (𝐺‘𝐴)) |
| 14 | 1, 2, 3 | frec2uzzd 10526 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐺‘𝐴) ∈ ℤ) |
| 15 | 14 | adantr 276 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐺‘𝐴) ∈ ℤ) |
| 16 | 15 | adantr 276 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) ∈ ℤ) |
| 17 | 16 | zred 9477 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) ∈ ℝ) |
| 18 | 17 | ltnrd 8166 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → ¬ (𝐺‘𝐴) < (𝐺‘𝐴)) |
| 19 | 13, 18 | pm2.21dd 621 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → 𝐴 ∈ 𝐵) |
| 20 | 19 | ex 115 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) |
| 21 | 20 | ex 115 | . . . 4 ⊢ (𝜑 → (𝐴 = 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 22 | 1, 2, 4 | frec2uzzd 10526 | . . . . . . . . 9 ⊢ (𝜑 → (𝐺‘𝐵) ∈ ℤ) |
| 23 | 22 | adantr 276 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) ∈ ℤ) |
| 24 | 23 | zred 9477 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) ∈ ℝ) |
| 25 | 14 | adantr 276 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐴) ∈ ℤ) |
| 26 | 25 | zred 9477 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐴) ∈ ℝ) |
| 27 | 1, 2, 4, 3 | frec2uzltd 10529 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) < (𝐺‘𝐴))) |
| 28 | 27 | imp 124 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) < (𝐺‘𝐴)) |
| 29 | 24, 26, 28 | ltnsymd 8174 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ¬ (𝐺‘𝐴) < (𝐺‘𝐵)) |
| 30 | 29 | pm2.21d 620 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) |
| 31 | 30 | ex 115 | . . . 4 ⊢ (𝜑 → (𝐵 ∈ 𝐴 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 32 | 9, 21, 31 | 3jaod 1316 | . . 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 979 = wceq 1372 ∈ wcel 2175 class class class wbr 4043 ↦ cmpt 4104 ωcom 4636 ‘cfv 5268 (class class class)co 5934 freccfrec 6466 1c1 7908 + caddc 7910 < clt 8089 ℤcz 9354 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-nul 4169 ax-pow 4217 ax-pr 4252 ax-un 4478 ax-setind 4583 ax-iinf 4634 ax-cnex 7998 ax-resscn 7999 ax-1cn 8000 ax-1re 8001 ax-icn 8002 ax-addcl 8003 ax-addrcl 8004 ax-mulcl 8005 ax-addcom 8007 ax-addass 8009 ax-distr 8011 ax-i2m1 8012 ax-0lt1 8013 ax-0id 8015 ax-rnegex 8016 ax-cnre 8018 ax-pre-ltirr 8019 ax-pre-ltwlin 8020 ax-pre-lttrn 8021 ax-pre-ltadd 8023 |
| This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-nul 3460 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-tr 4142 df-id 4338 df-iord 4411 df-on 4413 df-ilim 4414 df-suc 4416 df-iom 4637 df-xp 4679 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-rn 4684 df-res 4685 df-ima 4686 df-iota 5229 df-fun 5270 df-fn 5271 df-f 5272 df-f1 5273 df-fo 5274 df-f1o 5275 df-fv 5276 df-riota 5889 df-ov 5937 df-oprab 5938 df-mpo 5939 df-recs 6381 df-frec 6467 df-pnf 8091 df-mnf 8092 df-xr 8093 df-ltxr 8094 df-le 8095 df-sub 8227 df-neg 8228 df-inn 9019 df-n0 9278 df-z 9355 df-uz 9631 |
| This theorem is referenced by: frec2uzisod 10533 frec2uzled 10555 nninfctlemfo 12280 |
| Copyright terms: Public domain | W3C validator |