Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > Mathboxes > sumdc2 | GIF version |
Description: Alternate proof of sumdc 11127, without disjoint variable condition on 𝑁, 𝑥 (longer because the statement is taylored to the proof sumdc 11127). (Contributed by BJ, 19-Feb-2022.) |
Ref | Expression |
---|---|
sumdc2.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
sumdc2.ss | ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑀)) |
sumdc2.dc | ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)DECID 𝑥 ∈ 𝐴) |
sumdc2.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
Ref | Expression |
---|---|
sumdc2 | ⊢ (𝜑 → DECID 𝑁 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sumdc2.ss | . . 3 ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑀)) | |
2 | sumdc2.dc | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝑀)DECID 𝑥 ∈ 𝐴) | |
3 | eleq1 2202 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
4 | 3 | dcbid 823 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (DECID 𝑥 ∈ 𝐴 ↔ DECID 𝑦 ∈ 𝐴)) |
5 | 4 | rspccv 2786 | . . . . . 6 ⊢ (∀𝑥 ∈ (ℤ≥‘𝑀)DECID 𝑥 ∈ 𝐴 → (𝑦 ∈ (ℤ≥‘𝑀) → DECID 𝑦 ∈ 𝐴)) |
6 | exmiddc 821 | . . . . . 6 ⊢ (DECID 𝑦 ∈ 𝐴 → (𝑦 ∈ 𝐴 ∨ ¬ 𝑦 ∈ 𝐴)) | |
7 | 5, 6 | syl6 33 | . . . . 5 ⊢ (∀𝑥 ∈ (ℤ≥‘𝑀)DECID 𝑥 ∈ 𝐴 → (𝑦 ∈ (ℤ≥‘𝑀) → (𝑦 ∈ 𝐴 ∨ ¬ 𝑦 ∈ 𝐴))) |
8 | 2, 7 | syl 14 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ (ℤ≥‘𝑀) → (𝑦 ∈ 𝐴 ∨ ¬ 𝑦 ∈ 𝐴))) |
9 | 8 | decidr 13003 | . . 3 ⊢ (𝜑 → 𝐴 DECIDin (ℤ≥‘𝑀)) |
10 | sumdc2.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
11 | uzdcinzz 13005 | . . . 4 ⊢ (𝑀 ∈ ℤ → (ℤ≥‘𝑀) DECIDin ℤ) | |
12 | 10, 11 | syl 14 | . . 3 ⊢ (𝜑 → (ℤ≥‘𝑀) DECIDin ℤ) |
13 | 1, 9, 12 | decidin 13004 | . 2 ⊢ (𝜑 → 𝐴 DECIDin ℤ) |
14 | sumdc2.n | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
15 | df-dcin 13001 | . . 3 ⊢ (𝐴 DECIDin ℤ ↔ ∀𝑧 ∈ ℤ DECID 𝑧 ∈ 𝐴) | |
16 | nfv 1508 | . . . . . 6 ⊢ Ⅎ𝑧DECID 𝑁 ∈ 𝐴 | |
17 | 16 | rspct 2782 | . . . . 5 ⊢ (∀𝑧(𝑧 = 𝑁 → (DECID 𝑧 ∈ 𝐴 ↔ DECID 𝑁 ∈ 𝐴)) → (𝑁 ∈ ℤ → (∀𝑧 ∈ ℤ DECID 𝑧 ∈ 𝐴 → DECID 𝑁 ∈ 𝐴))) |
18 | eleq1 2202 | . . . . . 6 ⊢ (𝑧 = 𝑁 → (𝑧 ∈ 𝐴 ↔ 𝑁 ∈ 𝐴)) | |
19 | 18 | dcbid 823 | . . . . 5 ⊢ (𝑧 = 𝑁 → (DECID 𝑧 ∈ 𝐴 ↔ DECID 𝑁 ∈ 𝐴)) |
20 | 17, 19 | mpg 1427 | . . . 4 ⊢ (𝑁 ∈ ℤ → (∀𝑧 ∈ ℤ DECID 𝑧 ∈ 𝐴 → DECID 𝑁 ∈ 𝐴)) |
21 | 20 | com12 30 | . . 3 ⊢ (∀𝑧 ∈ ℤ DECID 𝑧 ∈ 𝐴 → (𝑁 ∈ ℤ → DECID 𝑁 ∈ 𝐴)) |
22 | 15, 21 | sylbi 120 | . 2 ⊢ (𝐴 DECIDin ℤ → (𝑁 ∈ ℤ → DECID 𝑁 ∈ 𝐴)) |
23 | 13, 14, 22 | sylc 62 | 1 ⊢ (𝜑 → DECID 𝑁 ∈ 𝐴) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 104 ∨ wo 697 DECID wdc 819 = wceq 1331 ∈ wcel 1480 ∀wral 2416 ⊆ wss 3071 ‘cfv 5123 ℤcz 9054 ℤ≥cuz 9326 DECIDin wdcin 13000 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-ltadd 7736 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-iota 5088 df-fun 5125 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-n0 8978 df-z 9055 df-uz 9327 df-dcin 13001 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |