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

Theorem axlowdimlem8 29414
Description: Lemma for axlowdim 29426. Calculate the value of 𝑃 at three. (Contributed by Scott Fenton, 21-Apr-2013.)
Hypothesis
Ref Expression
axlowdimlem7.1 𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))
Assertion
Ref Expression
axlowdimlem8 (𝑃‘3) = -1

Proof of Theorem axlowdimlem8
StepHypRef Expression
1 axlowdimlem7.1 . . 3 𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))
21fveq1i 6883 . 2 (𝑃‘3) = (({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))‘3)
3 3ex 12351 . . . 4 3 ∈ V
4 negex 11483 . . . 4 -1 ∈ V
53, 4fnsn 6595 . . 3 {⟨3, -1⟩} Fn {3}
6 c0ex 11228 . . . . 5 0 ∈ V
76fconst 6765 . . . 4 (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶{0}
8 ffn 6706 . . . 4 ((((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶{0} → (((1...𝑁) ∖ {3}) × {0}) Fn ((1...𝑁) ∖ {3}))
97, 8ax-mp 5 . . 3 (((1...𝑁) ∖ {3}) × {0}) Fn ((1...𝑁) ∖ {3})
10 disjdif 4429 . . . 4 ({3} ∩ ((1...𝑁) ∖ {3})) = ∅
113snid 4626 . . . 4 3 ∈ {3}
1210, 11pm3.2i 476 . . 3 (({3} ∩ ((1...𝑁) ∖ {3})) = ∅ ∧ 3 ∈ {3})
13 fvun1 6973 . . 3 (({⟨3, -1⟩} Fn {3} ∧ (((1...𝑁) ∖ {3}) × {0}) Fn ((1...𝑁) ∖ {3}) ∧ (({3} ∩ ((1...𝑁) ∖ {3})) = ∅ ∧ 3 ∈ {3})) → (({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))‘3) = ({⟨3, -1⟩}‘3))
145, 9, 12, 13mp3an 1490 . 2 (({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))‘3) = ({⟨3, -1⟩}‘3)
153, 4fvsn 7183 . 2 ({⟨3, -1⟩}‘3) = -1
162, 14, 153eqtri 2789 1 (𝑃‘3) = -1
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wcel 2145  cdif 3899  cun 3900  cin 3901  c0 4282  {csn 4587  cop 4593   × cxp 5657   Fn wfn 6532  wf 6533  cfv 6537  (class class class)co 7417  0cc0 11128  1c1 11129  -cneg 11470  3c3 12324  ...cfz 13565
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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-mulcl 11190  ax-i2m1 11196
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7420  df-neg 11472  df-2 12331  df-3 12332
This theorem is used by:  axlowdimlem16  29422
  Copyright terms: Public domain W3C validator