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 32831
Description: The closure is closed under application of provable pre-statements. (Compare mclsax 32816.) 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 32779 . . . 4 (𝑆 ∈ ran 𝐿𝑆:𝐸𝐸)
51, 4syl 17 . . 3 (𝜑𝑆:𝐸𝐸)
65ffnd 6515 . 2 (𝜑𝑆 Fn 𝐸)
7 mclspps.d . . . 4 𝐷 = (mDV‘𝑇)
8 mclspps.c . . . 4 𝐶 = (mCls‘𝑇)
9 mclspps.1 . . . 4 (𝜑𝑇 ∈ mFS)
10 eqid 2821 . . . . . . . . 9 (mPreSt‘𝑇) = (mPreSt‘𝑇)
11 mclspps.j . . . . . . . . 9 𝐽 = (mPPSt‘𝑇)
1210, 11mppspst 32821 . . . . . . . 8 𝐽 ⊆ (mPreSt‘𝑇)
13 mclspps.4 . . . . . . . 8 (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
1412, 13sseldi 3965 . . . . . . 7 (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇))
157, 3, 10elmpst 32783 . . . . . . 7 (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑀𝐷𝑀 = 𝑀) ∧ (𝑂𝐸𝑂 ∈ Fin) ∧ 𝑃𝐸))
1614, 15sylib 220 . . . . . 6 (𝜑 → ((𝑀𝐷𝑀 = 𝑀) ∧ (𝑂𝐸𝑂 ∈ Fin) ∧ 𝑃𝐸))
1716simp1d 1138 . . . . 5 (𝜑 → (𝑀𝐷𝑀 = 𝑀))
1817simpld 497 . . . 4 (𝜑𝑀𝐷)
1916simp2d 1139 . . . . 5 (𝜑 → (𝑂𝐸𝑂 ∈ Fin))
2019simpld 497 . . . 4 (𝜑𝑂𝐸)
21 eqid 2821 . . . 4 (mAx‘𝑇) = (mAx‘𝑇)
22 mclspps.v . . . 4 𝑉 = (mVR‘𝑇)
23 mclspps.h . . . 4 𝐻 = (mVH‘𝑇)
24 mclspps.w . . . 4 𝑊 = (mVars‘𝑇)
25 mclspps.6 . . . . . 6 ((𝜑𝑥𝑂) → (𝑆𝑥) ∈ (𝐾𝐶𝐵))
2625ralrimiva 3182 . . . . 5 (𝜑 → ∀𝑥𝑂 (𝑆𝑥) ∈ (𝐾𝐶𝐵))
275ffund 6518 . . . . . 6 (𝜑 → Fun 𝑆)
285fdmd 6523 . . . . . . 7 (𝜑 → dom 𝑆 = 𝐸)
2920, 28sseqtrrd 4008 . . . . . 6 (𝜑𝑂 ⊆ dom 𝑆)
30 funimass5 6825 . . . . . 6 ((Fun 𝑆𝑂 ⊆ dom 𝑆) → (𝑂 ⊆ (𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥𝑂 (𝑆𝑥) ∈ (𝐾𝐶𝐵)))
3127, 29, 30syl2anc 586 . . . . 5 (𝜑 → (𝑂 ⊆ (𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥𝑂 (𝑆𝑥) ∈ (𝐾𝐶𝐵)))
3226, 31mpbird 259 . . . 4 (𝜑𝑂 ⊆ (𝑆 “ (𝐾𝐶𝐵)))
3322, 3, 23mvhf 32805 . . . . . . 7 (𝑇 ∈ mFS → 𝐻:𝑉𝐸)
349, 33syl 17 . . . . . 6 (𝜑𝐻:𝑉𝐸)
3534ffvelrnda 6851 . . . . 5 ((𝜑𝑣𝑉) → (𝐻𝑣) ∈ 𝐸)
36 mclspps.7 . . . . 5 ((𝜑𝑣𝑉) → (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))
37 elpreima 6828 . . . . . . 7 (𝑆 Fn 𝐸 → ((𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))))
386, 37syl 17 . . . . . 6 (𝜑 → ((𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))))
3938adantr 483 . . . . 5 ((𝜑𝑣𝑉) → ((𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))))
4035, 36, 39mpbir2and 711 . . . 4 ((𝜑𝑣𝑉) → (𝐻𝑣) ∈ (𝑆 “ (𝐾𝐶𝐵)))
4193ad2ant1 1129 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝑇 ∈ mFS)
42 mclspps.2 . . . . . 6 (𝜑𝐾𝐷)
43423ad2ant1 1129 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝐾𝐷)
44 mclspps.3 . . . . . 6 (𝜑𝐵𝐸)
45443ad2ant1 1129 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝐵𝐸)
46133ad2ant1 1129 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
4713ad2ant1 1129 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝑆 ∈ ran 𝐿)
48253ad2antl1 1181 . . . . 5 (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) ∧ 𝑥𝑂) → (𝑆𝑥) ∈ (𝐾𝐶𝐵))
49363ad2antl1 1181 . . . . 5 (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) ∧ 𝑣𝑉) → (𝑆‘(𝐻𝑣)) ∈ (𝐾𝐶𝐵))
50 mclspps.8 . . . . . 6 ((𝜑 ∧ (𝑥𝑀𝑦𝑎 ∈ (𝑊‘(𝑆‘(𝐻𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻𝑦))))) → 𝑎𝐾𝑏)
51503ad2antl1 1181 . . . . 5 (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) ∧ (𝑥𝑀𝑦𝑎 ∈ (𝑊‘(𝑆‘(𝐻𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻𝑦))))) → 𝑎𝐾𝑏)
52 simp21 1202 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇))
53 simp22 1203 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → 𝑠 ∈ ran 𝐿)
54 simp23 1204 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵)))
55 simp3 1134 . . . . 5 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀))
567, 3, 8, 41, 43, 45, 11, 2, 22, 23, 24, 46, 47, 48, 49, 51, 52, 53, 54, 55mclsppslem 32830 . . . 4 ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻𝑧))) × (𝑊‘(𝑠‘(𝐻𝑤)))) ⊆ 𝑀)) → (𝑠𝑝) ∈ (𝑆 “ (𝐾𝐶𝐵)))
577, 3, 8, 9, 18, 20, 21, 2, 22, 23, 24, 32, 40, 56mclsind 32817 . . 3 (𝜑 → (𝑀𝐶𝑂) ⊆ (𝑆 “ (𝐾𝐶𝐵)))
5810, 11, 8elmpps 32820 . . . . 5 (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 ↔ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ∧ 𝑃 ∈ (𝑀𝐶𝑂)))
5958simprbi 499 . . . 4 (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽𝑃 ∈ (𝑀𝐶𝑂))
6013, 59syl 17 . . 3 (𝜑𝑃 ∈ (𝑀𝐶𝑂))
6157, 60sseldd 3968 . 2 (𝜑𝑃 ∈ (𝑆 “ (𝐾𝐶𝐵)))
62 elpreima 6828 . . 3 (𝑆 Fn 𝐸 → (𝑃 ∈ (𝑆 “ (𝐾𝐶𝐵)) ↔ (𝑃𝐸 ∧ (𝑆𝑃) ∈ (𝐾𝐶𝐵))))
6362simplbda 502 . 2 ((𝑆 Fn 𝐸𝑃 ∈ (𝑆 “ (𝐾𝐶𝐵))) → (𝑆𝑃) ∈ (𝐾𝐶𝐵))
646, 61, 63syl2anc 586 1 (𝜑 → (𝑆𝑃) ∈ (𝐾𝐶𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083  wal 1535   = wceq 1537  wcel 2114  wral 3138  cun 3934  wss 3936  cotp 4575   class class class wbr 5066   × cxp 5553  ccnv 5554  dom cdm 5555  ran crn 5556  cima 5558  Fun wfun 6349   Fn wfn 6350  wf 6351  cfv 6355  (class class class)co 7156  Fincfn 8509  mVRcmvar 32708  mAxcmax 32712  mExcmex 32714  mDVcmdv 32715  mVarscmvrs 32716  mSubstcmsub 32718  mVHcmvh 32719  mPreStcmpst 32720  mFScmfs 32723  mClscmcls 32724  mPPStcmpps 32725
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-ot 4576  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-oadd 8106  df-er 8289  df-map 8408  df-pm 8409  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-card 9368  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-nn 11639  df-2 11701  df-n0 11899  df-xnn0 11969  df-z 11983  df-uz 12245  df-fz 12894  df-fzo 13035  df-seq 13371  df-hash 13692  df-word 13863  df-lsw 13915  df-concat 13923  df-s1 13950  df-substr 14003  df-pfx 14033  df-struct 16485  df-ndx 16486  df-slot 16487  df-base 16489  df-sets 16490  df-ress 16491  df-plusg 16578  df-0g 16715  df-gsum 16716  df-mgm 17852  df-sgrp 17901  df-mnd 17912  df-mhm 17956  df-submnd 17957  df-frmd 18014  df-vrmd 18015  df-mrex 32733  df-mex 32734  df-mdv 32735  df-mvrs 32736  df-mrsub 32737  df-msub 32738  df-mvh 32739  df-mpst 32740  df-msr 32741  df-msta 32742  df-mfs 32743  df-mcls 32744  df-mpps 32745
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator