Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfso Unicode version

Theorem nfso 4067
 Description: Bound-variable hypothesis builder for total orders. (Contributed by Stefan O'Rear, 20-Jan-2015.)
Hypotheses
Ref Expression
nfpo.r
nfpo.a
Assertion
Ref Expression
nfso

Proof of Theorem nfso
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-iso 4062 . 2
2 nfpo.r . . . 4
3 nfpo.a . . . 4
42, 3nfpo 4066 . . 3
5 nfcv 2194 . . . . . . . 8
6 nfcv 2194 . . . . . . . 8
75, 2, 6nfbr 3836 . . . . . . 7
8 nfcv 2194 . . . . . . . . 9
95, 2, 8nfbr 3836 . . . . . . . 8
108, 2, 6nfbr 3836 . . . . . . . 8
119, 10nfor 1482 . . . . . . 7
127, 11nfim 1480 . . . . . 6
133, 12nfralxy 2377 . . . . 5
143, 13nfralxy 2377 . . . 4
153, 14nfralxy 2377 . . 3
164, 15nfan 1473 . 2
171, 16nfxfr 1379 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 101   wo 639  wnf 1365  wnfc 2181  wral 2323   class class class wbr 3792   wpo 4059   wor 4060 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-v 2576  df-un 2950  df-sn 3409  df-pr 3410  df-op 3412  df-br 3793  df-po 4061  df-iso 4062 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator