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

Theorem xpsfeq 17655
Description: A function on 2o is determined by its values at zero and one. (Contributed by Mario Carneiro, 27-Aug-2015.)
Assertion
Ref Expression
xpsfeq (𝐺 Fn 2o → {⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩} = 𝐺)

Proof of Theorem xpsfeq
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 fvex 6895 . . . 4 (𝐺‘∅) ∈ V
2 fvex 6895 . . . 4 (𝐺‘1o) ∈ V
3 fnpr2o 17649 . . . 4 (((𝐺‘∅) ∈ V ∧ (𝐺‘1o) ∈ V) → {⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩} Fn 2o)
41, 2, 3mp2an 705 . . 3 {⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩} Fn 2o
54a1i 11 . 2 (𝐺 Fn 2o → {⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩} Fn 2o)
6 id 23 . 2 (𝐺 Fn 2o𝐺 Fn 2o)
7 elpri 4611 . . . . 5 (𝑘 ∈ {∅, 1o} → (𝑘 = ∅ ∨ 𝑘 = 1o))
8 df2o3 8467 . . . . 5 2o = {∅, 1o}
97, 8eleq2s 2880 . . . 4 (𝑘 ∈ 2o → (𝑘 = ∅ ∨ 𝑘 = 1o))
10 fvpr0o 17651 . . . . . . 7 ((𝐺‘∅) ∈ V → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘∅) = (𝐺‘∅))
111, 10ax-mp 5 . . . . . 6 ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘∅) = (𝐺‘∅)
12 fveq2 6882 . . . . . 6 (𝑘 = ∅ → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘𝑘) = ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘∅))
13 fveq2 6882 . . . . . 6 (𝑘 = ∅ → (𝐺𝑘) = (𝐺‘∅))
1411, 12, 133eqtr4a 2823 . . . . 5 (𝑘 = ∅ → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘𝑘) = (𝐺𝑘))
15 fvpr1o 17652 . . . . . . 7 ((𝐺‘1o) ∈ V → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘1o) = (𝐺‘1o))
162, 15ax-mp 5 . . . . . 6 ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘1o) = (𝐺‘1o)
17 fveq2 6882 . . . . . 6 (𝑘 = 1o → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘𝑘) = ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘1o))
18 fveq2 6882 . . . . . 6 (𝑘 = 1o → (𝐺𝑘) = (𝐺‘1o))
1916, 17, 183eqtr4a 2823 . . . . 5 (𝑘 = 1o → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘𝑘) = (𝐺𝑘))
2014, 19jaoi 871 . . . 4 ((𝑘 = ∅ ∨ 𝑘 = 1o) → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘𝑘) = (𝐺𝑘))
219, 20syl 18 . . 3 (𝑘 ∈ 2o → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘𝑘) = (𝐺𝑘))
2221adantl 487 . 2 ((𝐺 Fn 2o𝑘 ∈ 2o) → ({⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩}‘𝑘) = (𝐺𝑘))
235, 6, 22eqfnfvd 7029 1 (𝐺 Fn 2o → {⟨∅, (𝐺‘∅)⟩, ⟨1o, (𝐺‘1o)⟩} = 𝐺)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wo 861   = wceq 1570  wcel 2145  Vcvv 3453  c0 4282  {cpr 4589  cop 4593   Fn wfn 6532  cfv 6537  1oc1o 8452  2oc2o 8453
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
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 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-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  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-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-om 7867  df-1o 8459  df-2o 8460
This theorem is used by:  xpsff1o  17659  xpstopnlem2  24043
  Copyright terms: Public domain W3C validator