| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > raluz2 | Structured version Visualization version GIF version | ||
| Description: Restricted universal quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005.) |
| Ref | Expression |
|---|---|
| raluz2 | ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)𝜑 ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀 ≤ 𝑛 → 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz2 12757 | . . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) | |
| 2 | 3anass 1094 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛))) | |
| 3 | 1, 2 | bitri 275 | . . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛))) |
| 4 | 3 | imbi1i 349 | . . . 4 ⊢ ((𝑛 ∈ (ℤ≥‘𝑀) → 𝜑) ↔ ((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑)) |
| 5 | impexp 450 | . . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) → 𝜑))) | |
| 6 | impexp 450 | . . . . . . 7 ⊢ (((𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑))) | |
| 7 | 6 | imbi2i 336 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) → 𝜑)) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 8 | 5, 7 | bitri 275 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 9 | bi2.04 387 | . . . . 5 ⊢ ((𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑))) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) | |
| 10 | 8, 9 | bitri 275 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 11 | 4, 10 | bitri 275 | . . 3 ⊢ ((𝑛 ∈ (ℤ≥‘𝑀) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 12 | 11 | ralbii2 3078 | . 2 ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑))) |
| 13 | r19.21v 3161 | . 2 ⊢ (∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)) ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀 ≤ 𝑛 → 𝜑))) | |
| 14 | 12, 13 | bitri 275 | 1 ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)𝜑 ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀 ≤ 𝑛 → 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2113 ∀wral 3051 class class class wbr 5098 ‘cfv 6492 ≤ cle 11167 ℤcz 12488 ℤ≥cuz 12751 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-cnex 11082 ax-resscn 11083 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7361 df-neg 11367 df-z 12489 df-uz 12752 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |