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

Theorem nfrmod 3031
 Description: Deduction version of nfrmo 3033. (Contributed by NM, 17-Jun-2017.)
Hypotheses
Ref Expression
nfreud.1
nfreud.2
nfreud.3
Assertion
Ref Expression
nfrmod

Proof of Theorem nfrmod
StepHypRef Expression
1 df-rmo 2815 . 2
2 nfreud.1 . . 3
3 nfcvf 2644 . . . . . 6
43adantl 466 . . . . 5
5 nfreud.2 . . . . . 6
65adantr 465 . . . . 5
74, 6nfeld 2627 . . . 4
8 nfreud.3 . . . . 5
98adantr 465 . . . 4
107, 9nfand 1925 . . 3
112, 10nfmod2 2297 . 2
121, 11nfxfrd 1646 1
 Colors of variables: wff setvar class Syntax hints:  -.wn 3  ->wi 4  /\wa 369  A.wal 1393  F/wnf 1616  e.wcel 1818  E*wmo 2283  F/_wnfc 2605  E*wrmo 2810 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435 This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1398  df-ex 1613  df-nf 1617  df-eu 2286  df-mo 2287  df-cleq 2449  df-clel 2452  df-nfc 2607  df-rmo 2815
 Copyright terms: Public domain W3C validator