Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mclsrcl Structured version   Visualization version   GIF version

Theorem mclsrcl 36534
Description: Reverse closure for the closure function. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mclsval.d 𝐷 = (mDV‘𝑇)
mclsval.e 𝐸 = (mEx‘𝑇)
mclsval.c 𝐶 = (mCls‘𝑇)
Assertion
Ref Expression
mclsrcl (𝐴 ∈ (𝐾𝐶𝐵) → (𝑇 ∈ V ∧ 𝐾 ⊆ 𝐷 ∧ 𝐵 ⊆ 𝐸))

Proof of Theorem mclsrcl
Dummy variables ℎ 𝑑 𝑡 𝑐 𝑚 𝑜 𝑝 𝑠 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 n0i 4289 . . 3 (𝐴 ∈ (𝐾𝐶𝐵) → ¬ (𝐾𝐶𝐵) = ∅)
2 mclsval.c . . . . . 6 𝐶 = (mCls‘𝑇)
3 fvprc 6908 . . . . . 6 (¬ 𝑇 ∈ V → (mCls‘𝑇) = ∅)
42, 3eqtrid 2810 . . . . 5 (¬ 𝑇 ∈ V → 𝐶 = ∅)
54oveqd 7468 . . . 4 (¬ 𝑇 ∈ V → (𝐾𝐶𝐵) = (𝐾∅𝐵))
6 0ov 7488 . . . 4 (𝐾∅𝐵) = ∅
75, 6eqtrdi 2814 . . 3 (¬ 𝑇 ∈ V → (𝐾𝐶𝐵) = ∅)
81, 7nsyl2 142 . 2 (𝐴 ∈ (𝐾𝐶𝐵) → 𝑇 ∈ V)
9 fveq2 6916 . . . . . . . . 9 (𝑡 = 𝑇 → (mCls‘𝑡) = (mCls‘𝑇))
109, 2eqtr4di 2816 . . . . . . . 8 (𝑡 = 𝑇 → (mCls‘𝑡) = 𝐶)
1110oveqd 7468 . . . . . . 7 (𝑡 = 𝑇 → (𝐾(mCls‘𝑡)𝐵) = (𝐾𝐶𝐵))
1211eleq2d 2850 . . . . . 6 (𝑡 = 𝑇 → (𝐴 ∈ (𝐾(mCls‘𝑡)𝐵) ↔ 𝐴 ∈ (𝐾𝐶𝐵)))
13 fvex 6929 . . . . . . . . 9 (mDV‘𝑡) ∈ V
1413elpw2 5303 . . . . . . . 8 (𝐾 ∈ 𝒫 (mDV‘𝑡) ↔ 𝐾 ⊆ (mDV‘𝑡))
15 fveq2 6916 . . . . . . . . . 10 (𝑡 = 𝑇 → (mDV‘𝑡) = (mDV‘𝑇))
16 mclsval.d . . . . . . . . . 10 𝐷 = (mDV‘𝑇)
1715, 16eqtr4di 2816 . . . . . . . . 9 (𝑡 = 𝑇 → (mDV‘𝑡) = 𝐷)
1817sseq2d 3945 . . . . . . . 8 (𝑡 = 𝑇 → (𝐾 ⊆ (mDV‘𝑡) ↔ 𝐾 ⊆ 𝐷))
1914, 18bitrid 286 . . . . . . 7 (𝑡 = 𝑇 → (𝐾 ∈ 𝒫 (mDV‘𝑡) ↔ 𝐾 ⊆ 𝐷))
20 fvex 6929 . . . . . . . . 9 (mEx‘𝑡) ∈ V
2120elpw2 5303 . . . . . . . 8 (𝐵 ∈ 𝒫 (mEx‘𝑡) ↔ 𝐵 ⊆ (mEx‘𝑡))
22 fveq2 6916 . . . . . . . . . 10 (𝑡 = 𝑇 → (mEx‘𝑡) = (mEx‘𝑇))
23 mclsval.e . . . . . . . . . 10 𝐸 = (mEx‘𝑇)
2422, 23eqtr4di 2816 . . . . . . . . 9 (𝑡 = 𝑇 → (mEx‘𝑡) = 𝐸)
2524sseq2d 3945 . . . . . . . 8 (𝑡 = 𝑇 → (𝐵 ⊆ (mEx‘𝑡) ↔ 𝐵 ⊆ 𝐸))
2621, 25bitrid 286 . . . . . . 7 (𝑡 = 𝑇 → (𝐵 ∈ 𝒫 (mEx‘𝑡) ↔ 𝐵 ⊆ 𝐸))
2719, 26anbi12d 644 . . . . . 6 (𝑡 = 𝑇 → ((𝐾 ∈ 𝒫 (mDV‘𝑡) ∧ 𝐵 ∈ 𝒫 (mEx‘𝑡)) ↔ (𝐾 ⊆ 𝐷 ∧ 𝐵 ⊆ 𝐸)))
2812, 27imbi12d 347 . . . . 5 (𝑡 = 𝑇 → ((𝐴 ∈ (𝐾(mCls‘𝑡)𝐵) → (𝐾 ∈ 𝒫 (mDV‘𝑡) ∧ 𝐵 ∈ 𝒫 (mEx‘𝑡))) ↔ (𝐴 ∈ (𝐾𝐶𝐵) → (𝐾 ⊆ 𝐷 ∧ 𝐵 ⊆ 𝐸))))
29 vex 3458 . . . . . . 7 𝑡 ∈ V
3013pwex 5349 . . . . . . . 8 𝒫 (mDV‘𝑡) ∈ V
3120pwex 5349 . . . . . . . 8 𝒫 (mEx‘𝑡) ∈ V
3230, 31mpoex 8127 . . . . . . 7 (𝑑 ∈ 𝒫 (mDV‘𝑡), ℎ ∈ 𝒫 (mEx‘𝑡) ↦ ∩ {𝑐 ∣ ((ℎ ∪ ran (mVH‘𝑡)) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑡) → ∀𝑠 ∈ ran (mSubst‘𝑡)(((𝑠 “ (𝑜 ∪ ran (mVH‘𝑡))) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → (((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑥))) × ((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑦)))) ⊆ 𝑑)) → (𝑠‘𝑝) ∈ 𝑐)))}) ∈ V
33 df-mcls 36470 . . . . . . . 8 mCls = (𝑡 ∈ V ↦ (𝑑 ∈ 𝒫 (mDV‘𝑡), ℎ ∈ 𝒫 (mEx‘𝑡) ↦ ∩ {𝑐 ∣ ((ℎ ∪ ran (mVH‘𝑡)) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑡) → ∀𝑠 ∈ ran (mSubst‘𝑡)(((𝑠 “ (𝑜 ∪ ran (mVH‘𝑡))) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → (((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑥))) × ((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑦)))) ⊆ 𝑑)) → (𝑠‘𝑝) ∈ 𝑐)))}))
3433fvmpt2 7036 . . . . . . 7 ((𝑡 ∈ V ∧ (𝑑 ∈ 𝒫 (mDV‘𝑡), ℎ ∈ 𝒫 (mEx‘𝑡) ↦ ∩ {𝑐 ∣ ((ℎ ∪ ran (mVH‘𝑡)) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑡) → ∀𝑠 ∈ ran (mSubst‘𝑡)(((𝑠 “ (𝑜 ∪ ran (mVH‘𝑡))) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → (((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑥))) × ((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑦)))) ⊆ 𝑑)) → (𝑠‘𝑝) ∈ 𝑐)))}) ∈ V) → (mCls‘𝑡) = (𝑑 ∈ 𝒫 (mDV‘𝑡), ℎ ∈ 𝒫 (mEx‘𝑡) ↦ ∩ {𝑐 ∣ ((ℎ ∪ ran (mVH‘𝑡)) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑡) → ∀𝑠 ∈ ran (mSubst‘𝑡)(((𝑠 “ (𝑜 ∪ ran (mVH‘𝑡))) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → (((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑥))) × ((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑦)))) ⊆ 𝑑)) → (𝑠‘𝑝) ∈ 𝑐)))}))
3529, 32, 34mp2an 705 . . . . . 6 (mCls‘𝑡) = (𝑑 ∈ 𝒫 (mDV‘𝑡), ℎ ∈ 𝒫 (mEx‘𝑡) ↦ ∩ {𝑐 ∣ ((ℎ ∪ ran (mVH‘𝑡)) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑡) → ∀𝑠 ∈ ran (mSubst‘𝑡)(((𝑠 “ (𝑜 ∪ ran (mVH‘𝑡))) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → (((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑥))) × ((mVars‘𝑡)‘(𝑠‘((mVH‘𝑡)‘𝑦)))) ⊆ 𝑑)) → (𝑠‘𝑝) ∈ 𝑐)))})
3635elmpocl 7694 . . . . 5 (𝐴 ∈ (𝐾(mCls‘𝑡)𝐵) → (𝐾 ∈ 𝒫 (mDV‘𝑡) ∧ 𝐵 ∈ 𝒫 (mEx‘𝑡)))
3728, 36vtoclg 3521 . . . 4 (𝑇 ∈ V → (𝐴 ∈ (𝐾𝐶𝐵) → (𝐾 ⊆ 𝐷 ∧ 𝐵 ⊆ 𝐸)))
388, 37mpcom 39 . . 3 (𝐴 ∈ (𝐾𝐶𝐵) → (𝐾 ⊆ 𝐷 ∧ 𝐵 ⊆ 𝐸))
3938simpld 500 . 2 (𝐴 ∈ (𝐾𝐶𝐵) → 𝐾 ⊆ 𝐷)
4038simprd 501 . 2 (𝐴 ∈ (𝐾𝐶𝐵) → 𝐵 ⊆ 𝐸)
418, 39, 403jca 1146 1 (𝐴 ∈ (𝐾𝐶𝐵) → (𝑇 ∈ V ∧ 𝐾 ⊆ 𝐷 ∧ 𝐵 ⊆ 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ∅c0 4281  𝒫 cpw 4560  ⟨cotp 4863  ∩ cint 4912   class class class wbr 5108   × cxp 5656  ran crn 5659   “ cima 5661  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  mAxcmax 36438  mExcmex 36440  mDVcmdv 36441  mVarscmvrs 36442  mSubstcmsub 36444  mVHcmvh 36445  mClscmcls 36450
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-mcls 36470
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator