| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rexzrexnn0 | Structured version Visualization version GIF version | ||
| Description: Rewrite an existential quantification restricted to integers into an existential quantification restricted to naturals. (Contributed by Stefan O'Rear, 11-Oct-2014.) |
| Ref | Expression |
|---|---|
| rexzrexnn0.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| rexzrexnn0.2 | ⊢ (𝑥 = -𝑦 → (𝜑 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| rexzrexnn0 | ⊢ (∃𝑥 ∈ ℤ 𝜑 ↔ ∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elznn0 12634 | . . . . . . 7 ⊢ (𝑥 ∈ ℤ ↔ (𝑥 ∈ ℝ ∧ (𝑥 ∈ ℕ0 ∨ -𝑥 ∈ ℕ0))) | |
| 2 | 1 | simprbi 503 | . . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥 ∈ ℕ0 ∨ -𝑥 ∈ ℕ0)) |
| 3 | 2 | adantr 486 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝜑) → (𝑥 ∈ ℕ0 ∨ -𝑥 ∈ ℕ0)) |
| 4 | simpr 490 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℤ ∧ 𝜑) ∧ 𝑥 ∈ ℕ0) → 𝑥 ∈ ℕ0) | |
| 5 | simplr 781 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℤ ∧ 𝜑) ∧ 𝑥 ∈ ℕ0) → 𝜑) | |
| 6 | rexzrexnn0.1 | . . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 7 | 6 | equcoms 2053 | . . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝜑 ↔ 𝜓)) |
| 8 | 7 | bicomd 226 | . . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝜓 ↔ 𝜑)) |
| 9 | 8 | rspcev 3579 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℕ0 ∧ 𝜑) → ∃𝑦 ∈ ℕ0 𝜓) |
| 10 | 4, 5, 9 | syl2anc 596 | . . . . . . 7 ⊢ (((𝑥 ∈ ℤ ∧ 𝜑) ∧ 𝑥 ∈ ℕ0) → ∃𝑦 ∈ ℕ0 𝜓) |
| 11 | 10 | ex 418 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝜑) → (𝑥 ∈ ℕ0 → ∃𝑦 ∈ ℕ0 𝜓)) |
| 12 | simpr 490 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ -𝑥 ∈ ℕ0) → -𝑥 ∈ ℕ0) | |
| 13 | zcn 12624 | . . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 14 | 13 | negnegd 11588 | . . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℤ → --𝑥 = 𝑥) |
| 15 | 14 | eqcomd 2768 | . . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℤ → 𝑥 = --𝑥) |
| 16 | negeq 11477 | . . . . . . . . . . . . . 14 ⊢ (𝑦 = -𝑥 → -𝑦 = --𝑥) | |
| 17 | 16 | eqeq2d 2773 | . . . . . . . . . . . . 13 ⊢ (𝑦 = -𝑥 → (𝑥 = -𝑦 ↔ 𝑥 = --𝑥)) |
| 18 | 15, 17 | syl5ibrcom 250 | . . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → (𝑦 = -𝑥 → 𝑥 = -𝑦)) |
| 19 | 18 | imp 412 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 = -𝑥) → 𝑥 = -𝑦) |
| 20 | rexzrexnn0.2 | . . . . . . . . . . 11 ⊢ (𝑥 = -𝑦 → (𝜑 ↔ 𝜒)) | |
| 21 | 19, 20 | syl 18 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 = -𝑥) → (𝜑 ↔ 𝜒)) |
| 22 | 21 | bicomd 226 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 = -𝑥) → (𝜒 ↔ 𝜑)) |
| 23 | 22 | adantlr 728 | . . . . . . . 8 ⊢ (((𝑥 ∈ ℤ ∧ -𝑥 ∈ ℕ0) ∧ 𝑦 = -𝑥) → (𝜒 ↔ 𝜑)) |
| 24 | 12, 23 | rspcedv 3572 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ -𝑥 ∈ ℕ0) → (𝜑 → ∃𝑦 ∈ ℕ0 𝜒)) |
| 25 | 24 | impancom 457 | . . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝜑) → (-𝑥 ∈ ℕ0 → ∃𝑦 ∈ ℕ0 𝜒)) |
| 26 | 11, 25 | orim12d 979 | . . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝜑) → ((𝑥 ∈ ℕ0 ∨ -𝑥 ∈ ℕ0) → (∃𝑦 ∈ ℕ0 𝜓 ∨ ∃𝑦 ∈ ℕ0 𝜒))) |
| 27 | 3, 26 | mpd 16 | . . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝜑) → (∃𝑦 ∈ ℕ0 𝜓 ∨ ∃𝑦 ∈ ℕ0 𝜒)) |
| 28 | r19.43 3132 | . . . 4 ⊢ (∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒) ↔ (∃𝑦 ∈ ℕ0 𝜓 ∨ ∃𝑦 ∈ ℕ0 𝜒)) | |
| 29 | 27, 28 | sylibr 237 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝜑) → ∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒)) |
| 30 | 29 | rexlimiva 3157 | . 2 ⊢ (∃𝑥 ∈ ℤ 𝜑 → ∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒)) |
| 31 | nn0z 12643 | . . . . 5 ⊢ (𝑦 ∈ ℕ0 → 𝑦 ∈ ℤ) | |
| 32 | 6 | rspcev 3579 | . . . . 5 ⊢ ((𝑦 ∈ ℤ ∧ 𝜓) → ∃𝑥 ∈ ℤ 𝜑) |
| 33 | 31, 32 | sylan 592 | . . . 4 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝜓) → ∃𝑥 ∈ ℤ 𝜑) |
| 34 | nn0negz 12660 | . . . . 5 ⊢ (𝑦 ∈ ℕ0 → -𝑦 ∈ ℤ) | |
| 35 | 20 | rspcev 3579 | . . . . 5 ⊢ ((-𝑦 ∈ ℤ ∧ 𝜒) → ∃𝑥 ∈ ℤ 𝜑) |
| 36 | 34, 35 | sylan 592 | . . . 4 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝜒) → ∃𝑥 ∈ ℤ 𝜑) |
| 37 | 33, 36 | jaodan 972 | . . 3 ⊢ ((𝑦 ∈ ℕ0 ∧ (𝜓 ∨ 𝜒)) → ∃𝑥 ∈ ℤ 𝜑) |
| 38 | 37 | rexlimiva 3157 | . 2 ⊢ (∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒) → ∃𝑥 ∈ ℤ 𝜑) |
| 39 | 30, 38 | impbii 212 | 1 ⊢ (∃𝑥 ∈ ℤ 𝜑 ↔ ∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∃wrex 3088 ℝcr 11127 -cneg 11470 ℕ0cn0 12532 ℤcz 12619 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-ltxr 11276 df-sub 11471 df-neg 11472 df-nn 12262 df-n0 12533 df-z 12620 |
| This theorem is used by: dvdsrabdioph 43659 |
| Copyright terms: Public domain | W3C validator |