| 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 12971 | . . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) | |
| 2 | 3anass 1111 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛))) | |
| 3 | 1, 2 | bitri 278 | . . . . 5 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛))) |
| 4 | 3 | imbi1i 352 | . . . 4 ⊢ ((𝑛 ∈ (ℤ≥‘𝑀) → 𝜑) ↔ ((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑)) |
| 5 | impexp 456 | . . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) → 𝜑))) | |
| 6 | impexp 456 | . . . . . . 7 ⊢ (((𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑))) | |
| 7 | 6 | imbi2i 339 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛) → 𝜑)) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 8 | 5, 7 | bitri 278 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 9 | bi2.04 392 | . . . . 5 ⊢ ((𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑))) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) | |
| 10 | 8, 9 | bitri 278 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 11 | 4, 10 | bitri 278 | . . 3 ⊢ ((𝑛 ∈ (ℤ≥‘𝑀) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)))) |
| 12 | 11 | ralbii2 3104 | . 2 ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑))) |
| 13 | r19.21v 3187 | . 2 ⊢ (∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)) ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀 ≤ 𝑛 → 𝜑))) | |
| 14 | 12, 13 | bitri 278 | 1 ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)𝜑 ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀 ≤ 𝑛 → 𝜑))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2144 ∀wral 3076 class class class wbr 5102 ‘cfv 6538 ≤ cle 11344 ℤcz 12693 ℤ≥cuz 12965 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-cnex 11256 ax-resscn 11257 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-ov 7423 df-neg 11544 df-z 12694 df-uz 12966 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |