Metamath Proof Explorer


Theorem mdvval

Description: The set of disjoint variable conditions, which are pairs of distinct variables. (This definition differs from appendix C, which uses unordered pairs instead. We use ordered pairs, but all sets of disjoint variable conditions of interest will be symmetric, so it does not matter.) (Contributed by Mario Carneiro, 18-Jul-2016)

Ref Expression
Hypotheses mdvval.v V = mVR T
mdvval.d D = mDV T
Assertion mdvval D = V × V I

Proof

Step Hyp Ref Expression
1 mdvval.v V = mVR T
2 mdvval.d D = mDV T
3 fveq2 t = T mVR t = mVR T
4 3 1 syl6eqr t = T mVR t = V
5 4 sqxpeqd t = T mVR t × mVR t = V × V
6 5 difeq1d t = T mVR t × mVR t I = V × V I
7 df-mdv mDV = t V mVR t × mVR t I
8 fvex mVR t V
9 8 8 xpex mVR t × mVR t V
10 difexg mVR t × mVR t V mVR t × mVR t I V
11 9 10 ax-mp mVR t × mVR t I V
12 6 7 11 fvmpt3i T V mDV T = V × V I
13 0dif I =
14 13 eqcomi = I
15 fvprc ¬ T V mDV T =
16 fvprc ¬ T V mVR T =
17 1 16 syl5eq ¬ T V V =
18 17 xpeq2d ¬ T V V × V = V ×
19 xp0 V × =
20 18 19 syl6eq ¬ T V V × V =
21 20 difeq1d ¬ T V V × V I = I
22 14 15 21 3eqtr4a ¬ T V mDV T = V × V I
23 12 22 pm2.61i mDV T = V × V I
24 2 23 eqtri D = V × V I