![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rexanuz2 | Structured version Visualization version GIF version |
Description: Combine two different upper integer properties into one. (Contributed by Mario Carneiro, 26-Dec-2013.) |
Ref | Expression |
---|---|
rexuz3.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
Ref | Expression |
---|---|
rexanuz2 | ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluzel2 12880 | . . . . 5 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
2 | rexuz3.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
3 | 1, 2 | eleq2s 2856 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → 𝑀 ∈ ℤ) |
4 | 3 | a1d 25 | . . 3 ⊢ (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) → 𝑀 ∈ ℤ)) |
5 | 4 | rexlimiv 3145 | . 2 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) → 𝑀 ∈ ℤ) |
6 | 3 | a1d 25 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 → 𝑀 ∈ ℤ)) |
7 | 6 | rexlimiv 3145 | . . 3 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 → 𝑀 ∈ ℤ) |
8 | 7 | adantr 480 | . 2 ⊢ ((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → 𝑀 ∈ ℤ) |
9 | 2 | rexuz3 15383 | . . 3 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))) |
10 | rexanuz 15380 | . . . 4 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) | |
11 | 2 | rexuz3 15383 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)) |
12 | 2 | rexuz3 15383 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
13 | 11, 12 | anbi12d 632 | . . . 4 ⊢ (𝑀 ∈ ℤ → ((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))) |
14 | 10, 13 | bitr4id 290 | . . 3 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))) |
15 | 9, 14 | bitrd 279 | . 2 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))) |
16 | 5, 8, 15 | pm5.21nii 378 | 1 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1536 ∈ wcel 2105 ∀wral 3058 ∃wrex 3067 ‘cfv 6562 ℤcz 12610 ℤ≥cuz 12875 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-pre-lttri 11226 ax-pre-lttrn 11227 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5582 df-po 5596 df-so 5597 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-ov 7433 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-neg 11492 df-z 12611 df-uz 12876 |
This theorem is referenced by: climuni 15584 2clim 15604 climcn2 15625 lmmo 23403 txlm 23671 cmetcaulem 25335 iscmet3lem2 25339 ulmdvlem3 26459 rexanuz3 45035 fnlimabslt 45634 liminflimsupclim 45762 liminflimsupxrre 45772 stoweidlem7 45962 smflimlem3 46728 |
Copyright terms: Public domain | W3C validator |