Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  signsw0glem Structured version   Visualization version   GIF version

Theorem signsw0glem 35061
Description: Neutral element property of . (Contributed by Thierry Arnoux, 9-Sep-2018.)
Hypothesis
Ref Expression
signsw.p = (𝑎 ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏))
Assertion
Ref Expression
signsw0glem 𝑢 ∈ {-1, 0, 1} ((0 𝑢) = 𝑢 ∧ (𝑢 0) = 𝑢)
Distinct variable group:   𝑎,𝑏,𝑢
Allowed substitution hints:   (𝑢, 𝑎, 𝑏)

Proof of Theorem signsw0glem
StepHypRef Expression
1 c0ex 11224 . . . . . 6 0 ∈ V
21tpid2 4731 . . . . 5 0 ∈ {-1, 0, 1}
3 signsw.p . . . . . 6 = (𝑎 ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏))
43signspval 35060 . . . . 5 ((0 ∈ {-1, 0, 1} ∧ 𝑢 ∈ {-1, 0, 1}) → (0 𝑢) = if(𝑢 = 0, 0, 𝑢))
52, 4mpan 703 . . . 4 (𝑢 ∈ {-1, 0, 1} → (0 𝑢) = if(𝑢 = 0, 0, 𝑢))
6 iftrue 4488 . . . . . 6 (𝑢 = 0 → if(𝑢 = 0, 0, 𝑢) = 0)
7 id 23 . . . . . 6 (𝑢 = 0 → 𝑢 = 0)
86, 7eqtr4d 2798 . . . . 5 (𝑢 = 0 → if(𝑢 = 0, 0, 𝑢) = 𝑢)
9 iffalse 4491 . . . . 5 𝑢 = 0 → if(𝑢 = 0, 0, 𝑢) = 𝑢)
108, 9pm2.61i 184 . . . 4 if(𝑢 = 0, 0, 𝑢) = 𝑢
115, 10eqtrdi 2811 . . 3 (𝑢 ∈ {-1, 0, 1} → (0 𝑢) = 𝑢)
123signspval 35060 . . . . 5 ((𝑢 ∈ {-1, 0, 1} ∧ 0 ∈ {-1, 0, 1}) → (𝑢 0) = if(0 = 0, 𝑢, 0))
132, 12mpan2 704 . . . 4 (𝑢 ∈ {-1, 0, 1} → (𝑢 0) = if(0 = 0, 𝑢, 0))
14 eqid 2760 . . . . 5 0 = 0
1514iftruei 4489 . . . 4 if(0 = 0, 𝑢, 0) = 𝑢
1613, 15eqtrdi 2811 . . 3 (𝑢 ∈ {-1, 0, 1} → (𝑢 0) = 𝑢)
1711, 16jca 521 . 2 (𝑢 ∈ {-1, 0, 1} → ((0 𝑢) = 𝑢 ∧ (𝑢 0) = 𝑢))
1817rgen 3078 1 𝑢 ∈ {-1, 0, 1} ((0 𝑢) = 𝑢 ∧ (𝑢 0) = 𝑢)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wcel 2145  wral 3076  ifcif 4482  {ctp 4588  (class class class)co 7413  cmpo 7415  0cc0 11124  1c1 11125  -cneg 11466
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 2732  ax-sep 5251  ax-pr 5398  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-mulcl 11186  ax-i2m1 11192
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418
This theorem is used by:  signsw0g  35064  signswmnd  35065
  Copyright terms: Public domain W3C validator