| 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 12771 | . . . . . 6 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀 ≤ 𝑛)) | |
| 2 | 3anass 1095 | . . . . . 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 3080 | . 2 ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑))) |
| 13 | r19.21v 3163 | . 2 ⊢ (∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀 ≤ 𝑛 → 𝜑)) ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀 ≤ 𝑛 → 𝜑))) | |
| 14 | 12, 13 | bitri 275 | 1 ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)𝜑 ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀 ≤ 𝑛 → 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 ∀wral 3052 class class class wbr 5100 ‘cfv 6502 ≤ cle 11181 ℤcz 12502 ℤ≥cuz 12765 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pr 5381 ax-cnex 11096 ax-resscn 11097 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-fv 6510 df-ov 7373 df-neg 11381 df-z 12503 df-uz 12766 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |