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

Theorem unxpdomlem1 8320
 Description: Lemma for unxpdom 8323. (Trivial substitution proof.) (Contributed by Mario Carneiro, 13-Jan-2013.)
Hypotheses
Ref Expression
unxpdomlem1.1 𝐹 = (𝑥 ∈ (𝑎𝑏) ↦ 𝐺)
unxpdomlem1.2 𝐺 = if(𝑥𝑎, ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩)
Assertion
Ref Expression
unxpdomlem1 (𝑧 ∈ (𝑎𝑏) → (𝐹𝑧) = if(𝑧𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
Distinct variable groups:   𝑧,𝐹   𝑎,𝑏,𝑚,𝑛,𝑠,𝑡,𝑥,𝑧
Allowed substitution hints:   𝐹(𝑥,𝑡,𝑚,𝑛,𝑠,𝑎,𝑏)   𝐺(𝑥,𝑧,𝑡,𝑚,𝑛,𝑠,𝑎,𝑏)

Proof of Theorem unxpdomlem1
StepHypRef Expression
1 unxpdomlem1.2 . . 3 𝐺 = if(𝑥𝑎, ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩)
2 elequ1 2152 . . . 4 (𝑥 = 𝑧 → (𝑥𝑎𝑧𝑎))
3 opeq1 4539 . . . . 5 (𝑥 = 𝑧 → ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩ = ⟨𝑧, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩)
4 equequ1 2110 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 = 𝑚𝑧 = 𝑚))
54ifbid 4247 . . . . . 6 (𝑥 = 𝑧 → if(𝑥 = 𝑚, 𝑡, 𝑠) = if(𝑧 = 𝑚, 𝑡, 𝑠))
65opeq2d 4546 . . . . 5 (𝑥 = 𝑧 → ⟨𝑧, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩ = ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩)
73, 6eqtrd 2805 . . . 4 (𝑥 = 𝑧 → ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩ = ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩)
8 equequ1 2110 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 = 𝑡𝑧 = 𝑡))
98ifbid 4247 . . . . . 6 (𝑥 = 𝑧 → if(𝑥 = 𝑡, 𝑛, 𝑚) = if(𝑧 = 𝑡, 𝑛, 𝑚))
109opeq1d 4545 . . . . 5 (𝑥 = 𝑧 → ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩ = ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑥⟩)
11 opeq2 4540 . . . . 5 (𝑥 = 𝑧 → ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑥⟩ = ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩)
1210, 11eqtrd 2805 . . . 4 (𝑥 = 𝑧 → ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩ = ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩)
132, 7, 12ifbieq12d 4252 . . 3 (𝑥 = 𝑧 → if(𝑥𝑎, ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩) = if(𝑧𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
141, 13syl5eq 2817 . 2 (𝑥 = 𝑧𝐺 = if(𝑧𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
15 unxpdomlem1.1 . 2 𝐹 = (𝑥 ∈ (𝑎𝑏) ↦ 𝐺)
16 opex 5060 . . 3 𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩ ∈ V
17 opex 5060 . . 3 ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩ ∈ V
1816, 17ifex 4295 . 2 if(𝑧𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩) ∈ V
1914, 15, 18fvmpt 6424 1 (𝑧 ∈ (𝑎𝑏) → (𝐹𝑧) = if(𝑧𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1631   ∈ wcel 2145   ∪ cun 3721  ifcif 4225  ⟨cop 4322   ↦ cmpt 4863  ‘cfv 6031 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3588  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-iota 5994  df-fun 6033  df-fv 6039 This theorem is referenced by:  unxpdomlem2  8321  unxpdomlem3  8322
 Copyright terms: Public domain W3C validator