| 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 12689 | . . . . . . 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 3577 | . . . . . . . 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 12679 | . . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
| 14 | 13 | negnegd 11641 | . . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℤ → --𝑥 = 𝑥) |
| 15 | 14 | eqcomd 2767 | . . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℤ → 𝑥 = --𝑥) |
| 16 | negeq 11530 | . . . . . . . . . . . . . 14 ⊢ (𝑦 = -𝑥 → -𝑦 = --𝑥) | |
| 17 | 16 | eqeq2d 2772 | . . . . . . . . . . . . 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 3570 | . . . . . . 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 3131 | . . . 4 ⊢ (∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒) ↔ (∃𝑦 ∈ ℕ0 𝜓 ∨ ∃𝑦 ∈ ℕ0 𝜒)) | |
| 29 | 27, 28 | sylibr 237 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝜑) → ∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒)) |
| 30 | 29 | rexlimiva 3156 | . 2 ⊢ (∃𝑥 ∈ ℤ 𝜑 → ∃𝑦 ∈ ℕ0 (𝜓 ∨ 𝜒)) |
| 31 | nn0z 12698 | . . . . 5 ⊢ (𝑦 ∈ ℕ0 → 𝑦 ∈ ℤ) | |
| 32 | 6 | rspcev 3577 | . . . . 5 ⊢ ((𝑦 ∈ ℤ ∧ 𝜓) → ∃𝑥 ∈ ℤ 𝜑) |
| 33 | 31, 32 | sylan 592 | . . . 4 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝜓) → ∃𝑥 ∈ ℤ 𝜑) |
| 34 | nn0negz 12715 | . . . . 5 ⊢ (𝑦 ∈ ℕ0 → -𝑦 ∈ ℤ) | |
| 35 | 20 | rspcev 3577 | . . . . 5 ⊢ ((-𝑦 ∈ ℤ ∧ 𝜒) → ∃𝑥 ∈ ℤ 𝜑) |
| 36 | 34, 35 | sylan 592 | . . . 4 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝜒) → ∃𝑥 ∈ ℤ 𝜑) |
| 37 | 33, 36 | jaodan 972 | . . 3 ⊢ ((𝑦 ∈ ℕ0 ∧ (𝜓 ∨ 𝜒)) → ∃𝑥 ∈ ℤ 𝜑) |
| 38 | 37 | rexlimiva 3156 | . 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 3087 ℝcr 11180 -cneg 11523 ℕ0cn0 12587 ℤcz 12674 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-ltxr 11329 df-sub 11524 df-neg 11525 df-nn 12317 df-n0 12588 df-z 12675 |
| This theorem is used by: dvdsrabdioph 43770 |
| Copyright terms: Public domain | W3C validator |