| Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mdvval | Structured version Visualization version GIF version | ||
| 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 |
|---|---|
| mdvval.v | ⊢ 𝑉 = (mVR‘𝑇) |
| mdvval.d | ⊢ 𝐷 = (mDV‘𝑇) |
| Ref | Expression |
|---|---|
| mdvval | ⊢ 𝐷 = ((𝑉 × 𝑉) ∖ I ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mdvval.d | . 2 ⊢ 𝐷 = (mDV‘𝑇) | |
| 2 | fveq2 6908 | . . . . . . 7 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇)) | |
| 3 | mdvval.v | . . . . . . 7 ⊢ 𝑉 = (mVR‘𝑇) | |
| 4 | 2, 3 | eqtr4di 2816 | . . . . . 6 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉) |
| 5 | 4 | sqxpeqd 5687 | . . . . 5 ⊢ (𝑡 = 𝑇 → ((mVR‘𝑡) × (mVR‘𝑡)) = (𝑉 × 𝑉)) |
| 6 | 5 | difeq1d 4065 | . . . 4 ⊢ (𝑡 = 𝑇 → (((mVR‘𝑡) × (mVR‘𝑡)) ∖ I ) = ((𝑉 × 𝑉) ∖ I )) |
| 7 | df-mdv 36420 | . . . 4 ⊢ mDV = (𝑡 ∈ V ↦ (((mVR‘𝑡) × (mVR‘𝑡)) ∖ I )) | |
| 8 | fvex 6921 | . . . . . 6 ⊢ (mVR‘𝑡) ∈ V | |
| 9 | 8, 8 | xpex 7791 | . . . . 5 ⊢ ((mVR‘𝑡) × (mVR‘𝑡)) ∈ V |
| 10 | difexg 5295 | . . . . 5 ⊢ (((mVR‘𝑡) × (mVR‘𝑡)) ∈ V → (((mVR‘𝑡) × (mVR‘𝑡)) ∖ I ) ∈ V) | |
| 11 | 9, 10 | ax-mp 5 | . . . 4 ⊢ (((mVR‘𝑡) × (mVR‘𝑡)) ∖ I ) ∈ V |
| 12 | 6, 7, 11 | fvmpt3i 7022 | . . 3 ⊢ (𝑇 ∈ V → (mDV‘𝑇) = ((𝑉 × 𝑉) ∖ I )) |
| 13 | 0dif 4359 | . . . . 5 ⊢ (∅ ∖ I ) = ∅ | |
| 14 | 13 | eqcomi 2772 | . . . 4 ⊢ ∅ = (∅ ∖ I ) |
| 15 | fvprc 6900 | . . . 4 ⊢ (¬ 𝑇 ∈ V → (mDV‘𝑇) = ∅) | |
| 16 | fvprc 6900 | . . . . . . . 8 ⊢ (¬ 𝑇 ∈ V → (mVR‘𝑇) = ∅) | |
| 17 | 3, 16 | eqtrid 2810 | . . . . . . 7 ⊢ (¬ 𝑇 ∈ V → 𝑉 = ∅) |
| 18 | 17 | xpeq2d 5685 | . . . . . 6 ⊢ (¬ 𝑇 ∈ V → (𝑉 × 𝑉) = (𝑉 × ∅)) |
| 19 | xp0 5756 | . . . . . 6 ⊢ (𝑉 × ∅) = ∅ | |
| 20 | 18, 19 | eqtrdi 2814 | . . . . 5 ⊢ (¬ 𝑇 ∈ V → (𝑉 × 𝑉) = ∅) |
| 21 | 20 | difeq1d 4065 | . . . 4 ⊢ (¬ 𝑇 ∈ V → ((𝑉 × 𝑉) ∖ I ) = (∅ ∖ I )) |
| 22 | 14, 15, 21 | 3eqtr4a 2824 | . . 3 ⊢ (¬ 𝑇 ∈ V → (mDV‘𝑇) = ((𝑉 × 𝑉) ∖ I )) |
| 23 | 12, 22 | pm2.61i 184 | . 2 ⊢ (mDV‘𝑇) = ((𝑉 × 𝑉) ∖ I ) |
| 24 | 1, 23 | eqtri 2786 | 1 ⊢ 𝐷 = ((𝑉 × 𝑉) ∖ I ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∖ cdif 4048 ∅c0 4281 I cid 5549 × cxp 5653 ‘cfv 6558 mVRcmvar 36393 mDVcmdv 36400 |
| 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-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| 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-rab 3417 df-v 3456 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-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6512 df-fun 6560 df-fv 6566 df-mdv 36420 |
| This theorem is used by: mthmpps 36514 mclsppslem 36515 |
| Copyright terms: Public domain | W3C validator |