| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > frec2uzlt2d | GIF version | ||
| Description: The mapping 𝐺 (see frec2uz0d 10566) 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 10570 | . 2 ⊢ (𝜑 → (𝐴 ∈ 𝐵 → (𝐺‘𝐴) < (𝐺‘𝐵))) |
| 6 | nntri3or 6592 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) | |
| 7 | 3, 4, 6 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)) |
| 8 | ax-1 6 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) | |
| 9 | 8 | a1i 9 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 10 | fveq2 5589 | . . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝐺‘𝐴) = (𝐺‘𝐵)) | |
| 11 | 10 | adantl 277 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐺‘𝐴) = (𝐺‘𝐵)) |
| 12 | 11 | breq2d 4063 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ((𝐺‘𝐴) < (𝐺‘𝐴) ↔ (𝐺‘𝐴) < (𝐺‘𝐵))) |
| 13 | 12 | biimpar 297 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) < (𝐺‘𝐴)) |
| 14 | 1, 2, 3 | frec2uzzd 10567 | . . . . . . . . . . 11 ⊢ (𝜑 → (𝐺‘𝐴) ∈ ℤ) |
| 15 | 14 | adantr 276 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐺‘𝐴) ∈ ℤ) |
| 16 | 15 | adantr 276 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) ∈ ℤ) |
| 17 | 16 | zred 9515 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → (𝐺‘𝐴) ∈ ℝ) |
| 18 | 17 | ltnrd 8204 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → ¬ (𝐺‘𝐴) < (𝐺‘𝐴)) |
| 19 | 13, 18 | pm2.21dd 621 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐴 = 𝐵) ∧ (𝐺‘𝐴) < (𝐺‘𝐵)) → 𝐴 ∈ 𝐵) |
| 20 | 19 | ex 115 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) |
| 21 | 20 | ex 115 | . . . 4 ⊢ (𝜑 → (𝐴 = 𝐵 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 22 | 1, 2, 4 | frec2uzzd 10567 | . . . . . . . . 9 ⊢ (𝜑 → (𝐺‘𝐵) ∈ ℤ) |
| 23 | 22 | adantr 276 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) ∈ ℤ) |
| 24 | 23 | zred 9515 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) ∈ ℝ) |
| 25 | 14 | adantr 276 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐴) ∈ ℤ) |
| 26 | 25 | zred 9515 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐴) ∈ ℝ) |
| 27 | 1, 2, 4, 3 | frec2uzltd 10570 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ 𝐴 → (𝐺‘𝐵) < (𝐺‘𝐴))) |
| 28 | 27 | imp 124 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → (𝐺‘𝐵) < (𝐺‘𝐴)) |
| 29 | 24, 26, 28 | ltnsymd 8212 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ¬ (𝐺‘𝐴) < (𝐺‘𝐵)) |
| 30 | 29 | pm2.21d 620 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵)) |
| 31 | 30 | ex 115 | . . . 4 ⊢ (𝜑 → (𝐵 ∈ 𝐴 → ((𝐺‘𝐴) < (𝐺‘𝐵) → 𝐴 ∈ 𝐵))) |
| 32 | 9, 21, 31 | 3jaod 1317 | . . 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 980 = wceq 1373 ∈ wcel 2177 class class class wbr 4051 ↦ cmpt 4113 ωcom 4646 ‘cfv 5280 (class class class)co 5957 freccfrec 6489 1c1 7946 + caddc 7948 < clt 8127 ℤcz 9392 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4167 ax-sep 4170 ax-nul 4178 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-iinf 4644 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-addcom 8045 ax-addass 8047 ax-distr 8049 ax-i2m1 8050 ax-0lt1 8051 ax-0id 8053 ax-rnegex 8054 ax-cnre 8056 ax-pre-ltirr 8057 ax-pre-ltwlin 8058 ax-pre-lttrn 8059 ax-pre-ltadd 8061 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3857 df-int 3892 df-iun 3935 df-br 4052 df-opab 4114 df-mpt 4115 df-tr 4151 df-id 4348 df-iord 4421 df-on 4423 df-ilim 4424 df-suc 4426 df-iom 4647 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-f1 5285 df-fo 5286 df-f1o 5287 df-fv 5288 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-recs 6404 df-frec 6490 df-pnf 8129 df-mnf 8130 df-xr 8131 df-ltxr 8132 df-le 8133 df-sub 8265 df-neg 8266 df-inn 9057 df-n0 9316 df-z 9393 df-uz 9669 |
| This theorem is referenced by: frec2uzisod 10574 frec2uzled 10596 nninfctlemfo 12436 |
| Copyright terms: Public domain | W3C validator |