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

Theorem nfpo 4366
Description: Bound-variable hypothesis builder for partial orders. (Contributed by Stefan O'Rear, 20-Jan-2015.)
Hypotheses
Ref Expression
nfpo.r  |-  F/_ x R
nfpo.a  |-  F/_ x A
Assertion
Ref Expression
nfpo  |-  F/ x  R  Po  A

Proof of Theorem nfpo
Dummy variables  a  b  c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-po 4361 . 2  |-  ( R  Po  A  <->  A. a  e.  A  A. b  e.  A  A. c  e.  A  ( -.  a R a  /\  (
( a R b  /\  b R c )  ->  a R
c ) ) )
2 nfpo.a . . 3  |-  F/_ x A
3 nfcv 2350 . . . . . . . 8  |-  F/_ x
a
4 nfpo.r . . . . . . . 8  |-  F/_ x R
53, 4, 3nfbr 4106 . . . . . . 7  |-  F/ x  a R a
65nfn 1682 . . . . . 6  |-  F/ x  -.  a R a
7 nfcv 2350 . . . . . . . . 9  |-  F/_ x
b
83, 4, 7nfbr 4106 . . . . . . . 8  |-  F/ x  a R b
9 nfcv 2350 . . . . . . . . 9  |-  F/_ x
c
107, 4, 9nfbr 4106 . . . . . . . 8  |-  F/ x  b R c
118, 10nfan 1589 . . . . . . 7  |-  F/ x
( a R b  /\  b R c )
123, 4, 9nfbr 4106 . . . . . . 7  |-  F/ x  a R c
1311, 12nfim 1596 . . . . . 6  |-  F/ x
( ( a R b  /\  b R c )  ->  a R c )
146, 13nfan 1589 . . . . 5  |-  F/ x
( -.  a R a  /\  ( ( a R b  /\  b R c )  -> 
a R c ) )
152, 14nfralxy 2546 . . . 4  |-  F/ x A. c  e.  A  ( -.  a R
a  /\  ( (
a R b  /\  b R c )  -> 
a R c ) )
162, 15nfralxy 2546 . . 3  |-  F/ x A. b  e.  A  A. c  e.  A  ( -.  a R
a  /\  ( (
a R b  /\  b R c )  -> 
a R c ) )
172, 16nfralxy 2546 . 2  |-  F/ x A. a  e.  A  A. b  e.  A  A. c  e.  A  ( -.  a R
a  /\  ( (
a R b  /\  b R c )  -> 
a R c ) )
181, 17nfxfr 1498 1  |-  F/ x  R  Po  A
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104   F/wnf 1484   F/_wnfc 2337   A.wral 2486   class class class wbr 4059    Po wpo 4359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-v 2778  df-un 3178  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-po 4361
This theorem is referenced by:  nfso  4367
  Copyright terms: Public domain W3C validator