Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  frlmrcl Structured version   Unicode version

Theorem frlmrcl 19257
 Description: If a free module is inhabited, this is sufficient to conclude that the ring expression defines a set. (Contributed by Stefan O'Rear, 3-Feb-2015.)
Hypotheses
Ref Expression
frlmval.f freeLMod
frlmrcl.b
Assertion
Ref Expression
frlmrcl

Proof of Theorem frlmrcl
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frlmval.f . 2 freeLMod
2 frlmrcl.b . 2
3 df-frlm 19247 . . 3 freeLMod m ringLMod
43reldmmpt2 6412 . 2 freeLMod
51, 2, 4strov2rcl 15132 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wceq 1437   wcel 1867  cvv 3078  csn 3993   cxp 4843  cfv 5592  (class class class)co 6296  cbs 15081  ringLModcrglmod 18333   m cdsmm 19231   freeLMod cfrlm 19246 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1838  ax-8 1869  ax-9 1871  ax-10 1886  ax-11 1891  ax-12 1904  ax-13 2052  ax-ext 2398  ax-sep 4539  ax-nul 4547  ax-pow 4594  ax-pr 4652 This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3an 984  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-eu 2267  df-mo 2268  df-clab 2406  df-cleq 2412  df-clel 2415  df-nfc 2570  df-ne 2618  df-ral 2778  df-rex 2779  df-rab 2782  df-v 3080  df-sbc 3297  df-dif 3436  df-un 3438  df-in 3440  df-ss 3447  df-nul 3759  df-if 3907  df-sn 3994  df-pr 3996  df-op 4000  df-uni 4214  df-br 4418  df-opab 4476  df-mpt 4477  df-id 4760  df-xp 4851  df-rel 4852  df-cnv 4853  df-co 4854  df-dm 4855  df-iota 5556  df-fun 5594  df-fv 5600  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-slot 15085  df-base 15086  df-frlm 19247 This theorem is referenced by:  frlmbasfsupp  19258  frlmbasmap  19259  frlmvscafval  19265
 Copyright terms: Public domain W3C validator