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 514 | . . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜒 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
4 | rexanuz3.2 | . . . 4 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
5 | 4 | rexanuz2 14703 | . . 3 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜒 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
6 | 3, 5 | sylibr 236 | . 2 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) |
7 | rexanuz3.1 | . . 3 ⊢ Ⅎ𝑗𝜑 | |
8 | 4 | eleq2i 2904 | . . . . . . . . . 10 ⊢ (𝑗 ∈ 𝑍 ↔ 𝑗 ∈ (ℤ≥‘𝑀)) |
9 | 8 | biimpi 218 | . . . . . . . . 9 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ (ℤ≥‘𝑀)) |
10 | eluzelz 12247 | . . . . . . . . 9 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → 𝑗 ∈ ℤ) | |
11 | uzid 12252 | . . . . . . . . 9 ⊢ (𝑗 ∈ ℤ → 𝑗 ∈ (ℤ≥‘𝑗)) | |
12 | 9, 10, 11 | 3syl 18 | . . . . . . . 8 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ (ℤ≥‘𝑗)) |
13 | 12 | adantr 483 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → 𝑗 ∈ (ℤ≥‘𝑗)) |
14 | simpr 487 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) | |
15 | rexanuz3.5 | . . . . . . . . 9 ⊢ (𝑘 = 𝑗 → (𝜒 ↔ 𝜃)) | |
16 | rexanuz3.6 | . . . . . . . . 9 ⊢ (𝑘 = 𝑗 → (𝜓 ↔ 𝜏)) | |
17 | 15, 16 | anbi12d 632 | . . . . . . . 8 ⊢ (𝑘 = 𝑗 → ((𝜒 ∧ 𝜓) ↔ (𝜃 ∧ 𝜏))) |
18 | 17 | rspcva 3621 | . . . . . . 7 ⊢ ((𝑗 ∈ (ℤ≥‘𝑗) ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → (𝜃 ∧ 𝜏)) |
19 | 13, 14, 18 | syl2anc 586 | . . . . . 6 ⊢ ((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → (𝜃 ∧ 𝜏)) |
20 | 19 | adantll 712 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓)) → (𝜃 ∧ 𝜏)) |
21 | 20 | ex 415 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) → (𝜃 ∧ 𝜏))) |
22 | 21 | ex 415 | . . 3 ⊢ (𝜑 → (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) → (𝜃 ∧ 𝜏)))) |
23 | 7, 22 | reximdai 3311 | . 2 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜒 ∧ 𝜓) → ∃𝑗 ∈ 𝑍 (𝜃 ∧ 𝜏))) |
24 | 6, 23 | mpd 15 | 1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 (𝜃 ∧ 𝜏)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 Ⅎwnf 1780 ∈ wcel 2110 ∀wral 3138 ∃wrex 3139 ‘cfv 6350 ℤcz 11975 ℤ≥cuz 12237 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-pre-lttri 10605 ax-pre-lttrn 10606 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-po 5469 df-so 5470 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-ov 7153 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-neg 10867 df-z 11976 df-uz 12238 |
This theorem is referenced by: smflimlem4 43043 |
Copyright terms: Public domain | W3C validator |