Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > repr0 | Structured version Visualization version GIF version |
Description: There is exactly one representation with no elements (an empty sum), only for 𝑀 = 0. (Contributed by Thierry Arnoux, 2-Dec-2021.) |
Ref | Expression |
---|---|
reprval.a | ⊢ (𝜑 → 𝐴 ⊆ ℕ) |
reprval.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
reprval.s | ⊢ (𝜑 → 𝑆 ∈ ℕ0) |
Ref | Expression |
---|---|
repr0 | ⊢ (𝜑 → (𝐴(repr‘0)𝑀) = if(𝑀 = 0, {∅}, ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reprval.a | . . 3 ⊢ (𝜑 → 𝐴 ⊆ ℕ) | |
2 | reprval.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
3 | 0nn0 12231 | . . . 4 ⊢ 0 ∈ ℕ0 | |
4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → 0 ∈ ℕ0) |
5 | 1, 2, 4 | reprval 32569 | . 2 ⊢ (𝜑 → (𝐴(repr‘0)𝑀) = {𝑐 ∈ (𝐴 ↑m (0..^0)) ∣ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀}) |
6 | fzo0 13392 | . . . . . . . . 9 ⊢ (0..^0) = ∅ | |
7 | 6 | sumeq1i 15391 | . . . . . . . 8 ⊢ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = Σ𝑎 ∈ ∅ (𝑐‘𝑎) |
8 | sum0 15414 | . . . . . . . 8 ⊢ Σ𝑎 ∈ ∅ (𝑐‘𝑎) = 0 | |
9 | 7, 8 | eqtri 2767 | . . . . . . 7 ⊢ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 0 |
10 | 9 | eqeq1i 2744 | . . . . . 6 ⊢ (Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀 ↔ 0 = 𝑀) |
11 | 10 | a1i 11 | . . . . 5 ⊢ (𝑐 = ∅ → (Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀 ↔ 0 = 𝑀)) |
12 | 0ex 5234 | . . . . . . . . 9 ⊢ ∅ ∈ V | |
13 | 12 | snid 4602 | . . . . . . . 8 ⊢ ∅ ∈ {∅} |
14 | nnex 11962 | . . . . . . . . . . 11 ⊢ ℕ ∈ V | |
15 | 14 | a1i 11 | . . . . . . . . . 10 ⊢ (𝜑 → ℕ ∈ V) |
16 | 15, 1 | ssexd 5251 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ V) |
17 | mapdm0 8604 | . . . . . . . . 9 ⊢ (𝐴 ∈ V → (𝐴 ↑m ∅) = {∅}) | |
18 | 16, 17 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 ↑m ∅) = {∅}) |
19 | 13, 18 | eleqtrrid 2847 | . . . . . . 7 ⊢ (𝜑 → ∅ ∈ (𝐴 ↑m ∅)) |
20 | 6 | oveq2i 7279 | . . . . . . 7 ⊢ (𝐴 ↑m (0..^0)) = (𝐴 ↑m ∅) |
21 | 19, 20 | eleqtrrdi 2851 | . . . . . 6 ⊢ (𝜑 → ∅ ∈ (𝐴 ↑m (0..^0))) |
22 | 21 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑀 = 0) → ∅ ∈ (𝐴 ↑m (0..^0))) |
23 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑀 = 0) → 𝑀 = 0) | |
24 | 23 | eqcomd 2745 | . . . . 5 ⊢ ((𝜑 ∧ 𝑀 = 0) → 0 = 𝑀) |
25 | 20, 18 | eqtrid 2791 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴 ↑m (0..^0)) = {∅}) |
26 | 25 | eleq2d 2825 | . . . . . . . 8 ⊢ (𝜑 → (𝑐 ∈ (𝐴 ↑m (0..^0)) ↔ 𝑐 ∈ {∅})) |
27 | 26 | biimpa 476 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → 𝑐 ∈ {∅}) |
28 | elsni 4583 | . . . . . . 7 ⊢ (𝑐 ∈ {∅} → 𝑐 = ∅) | |
29 | 27, 28 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → 𝑐 = ∅) |
30 | 29 | ad4ant13 747 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑀 = 0) ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) ∧ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀) → 𝑐 = ∅) |
31 | 11, 22, 24, 30 | rabeqsnd 30827 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 = 0) → {𝑐 ∈ (𝐴 ↑m (0..^0)) ∣ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀} = {∅}) |
32 | 31 | eqcomd 2745 | . . 3 ⊢ ((𝜑 ∧ 𝑀 = 0) → {∅} = {𝑐 ∈ (𝐴 ↑m (0..^0)) ∣ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀}) |
33 | 9 | a1i 11 | . . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝑀 = 0) ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 0) |
34 | simplr 765 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ 𝑀 = 0) ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → ¬ 𝑀 = 0) | |
35 | 34 | neqned 2951 | . . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝑀 = 0) ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → 𝑀 ≠ 0) |
36 | 35 | necomd 3000 | . . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝑀 = 0) ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → 0 ≠ 𝑀) |
37 | 33, 36 | eqnetrd 3012 | . . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑀 = 0) ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) ≠ 𝑀) |
38 | 37 | neneqd 2949 | . . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑀 = 0) ∧ 𝑐 ∈ (𝐴 ↑m (0..^0))) → ¬ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀) |
39 | 38 | ralrimiva 3109 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑀 = 0) → ∀𝑐 ∈ (𝐴 ↑m (0..^0)) ¬ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀) |
40 | rabeq0 4323 | . . . . 5 ⊢ ({𝑐 ∈ (𝐴 ↑m (0..^0)) ∣ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀} = ∅ ↔ ∀𝑐 ∈ (𝐴 ↑m (0..^0)) ¬ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀) | |
41 | 39, 40 | sylibr 233 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝑀 = 0) → {𝑐 ∈ (𝐴 ↑m (0..^0)) ∣ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀} = ∅) |
42 | 41 | eqcomd 2745 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑀 = 0) → ∅ = {𝑐 ∈ (𝐴 ↑m (0..^0)) ∣ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀}) |
43 | 32, 42 | ifeqda 4500 | . 2 ⊢ (𝜑 → if(𝑀 = 0, {∅}, ∅) = {𝑐 ∈ (𝐴 ↑m (0..^0)) ∣ Σ𝑎 ∈ (0..^0)(𝑐‘𝑎) = 𝑀}) |
44 | 5, 43 | eqtr4d 2782 | 1 ⊢ (𝜑 → (𝐴(repr‘0)𝑀) = if(𝑀 = 0, {∅}, ∅)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1541 ∈ wcel 2109 ∀wral 3065 {crab 3069 Vcvv 3430 ⊆ wss 3891 ∅c0 4261 ifcif 4464 {csn 4566 ‘cfv 6430 (class class class)co 7268 ↑m cmap 8589 0cc0 10855 ℕcn 11956 ℕ0cn0 12216 ℤcz 12302 ..^cfzo 13364 Σcsu 15378 reprcrepr 32567 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-rep 5213 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-inf2 9360 ax-cnex 10911 ax-resscn 10912 ax-1cn 10913 ax-icn 10914 ax-addcl 10915 ax-addrcl 10916 ax-mulcl 10917 ax-mulrcl 10918 ax-mulcom 10919 ax-addass 10920 ax-mulass 10921 ax-distr 10922 ax-i2m1 10923 ax-1ne0 10924 ax-1rid 10925 ax-rnegex 10926 ax-rrecex 10927 ax-cnre 10928 ax-pre-lttri 10929 ax-pre-lttrn 10930 ax-pre-ltadd 10931 ax-pre-mulgt0 10932 ax-pre-sup 10933 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-reu 3072 df-rmo 3073 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4845 df-int 4885 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-tr 5196 df-id 5488 df-eprel 5494 df-po 5502 df-so 5503 df-fr 5543 df-se 5544 df-we 5545 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-pred 6199 df-ord 6266 df-on 6267 df-lim 6268 df-suc 6269 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-isom 6439 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-om 7701 df-1st 7817 df-2nd 7818 df-frecs 8081 df-wrecs 8112 df-recs 8186 df-rdg 8225 df-1o 8281 df-er 8472 df-map 8591 df-en 8708 df-dom 8709 df-sdom 8710 df-fin 8711 df-sup 9162 df-oi 9230 df-card 9681 df-pnf 10995 df-mnf 10996 df-xr 10997 df-ltxr 10998 df-le 10999 df-sub 11190 df-neg 11191 df-div 11616 df-nn 11957 df-2 12019 df-3 12020 df-n0 12217 df-z 12303 df-uz 12565 df-rp 12713 df-fz 13222 df-fzo 13365 df-seq 13703 df-exp 13764 df-hash 14026 df-cj 14791 df-re 14792 df-im 14793 df-sqrt 14927 df-abs 14928 df-clim 15178 df-sum 15379 df-repr 32568 |
This theorem is referenced by: breprexp 32592 |
Copyright terms: Public domain | W3C validator |