| Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > msubval | Structured version Visualization version GIF version | ||
| Description: A substitution applied to an expression. (Contributed by Mario Carneiro, 18-Jul-2016.) |
| Ref | Expression |
|---|---|
| msubffval.v | ⊢ 𝑉 = (mVR‘𝑇) |
| msubffval.r | ⊢ 𝑅 = (mREx‘𝑇) |
| msubffval.s | ⊢ 𝑆 = (mSubst‘𝑇) |
| msubffval.e | ⊢ 𝐸 = (mEx‘𝑇) |
| msubffval.o | ⊢ 𝑂 = (mRSubst‘𝑇) |
| Ref | Expression |
|---|---|
| msubval | ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → ((𝑆‘𝐹)‘𝑋) = 〈(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | msubffval.v | . . . 4 ⊢ 𝑉 = (mVR‘𝑇) | |
| 2 | msubffval.r | . . . 4 ⊢ 𝑅 = (mREx‘𝑇) | |
| 3 | msubffval.s | . . . 4 ⊢ 𝑆 = (mSubst‘𝑇) | |
| 4 | msubffval.e | . . . 4 ⊢ 𝐸 = (mEx‘𝑇) | |
| 5 | msubffval.o | . . . 4 ⊢ 𝑂 = (mRSubst‘𝑇) | |
| 6 | 1, 2, 3, 4, 5 | msubfval 36469 | . . 3 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝐸 ↦ 〈(1st ‘𝑒), ((𝑂‘𝐹)‘(2nd ‘𝑒))〉)) |
| 7 | 6 | 3adant3 1150 | . 2 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → (𝑆‘𝐹) = (𝑒 ∈ 𝐸 ↦ 〈(1st ‘𝑒), ((𝑂‘𝐹)‘(2nd ‘𝑒))〉)) |
| 8 | simpr 490 | . . . 4 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → 𝑒 = 𝑋) | |
| 9 | 8 | fveq2d 6915 | . . 3 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → (1st ‘𝑒) = (1st ‘𝑋)) |
| 10 | 8 | fveq2d 6915 | . . . 4 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → (2nd ‘𝑒) = (2nd ‘𝑋)) |
| 11 | 10 | fveq2d 6915 | . . 3 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → ((𝑂‘𝐹)‘(2nd ‘𝑒)) = ((𝑂‘𝐹)‘(2nd ‘𝑋))) |
| 12 | 9, 11 | opeq12d 4851 | . 2 ⊢ (((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) ∧ 𝑒 = 𝑋) → 〈(1st ‘𝑒), ((𝑂‘𝐹)‘(2nd ‘𝑒))〉 = 〈(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))〉) |
| 13 | simp3 1156 | . 2 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → 𝑋 ∈ 𝐸) | |
| 14 | opex 5437 | . . 3 ⊢ 〈(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))〉 ∈ V | |
| 15 | 14 | a1i 11 | . 2 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → 〈(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))〉 ∈ V) |
| 16 | 7, 12, 13, 15 | fvmptd 7027 | 1 ⊢ ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉 ∧ 𝑋 ∈ 𝐸) → ((𝑆‘𝐹)‘𝑋) = 〈(1st ‘𝑋), ((𝑂‘𝐹)‘(2nd ‘𝑋))〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 〈cop 4838 ↦ cmpt 5190 ⟶wf 6557 ‘cfv 6561 1st c1st 8026 2nd c2nd 8027 mVRcmvar 36406 mRExcmrex 36411 mExcmex 36412 mRSubstcmrsub 36415 mSubstcmsub 36416 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-ov 7449 df-oprab 7450 df-mpo 7451 df-pm 8881 df-msub 36436 |
| This theorem is used by: msubrsub 36471 msubty 36472 msubff1 36501 |
| Copyright terms: Public domain | W3C validator |