Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > unxpdomlem1 | Structured version Visualization version GIF version |
Description: Lemma for unxpdom 8727. (Trivial substitution proof.) (Contributed by Mario Carneiro, 13-Jan-2013.) |
Ref | Expression |
---|---|
unxpdomlem1.1 | ⊢ 𝐹 = (𝑥 ∈ (𝑎 ∪ 𝑏) ↦ 𝐺) |
unxpdomlem1.2 | ⊢ 𝐺 = if(𝑥 ∈ 𝑎, 〈𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥〉) |
Ref | Expression |
---|---|
unxpdomlem1 | ⊢ (𝑧 ∈ (𝑎 ∪ 𝑏) → (𝐹‘𝑧) = if(𝑧 ∈ 𝑎, 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unxpdomlem1.2 | . . 3 ⊢ 𝐺 = if(𝑥 ∈ 𝑎, 〈𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥〉) | |
2 | elequ1 2121 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝑎 ↔ 𝑧 ∈ 𝑎)) | |
3 | opeq1 4805 | . . . . 5 ⊢ (𝑥 = 𝑧 → 〈𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)〉 = 〈𝑧, if(𝑥 = 𝑚, 𝑡, 𝑠)〉) | |
4 | equequ1 2032 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑚 ↔ 𝑧 = 𝑚)) | |
5 | 4 | ifbid 4491 | . . . . . 6 ⊢ (𝑥 = 𝑧 → if(𝑥 = 𝑚, 𝑡, 𝑠) = if(𝑧 = 𝑚, 𝑡, 𝑠)) |
6 | 5 | opeq2d 4812 | . . . . 5 ⊢ (𝑥 = 𝑧 → 〈𝑧, if(𝑥 = 𝑚, 𝑡, 𝑠)〉 = 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉) |
7 | 3, 6 | eqtrd 2858 | . . . 4 ⊢ (𝑥 = 𝑧 → 〈𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)〉 = 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉) |
8 | equequ1 2032 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑡 ↔ 𝑧 = 𝑡)) | |
9 | 8 | ifbid 4491 | . . . . . 6 ⊢ (𝑥 = 𝑧 → if(𝑥 = 𝑡, 𝑛, 𝑚) = if(𝑧 = 𝑡, 𝑛, 𝑚)) |
10 | 9 | opeq1d 4811 | . . . . 5 ⊢ (𝑥 = 𝑧 → 〈if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥〉 = 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑥〉) |
11 | opeq2 4806 | . . . . 5 ⊢ (𝑥 = 𝑧 → 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑥〉 = 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉) | |
12 | 10, 11 | eqtrd 2858 | . . . 4 ⊢ (𝑥 = 𝑧 → 〈if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥〉 = 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉) |
13 | 2, 7, 12 | ifbieq12d 4496 | . . 3 ⊢ (𝑥 = 𝑧 → if(𝑥 ∈ 𝑎, 〈𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥〉) = if(𝑧 ∈ 𝑎, 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉)) |
14 | 1, 13 | syl5eq 2870 | . 2 ⊢ (𝑥 = 𝑧 → 𝐺 = if(𝑧 ∈ 𝑎, 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉)) |
15 | unxpdomlem1.1 | . 2 ⊢ 𝐹 = (𝑥 ∈ (𝑎 ∪ 𝑏) ↦ 𝐺) | |
16 | opex 5358 | . . 3 ⊢ 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉 ∈ V | |
17 | opex 5358 | . . 3 ⊢ 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉 ∈ V | |
18 | 16, 17 | ifex 4517 | . 2 ⊢ if(𝑧 ∈ 𝑎, 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉) ∈ V |
19 | 14, 15, 18 | fvmpt 6770 | 1 ⊢ (𝑧 ∈ (𝑎 ∪ 𝑏) → (𝐹‘𝑧) = if(𝑧 ∈ 𝑎, 〈𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)〉, 〈if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ∪ cun 3936 ifcif 4469 〈cop 4575 ↦ cmpt 5148 ‘cfv 6357 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-iota 6316 df-fun 6359 df-fv 6365 |
This theorem is referenced by: unxpdomlem2 8725 unxpdomlem3 8726 |
Copyright terms: Public domain | W3C validator |