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

Theorem mclspps 35971
Description: The closure is closed under application of provable pre-statements. (Compare mclsax 35956.) This theorem is what justifies the treatment of theorems as "equivalent" to axioms once they have been proven: the composition of one theorem in the proof of another yields a theorem. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mclspps.d 𝐷 = (mDV‘𝑇)
mclspps.e 𝐸 = (mEx‘𝑇)
mclspps.c 𝐶 = (mCls‘𝑇)
mclspps.1 (𝜑𝑇 ∈ mFS)
mclspps.2 (𝜑𝐾𝐷)
mclspps.3 (𝜑𝐵𝐸)
mclspps.j 𝐽 = (mPPSt‘𝑇)
mclspps.l 𝐿 = (mSubst‘𝑇)
mclspps.v 𝑉 = (mVR‘𝑇)
mclspps.h 𝐻 = (mVH‘𝑇)
mclspps.w 𝑊 = (mVars‘𝑇)
mclspps.4 (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
mclspps.5 (𝜑𝑆 ∈ ran 𝐿)
mclspps.6 ((𝜑𝑥𝑂) → (𝑆𝑥) ∈ (𝐾𝐶𝐵))
mclspps.7 ((𝜑𝑣𝑉) → (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))
mclspps.8 ((𝜑 ∧ (𝑥𝑀𝑦𝑎 ∈ (𝑊‘(𝑆‘(𝐻𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻𝑦))))) → 𝑎𝐾𝑏)
Assertion
Ref Expression
mclspps (𝜑 → (𝑆𝑃) ∈ (𝐾𝐶𝐵))
Distinct variable groups:   𝑣,𝐸   𝑎,𝑏,𝑣,𝑥,𝑦,𝐻   𝑣,𝑉   𝐾,𝑎,𝑏,𝑣,𝑥,𝑦   𝑇,𝑎,𝑏,𝑣,𝑥,𝑦   𝐿,𝑎,𝑏,𝑣,𝑥,𝑦   𝑆,𝑎,𝑏,𝑣,𝑥,𝑦   𝐵,𝑎,𝑏,𝑣,𝑥,𝑦   𝑊,𝑎,𝑏,𝑣,𝑥,𝑦   𝐶,𝑎,𝑏,𝑣,𝑥,𝑦   𝑀,𝑎,𝑏,𝑣,𝑥,𝑦   𝑣,𝑂,𝑥   𝜑,𝑎,𝑏,𝑣,𝑥,𝑦
Allowed substitution hints:   𝐷(𝑥,𝑦,𝑣,𝑎,𝑏)   𝑃(𝑥,𝑦,𝑣,𝑎,𝑏)   𝐸(𝑥,𝑦,𝑎,𝑏)   𝐽(𝑥,𝑦,𝑣,𝑎,𝑏)   𝑂(𝑦,𝑎,𝑏)   𝑉(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem mclspps
Dummy variables 𝑚 𝑜 𝑝 𝑠 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mclspps.5 . . . 4 (𝜑𝑆 ∈ ran 𝐿)
2 mclspps.l . . . . 5 𝐿 = (mSubst‘𝑇)
3 mclspps.e . . . . 5 𝐸 = (mEx‘𝑇)
42, 3msubf 35919 . . . 4 (𝑆 ∈ ran 𝐿𝑆:𝐸𝐸)
51, 4syl 18 . . 3 (𝜑𝑆:𝐸𝐸)
65ffnd 6704 . 2 (𝜑𝑆 Fn 𝐸)
7 mclspps.d . . . 4 𝐷 = (mDV‘𝑇)
8 mclspps.c . . . 4 𝐶 = (mCls‘𝑇)
9 mclspps.1 . . . 4 (𝜑𝑇 ∈ mFS)
10 eqid 2769 . . . . . . . . 9 (mPreSt‘𝑇) = (mPreSt‘𝑇)
11 mclspps.j . . . . . . . . 9 𝐽 = (mPPSt‘𝑇)
1210, 11mppspst 35961 . . . . . . . 8 𝐽 ⊆ (mPreSt‘𝑇)
13 mclspps.4 . . . . . . . 8 (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
1412, 13sselid 3943 . . . . . . 7 (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇))
157, 3, 10elmpst 35923 . . . . . . 7 (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑀𝐷𝑀 = 𝑀) ∧ (𝑂𝐸𝑂 ∈ Fin) ∧ 𝑃𝐸))
1614, 15sylib 221 . . . . . 6 (𝜑 → ((𝑀𝐷𝑀 = 𝑀) ∧ (𝑂𝐸𝑂 ∈ Fin) ∧ 𝑃𝐸))
1716simp1d 1158 . . . . 5 (𝜑 → (𝑀𝐷𝑀 = 𝑀))
1817simpld 499 . . . 4 (𝜑𝑀𝐷)
1916simp2d 1159 . . . . 5 (𝜑 → (𝑂𝐸𝑂 ∈ Fin))
2019simpld 499 . . . 4 (𝜑𝑂𝐸)
21 eqid 2769 . . . 4 (mAx‘𝑇) = (mAx‘𝑇)
22 mclspps.v . . . 4 𝑉 = (mVR‘𝑇)
23 mclspps.h . . . 4 𝐻 = (mVH‘𝑇)
24 mclspps.w . . . 4 𝑊 = (mVars‘𝑇)
25 mclspps.6 . . . . . 6 ((𝜑𝑥𝑂) → (𝑆𝑥) ∈ (𝐾𝐶𝐵))
2625ralrimiva 3163 . . . . 5 (𝜑 → ∀𝑥𝑂 (𝑆𝑥) ∈ (𝐾𝐶𝐵))
275ffund 6708 . . . . . 6 (𝜑 → Fun 𝑆)
285fdmd 6714 . . . . . . 7 (𝜑 → dom 𝑆 = 𝐸)
2920, 28sseqtrrd 3982 . . . . . 6 (𝜑𝑂 ⊆ dom 𝑆)
30 funimass5 7048 . . . . . 6 ((Fun 𝑆𝑂 ⊆ dom 𝑆) → (𝑂 ⊆ (𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥𝑂 (𝑆𝑥) ∈ (𝐾𝐶𝐵)))
3127, 29, 30syl2anc 595 . . . . 5 (𝜑 → (𝑂 ⊆ (𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥𝑂 (𝑆𝑥) ∈ (𝐾𝐶𝐵)))
3226, 31mpbird 260 . . . 4 (𝜑𝑂 ⊆ (𝑆 “ (𝐾𝐶𝐵)))
3322, 3, 23mvhf 35945 . . . . . . 7 (𝑇 ∈ mFS → 𝐻:𝑉𝐸)
349, 33syl 18 . . . . . 6 (𝜑𝐻:𝑉𝐸)
3534ffvelcdmda 7077 . . . . 5 ((𝜑𝑣𝑉) → (𝐻𝑣) ∈ 𝐸)
36 mclspps.7 . . . . 5 ((𝜑𝑣𝑉) → (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))
37 elpreima 7051 . . . . . . 7 (𝑆 Fn 𝐸 → ((𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))))
386, 37syl 18 . . . . . 6 (𝜑 → ((𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))))
3938adantr 485 . . . . 5 ((𝜑𝑣𝑉) → ((𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))))
4035, 36, 39mpbir2and 725 . . . 4 ((𝜑𝑣𝑉) → (𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)))
4193ad2ant1 1149 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝑇 ∈ mFS)
42 mclspps.2 . . . . . 6 (𝜑𝐾𝐷)
43423ad2ant1 1149 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝐾𝐷)
44 mclspps.3 . . . . . 6 (𝜑𝐵𝐸)
45443ad2ant1 1149 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝐵𝐸)
46133ad2ant1 1149 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
4713ad2ant1 1149 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝑆 ∈ ran 𝐿)
48253ad2antl1 1202 . . . . 5 (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) ∧ 𝑥𝑂) → (𝑆𝑥) ∈ (𝐾𝐶𝐵))
49363ad2antl1 1202 . . . . 5 (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) ∧ 𝑣𝑉) → (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))
50 mclspps.8 . . . . . 6 ((𝜑 ∧ (𝑥𝑀𝑦𝑎 ∈ (𝑊‘(𝑆‘(𝐻𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻𝑦))))) → 𝑎𝐾𝑏)
51503ad2antl1 1202 . . . . 5 (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) ∧ (𝑥𝑀𝑦𝑎 ∈ (𝑊‘(𝑆‘(𝐻𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻𝑦))))) → 𝑎𝐾𝑏)
52 simp21 1223 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇))
53 simp22 1224 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝑠 ∈ ran 𝐿)
54 simp23 1225 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵)))
55 simp3 1154 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀))
567, 3, 8, 41, 43, 45, 11, 2, 22, 23, 24, 46, 47, 48, 49, 51, 52, 53, 54, 55mclsppslem 35970 . . . 4 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → (𝑠𝑝) ∈ (𝑆 “ (𝐾𝐶𝐵)))
577, 3, 8, 9, 18, 20, 21, 2, 22, 23, 24, 32, 40, 56mclsind 35957 . . 3 (𝜑 → (𝑀𝐶𝑂) ⊆ (𝑆 “ (𝐾𝐶𝐵)))
5810, 11, 8elmpps 35960 . . . . 5 (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 ↔ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ∧ 𝑃 ∈ (𝑀𝐶𝑂)))
5958simprbi 502 . . . 4 (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽𝑃 ∈ (𝑀𝐶𝑂))
6013, 59syl 18 . . 3 (𝜑𝑃 ∈ (𝑀𝐶𝑂))
6157, 60sseldd 3946 . 2 (𝜑𝑃 ∈ (𝑆 “ (𝐾𝐶𝐵)))
62 elpreima 7051 . . 3 (𝑆 Fn 𝐸 → (𝑃 ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ (𝑃𝐸 ∧ (𝑆𝑃) ∈ (𝐾𝐶𝐵))))
6362simplbda 504 . 2 ((𝑆 Fn 𝐸𝑃 ∈ (𝑆 “ (𝐾𝐶𝐵))) → (𝑆𝑃) ∈ (𝐾𝐶𝐵))
646, 61, 63syl2anc 595 1 (𝜑 → (𝑆𝑃) ∈ (𝐾𝐶𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101  wal 1565   = wceq 1567  wcel 2149  wral 3085  cun 3911  wss 3913  cotp 4599   class class class wbr 5110   × cxp 5657  ccnv 5658  dom cdm 5659  ran crn 5660  cima 5662  Fun wfun 6528   Fn wfn 6529  wf 6530  cfv 6534  (class class class)co 7408  Fincfn 8939  mVRcmvar 35848  mAxcmax 35852  mExcmex 35854  mDVcmdv 35855  mVarscmvrs 35856  mSubstcmsub 35858  mVHcmvh 35859  mPreStcmpst 35860  mFScmfs 35863  mClscmcls 35864  mPPStcmpps 35865
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6300  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-map 8822  df-pm 8823  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-card 9921  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440  df-nn 12230  df-2 12299  df-n0 12501  df-xnn0 12574  df-z 12588  df-uz 12859  df-fz 13532  df-fzo 13679  df-seq 14034  df-hash 14363  df-word 14547  df-lsw 14596  df-concat 14604  df-s1 14630  df-substr 14675  df-pfx 14705  df-struct 17203  df-sets 17220  df-slot 17238  df-ndx 17250  df-base 17266  df-ress 17287  df-plusg 17319  df-0g 17490  df-gsum 17491  df-mgm 18694  df-sgrp 18773  df-mnd 18789  df-mhm 18837  df-submnd 18838  df-frmd 18904  df-vrmd 18905  df-mrex 35873  df-mex 35874  df-mdv 35875  df-mvrs 35876  df-mrsub 35877  df-msub 35878  df-mvh 35879  df-mpst 35880  df-msr 35881  df-msta 35882  df-mfs 35883  df-mcls 35884  df-mpps 35885
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator