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

Theorem nford 1560
Description: If in a context  x is not free in  ps and  ch, it is not free in  ( ps  \/  ch ). (Contributed by Jim Kingdon, 29-Oct-2019.)
Hypotheses
Ref Expression
nford.1  |-  ( ph  ->  F/ x ps )
nford.2  |-  ( ph  ->  F/ x ch )
Assertion
Ref Expression
nford  |-  ( ph  ->  F/ x ( ps  \/  ch ) )

Proof of Theorem nford
StepHypRef Expression
1 nford.1 . . . . 5  |-  ( ph  ->  F/ x ps )
2 nford.2 . . . . 5  |-  ( ph  ->  F/ x ch )
3 df-nf 1454 . . . . . . 7  |-  ( F/ x ps  <->  A. x
( ps  ->  A. x ps ) )
4 df-nf 1454 . . . . . . 7  |-  ( F/ x ch  <->  A. x
( ch  ->  A. x ch ) )
53, 4anbi12i 457 . . . . . 6  |-  ( ( F/ x ps  /\  F/ x ch )  <->  ( A. x ( ps  ->  A. x ps )  /\  A. x ( ch  ->  A. x ch ) ) )
65biimpi 119 . . . . 5  |-  ( ( F/ x ps  /\  F/ x ch )  -> 
( A. x ( ps  ->  A. x ps )  /\  A. x
( ch  ->  A. x ch ) ) )
71, 2, 6syl2anc 409 . . . 4  |-  ( ph  ->  ( A. x ( ps  ->  A. x ps )  /\  A. x
( ch  ->  A. x ch ) ) )
8 19.26 1474 . . . 4  |-  ( A. x ( ( ps 
->  A. x ps )  /\  ( ch  ->  A. x ch ) )  <->  ( A. x ( ps  ->  A. x ps )  /\  A. x ( ch  ->  A. x ch ) ) )
97, 8sylibr 133 . . 3  |-  ( ph  ->  A. x ( ( ps  ->  A. x ps )  /\  ( ch  ->  A. x ch )
) )
10 orc 707 . . . . . . 7  |-  ( ps 
->  ( ps  \/  ch ) )
1110alimi 1448 . . . . . 6  |-  ( A. x ps  ->  A. x
( ps  \/  ch ) )
1211imim2i 12 . . . . 5  |-  ( ( ps  ->  A. x ps )  ->  ( ps 
->  A. x ( ps  \/  ch ) ) )
13 olc 706 . . . . . . 7  |-  ( ch 
->  ( ps  \/  ch ) )
1413alimi 1448 . . . . . 6  |-  ( A. x ch  ->  A. x
( ps  \/  ch ) )
1514imim2i 12 . . . . 5  |-  ( ( ch  ->  A. x ch )  ->  ( ch 
->  A. x ( ps  \/  ch ) ) )
1612, 15jaao 714 . . . 4  |-  ( ( ( ps  ->  A. x ps )  /\  ( ch  ->  A. x ch )
)  ->  ( ( ps  \/  ch )  ->  A. x ( ps  \/  ch ) ) )
1716alimi 1448 . . 3  |-  ( A. x ( ( ps 
->  A. x ps )  /\  ( ch  ->  A. x ch ) )  ->  A. x
( ( ps  \/  ch )  ->  A. x
( ps  \/  ch ) ) )
189, 17syl 14 . 2  |-  ( ph  ->  A. x ( ( ps  \/  ch )  ->  A. x ( ps  \/  ch ) ) )
19 df-nf 1454 . 2  |-  ( F/ x ( ps  \/  ch )  <->  A. x ( ( ps  \/  ch )  ->  A. x ( ps  \/  ch ) ) )
2018, 19sylibr 133 1  |-  ( ph  ->  F/ x ( ps  \/  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    \/ wo 703   A.wal 1346   F/wnf 1453
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-gen 1442
This theorem depends on definitions:  df-bi 116  df-nf 1454
This theorem is referenced by:  nfifd  3553
  Copyright terms: Public domain W3C validator