Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > rexanuz3 | Structured version Visualization version GIF version |
Description: Combine two different upper integer properties into one, for a single integer. (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
rexanuz3.1 | ⊢ Ⅎ𝑗𝜑 |
rexanuz3.2 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
rexanuz3.3 | ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜒) |
rexanuz3.4 | ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) |
rexanuz3.5 | ⊢ (𝑘 = 𝑗 → (𝜒 ↔ 𝜃)) |
rexanuz3.6 | ⊢ (𝑘 = 𝑗 → (𝜓 ↔ 𝜏)) |
Ref | Expression |
---|---|
rexanuz3 | ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 (𝜃 ∧ 𝜏)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rexanuz3.3 | . . . 4 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜒) | |
2 | rexanuz3.4 | . . . 4 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) | |
3 | 1, 2 | jca 512 | . . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜒 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
4 | rexanuz3.2 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
5 | 4 | rexanuz2 14697 | . . 3 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜒 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
6 | 3, 5 | sylibr 235 | . 2 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) |
7 | rexanuz3.1 | . . 3 ⊢ Ⅎ𝑗𝜑 | |
8 | 4 | eleq2i 2901 | . . . . . . . . . 10 ⊢ (𝑗 ∈ 𝑍 ↔ 𝑗 ∈ (ℤ≥‘𝑀)) |
9 | 8 | biimpi 217 | . . . . . . . . 9 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ (ℤ≥‘𝑀)) |
10 | eluzelz 12241 | . . . . . . . . 9 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → 𝑗 ∈ ℤ) | |
11 | uzid 12246 | . . . . . . . . 9 ⊢ (𝑗 ∈ ℤ → 𝑗 ∈ (ℤ≥‘𝑗)) | |
12 | 9, 10, 11 | 3syl 18 | . . . . . . . 8 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ (ℤ≥‘𝑗)) |
13 | 12 | adantr 481 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → 𝑗 ∈ (ℤ≥‘𝑗)) |
14 | simpr 485 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) | |
15 | rexanuz3.5 | . . . . . . . . 9 ⊢ (𝑘 = 𝑗 → (𝜒 ↔ 𝜃)) | |
16 | rexanuz3.6 | . . . . . . . . 9 ⊢ (𝑘 = 𝑗 → (𝜓 ↔ 𝜏)) | |
17 | 15, 16 | anbi12d 630 | . . . . . . . 8 ⊢ (𝑘 = 𝑗 → ((𝜒 ∧ 𝜓) ↔ (𝜃 ∧ 𝜏))) |
18 | 17 | rspcva 3618 | . . . . . . 7 ⊢ ((𝑗 ∈ (ℤ≥‘𝑗) ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → (𝜃 ∧ 𝜏)) |
19 | 13, 14, 18 | syl2anc 584 | . . . . . 6 ⊢ ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → (𝜃 ∧ 𝜏)) |
20 | 19 | adantll 710 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → (𝜃 ∧ 𝜏)) |
21 | 20 | ex 413 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) → (𝜃 ∧ 𝜏))) |
22 | 21 | ex 413 | . . 3 ⊢ (𝜑 → (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) → (𝜃 ∧ 𝜏)))) |
23 | 7, 22 | reximdai 3308 | . 2 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) → ∃𝑗 ∈ 𝑍 (𝜃 ∧ 𝜏))) |
24 | 6, 23 | mpd 15 | 1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 (𝜃 ∧ 𝜏)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 Ⅎwnf 1775 ∈ wcel 2105 ∀wral 3135 ∃wrex 3136 ‘cfv 6348 ℤcz 11969 ℤ≥cuz 12231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-pre-lttri 10599 ax-pre-lttrn 10600 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-po 5467 df-so 5468 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-ov 7148 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-neg 10861 df-z 11970 df-uz 12232 |
This theorem is referenced by: smflimlem4 42927 |
Copyright terms: Public domain | W3C validator |