Theorem unxpdomlem1 9250

Description: Lemma for unxpdom 9253. (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

Step	Hyp	Ref	Expression
1		unxpdomlem1.2	. . 3 ⊢ 𝐺 = if(𝑥 ∈ 𝑎, ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩)
2		elequ1 2114	. . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝑎 ↔ 𝑧 ∈ 𝑎))
3		opeq1 4874	. . . . 5 ⊢ (𝑥 = 𝑧 → ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩ = ⟨𝑧, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩)
4		equequ1 2029	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑚 ↔ 𝑧 = 𝑚))
5	4	ifbid 4552	. . . . . 6 ⊢ (𝑥 = 𝑧 → if(𝑥 = 𝑚, 𝑡, 𝑠) = if(𝑧 = 𝑚, 𝑡, 𝑠))
6	5	opeq2d 4881	. . . . 5 ⊢ (𝑥 = 𝑧 → ⟨𝑧, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩ = ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩)
7	3, 6	eqtrd 2773	. . . 4 ⊢ (𝑥 = 𝑧 → ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩ = ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩)
8		equequ1 2029	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑡 ↔ 𝑧 = 𝑡))
9	8	ifbid 4552	. . . . . 6 ⊢ (𝑥 = 𝑧 → if(𝑥 = 𝑡, 𝑛, 𝑚) = if(𝑧 = 𝑡, 𝑛, 𝑚))
10	9	opeq1d 4880	. . . . 5 ⊢ (𝑥 = 𝑧 → ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩ = ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑥⟩)
11		opeq2 4875	. . . . 5 ⊢ (𝑥 = 𝑧 → ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑥⟩ = ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩)
12	10, 11	eqtrd 2773	. . . 4 ⊢ (𝑥 = 𝑧 → ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩ = ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩)
13	2, 7, 12	ifbieq12d 4557	. . 3 ⊢ (𝑥 = 𝑧 → if(𝑥 ∈ 𝑎, ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩) = if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
14	1, 13	eqtrid 2785	. 2 ⊢ (𝑥 = 𝑧 → 𝐺 = if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
15		unxpdomlem1.1	. 2 ⊢ 𝐹 = (𝑥 ∈ (𝑎 ∪ 𝑏) ↦ 𝐺)
16		opex 5465	. . 3 ⊢ ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩ ∈ V
17		opex 5465	. . 3 ⊢ ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩ ∈ V
18	16, 17	ifex 4579	. 2 ⊢ if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩) ∈ V
19	14, 15, 18	fvmpt 6999	1 ⊢ (𝑧 ∈ (𝑎 ∪ 𝑏) → (𝐹‘𝑧) = if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2107   ∪ cun 3947  ifcif 4529  ⟨cop 4635   ↦ cmpt 5232  ‘cfv 6544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-iota 6496  df-fun 6546  df-fv 6552

This theorem is referenced by:  unxpdomlem2  9251  unxpdomlem3  9252