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 12280 | . . . . 5 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
2 | rexuz3.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
3 | 1, 2 | eleq2s 2871 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → 𝑀 ∈ ℤ) |
4 | 3 | a1d 25 | . . 3 ⊢ (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) → 𝑀 ∈ ℤ)) |
5 | 4 | rexlimiv 3205 | . 2 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) → 𝑀 ∈ ℤ) |
6 | 3 | a1d 25 | . . . 4 ⊢ (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 → 𝑀 ∈ ℤ)) |
7 | 6 | rexlimiv 3205 | . . 3 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 → 𝑀 ∈ ℤ) |
8 | 7 | adantr 485 | . 2 ⊢ ((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → 𝑀 ∈ ℤ) |
9 | 2 | rexuz3 14749 | . . 3 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))) |
10 | rexanuz 14746 | . . . 4 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) | |
11 | 2 | rexuz3 14749 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)) |
12 | 2 | rexuz3 14749 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
13 | 11, 12 | anbi12d 634 | . . . 4 ⊢ (𝑀 ∈ ℤ → ((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))) |
14 | 10, 13 | bitr4id 294 | . . 3 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))) |
15 | 9, 14 | bitrd 282 | . 2 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))) |
16 | 5, 8, 15 | pm5.21nii 384 | 1 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1539 ∈ wcel 2112 ∀wral 3071 ∃wrex 3072 ‘cfv 6336 ℤcz 12013 ℤ≥cuz 12275 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-sep 5170 ax-nul 5177 ax-pow 5235 ax-pr 5299 ax-un 7460 ax-cnex 10624 ax-resscn 10625 ax-pre-lttri 10642 ax-pre-lttrn 10643 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-ne 2953 df-nel 3057 df-ral 3076 df-rex 3077 df-rab 3080 df-v 3412 df-sbc 3698 df-csb 3807 df-dif 3862 df-un 3864 df-in 3866 df-ss 3876 df-nul 4227 df-if 4422 df-pw 4497 df-sn 4524 df-pr 4526 df-op 4530 df-uni 4800 df-br 5034 df-opab 5096 df-mpt 5114 df-id 5431 df-po 5444 df-so 5445 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 df-ov 7154 df-er 8300 df-en 8529 df-dom 8530 df-sdom 8531 df-pnf 10708 df-mnf 10709 df-xr 10710 df-ltxr 10711 df-le 10712 df-neg 10904 df-z 12014 df-uz 12276 |
This theorem is referenced by: climuni 14950 2clim 14970 climcn2 14990 lmmo 22073 txlm 22341 cmetcaulem 23981 iscmet3lem2 23985 ulmdvlem3 25089 rexanuz3 42098 fnlimabslt 42680 liminflimsupclim 42808 liminflimsupxrre 42818 stoweidlem7 43008 smflimlem3 43765 |
Copyright terms: Public domain | W3C validator |