Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mexval2 | Structured version Visualization version GIF version |
Description: The set of expressions, which are pairs whose first element is a typecode, and whose second element is a list of constants and variables. (Contributed by Mario Carneiro, 18-Jul-2016.) |
Ref | Expression |
---|---|
mexval.k | ⊢ 𝐾 = (mTC‘𝑇) |
mexval.e | ⊢ 𝐸 = (mEx‘𝑇) |
mexval2.c | ⊢ 𝐶 = (mCN‘𝑇) |
mexval2.v | ⊢ 𝑉 = (mVR‘𝑇) |
Ref | Expression |
---|---|
mexval2 | ⊢ 𝐸 = (𝐾 × Word (𝐶 ∪ 𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mexval.k | . . . 4 ⊢ 𝐾 = (mTC‘𝑇) | |
2 | mexval.e | . . . 4 ⊢ 𝐸 = (mEx‘𝑇) | |
3 | eqid 2610 | . . . 4 ⊢ (mREx‘𝑇) = (mREx‘𝑇) | |
4 | 1, 2, 3 | mexval 30653 | . . 3 ⊢ 𝐸 = (𝐾 × (mREx‘𝑇)) |
5 | mexval2.c | . . . . 5 ⊢ 𝐶 = (mCN‘𝑇) | |
6 | mexval2.v | . . . . 5 ⊢ 𝑉 = (mVR‘𝑇) | |
7 | 5, 6, 3 | mrexval 30652 | . . . 4 ⊢ (𝑇 ∈ V → (mREx‘𝑇) = Word (𝐶 ∪ 𝑉)) |
8 | 7 | xpeq2d 5063 | . . 3 ⊢ (𝑇 ∈ V → (𝐾 × (mREx‘𝑇)) = (𝐾 × Word (𝐶 ∪ 𝑉))) |
9 | 4, 8 | syl5eq 2656 | . 2 ⊢ (𝑇 ∈ V → 𝐸 = (𝐾 × Word (𝐶 ∪ 𝑉))) |
10 | 0xp 5122 | . . . 4 ⊢ (∅ × Word (𝐶 ∪ 𝑉)) = ∅ | |
11 | 10 | eqcomi 2619 | . . 3 ⊢ ∅ = (∅ × Word (𝐶 ∪ 𝑉)) |
12 | fvprc 6097 | . . . 4 ⊢ (¬ 𝑇 ∈ V → (mEx‘𝑇) = ∅) | |
13 | 2, 12 | syl5eq 2656 | . . 3 ⊢ (¬ 𝑇 ∈ V → 𝐸 = ∅) |
14 | fvprc 6097 | . . . . 5 ⊢ (¬ 𝑇 ∈ V → (mTC‘𝑇) = ∅) | |
15 | 1, 14 | syl5eq 2656 | . . . 4 ⊢ (¬ 𝑇 ∈ V → 𝐾 = ∅) |
16 | 15 | xpeq1d 5062 | . . 3 ⊢ (¬ 𝑇 ∈ V → (𝐾 × Word (𝐶 ∪ 𝑉)) = (∅ × Word (𝐶 ∪ 𝑉))) |
17 | 11, 13, 16 | 3eqtr4a 2670 | . 2 ⊢ (¬ 𝑇 ∈ V → 𝐸 = (𝐾 × Word (𝐶 ∪ 𝑉))) |
18 | 9, 17 | pm2.61i 175 | 1 ⊢ 𝐸 = (𝐾 × Word (𝐶 ∪ 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ∪ cun 3538 ∅c0 3874 × cxp 5036 ‘cfv 5804 Word cword 13146 mCNcmcn 30611 mVRcmvar 30612 mTCcmtc 30615 mRExcmrex 30617 mExcmex 30618 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-er 7629 df-map 7746 df-pm 7747 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335 df-hash 12980 df-word 13154 df-mrex 30637 df-mex 30638 |
This theorem is referenced by: mvrsfpw 30657 |
Copyright terms: Public domain | W3C validator |