MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axlowdimlem8 Structured version   Visualization version   Unicode version

Theorem axlowdimlem8 25829
Description: Lemma for axlowdim 25841. Calculate the value of  P at three. (Contributed by Scott Fenton, 21-Apr-2013.)
Hypothesis
Ref Expression
axlowdimlem7.1  |-  P  =  ( { <. 3 ,  -u 1 >. }  u.  ( ( ( 1 ... N )  \  { 3 } )  X.  { 0 } ) )
Assertion
Ref Expression
axlowdimlem8  |-  ( P `
 3 )  = 
-u 1

Proof of Theorem axlowdimlem8
StepHypRef Expression
1 axlowdimlem7.1 . . 3  |-  P  =  ( { <. 3 ,  -u 1 >. }  u.  ( ( ( 1 ... N )  \  { 3 } )  X.  { 0 } ) )
21fveq1i 6192 . 2  |-  ( P `
 3 )  =  ( ( { <. 3 ,  -u 1 >. }  u.  ( (
( 1 ... N
)  \  { 3 } )  X.  {
0 } ) ) `
 3 )
3 3re 11094 . . . . 5  |-  3  e.  RR
43elexi 3213 . . . 4  |-  3  e.  _V
5 negex 10279 . . . 4  |-  -u 1  e.  _V
64, 5fnsn 5946 . . 3  |-  { <. 3 ,  -u 1 >. }  Fn  { 3 }
7 c0ex 10034 . . . . 5  |-  0  e.  _V
87fconst 6091 . . . 4  |-  ( ( ( 1 ... N
)  \  { 3 } )  X.  {
0 } ) : ( ( 1 ... N )  \  {
3 } ) --> { 0 }
9 ffn 6045 . . . 4  |-  ( ( ( ( 1 ... N )  \  {
3 } )  X. 
{ 0 } ) : ( ( 1 ... N )  \  { 3 } ) --> { 0 }  ->  ( ( ( 1 ... N )  \  {
3 } )  X. 
{ 0 } )  Fn  ( ( 1 ... N )  \  { 3 } ) )
108, 9ax-mp 5 . . 3  |-  ( ( ( 1 ... N
)  \  { 3 } )  X.  {
0 } )  Fn  ( ( 1 ... N )  \  {
3 } )
11 disjdif 4040 . . . 4  |-  ( { 3 }  i^i  (
( 1 ... N
)  \  { 3 } ) )  =  (/)
124snid 4208 . . . 4  |-  3  e.  { 3 }
1311, 12pm3.2i 471 . . 3  |-  ( ( { 3 }  i^i  ( ( 1 ... N )  \  {
3 } ) )  =  (/)  /\  3  e.  { 3 } )
14 fvun1 6269 . . 3  |-  ( ( { <. 3 ,  -u
1 >. }  Fn  {
3 }  /\  (
( ( 1 ... N )  \  {
3 } )  X. 
{ 0 } )  Fn  ( ( 1 ... N )  \  { 3 } )  /\  ( ( { 3 }  i^i  (
( 1 ... N
)  \  { 3 } ) )  =  (/)  /\  3  e.  {
3 } ) )  ->  ( ( {
<. 3 ,  -u
1 >. }  u.  (
( ( 1 ... N )  \  {
3 } )  X. 
{ 0 } ) ) `  3 )  =  ( { <. 3 ,  -u 1 >. } `  3 )
)
156, 10, 13, 14mp3an 1424 . 2  |-  ( ( { <. 3 ,  -u
1 >. }  u.  (
( ( 1 ... N )  \  {
3 } )  X. 
{ 0 } ) ) `  3 )  =  ( { <. 3 ,  -u 1 >. } `  3 )
164, 5fvsn 6446 . 2  |-  ( {
<. 3 ,  -u
1 >. } `  3
)  =  -u 1
172, 15, 163eqtri 2648 1  |-  ( P `
 3 )  = 
-u 1
Colors of variables: wff setvar class
Syntax hints:    /\ wa 384    = wceq 1483    e. wcel 1990    \ cdif 3571    u. cun 3572    i^i cin 3573   (/)c0 3915   {csn 4177   <.cop 4183    X. cxp 5112    Fn wfn 5883   -->wf 5884   ` cfv 5888  (class class class)co 6650   RRcr 9935   0cc0 9936   1c1 9937   -ucneg 10267   3c3 11071   ...cfz 12326
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-i2m1 10004  ax-1ne0 10005  ax-rrecex 10008  ax-cnre 10009
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-ov 6653  df-neg 10269  df-2 11079  df-3 11080
This theorem is referenced by:  axlowdimlem16  25837
  Copyright terms: Public domain W3C validator