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

Theorem pm5.18dc 853
Description: Relationship between an equivalence and an equivalence with some negation, for decidable propositions. Based on theorem *5.18 of [WhiteheadRussell] p. 124. Given decidability, we can consider  -.  ( ph  <->  -.  ps ) to represent "negated exclusive-or". (Contributed by Jim Kingdon, 4-Apr-2018.)
Assertion
Ref Expression
pm5.18dc  |-  (DECID  ph  ->  (DECID  ps 
->  ( ( ph  <->  ps )  <->  -.  ( ph  <->  -.  ps )
) ) )

Proof of Theorem pm5.18dc
StepHypRef Expression
1 df-dc 805 . 2  |-  (DECID  ph  <->  ( ph  \/  -.  ph ) )
2 pm5.501 243 . . . . . . . 8  |-  ( ph  ->  ( -.  ps  <->  ( ph  <->  -. 
ps ) ) )
32a1d 22 . . . . . . 7  |-  ( ph  ->  (DECID  ps  ->  ( -.  ps 
<->  ( ph  <->  -.  ps )
) ) )
43con1biddc 846 . . . . . 6  |-  ( ph  ->  (DECID  ps  ->  ( -.  ( ph  <->  -.  ps )  <->  ps ) ) )
54imp 123 . . . . 5  |-  ( (
ph  /\ DECID  ps )  ->  ( -.  ( ph  <->  -.  ps )  <->  ps ) )
6 pm5.501 243 . . . . . 6  |-  ( ph  ->  ( ps  <->  ( ph  <->  ps ) ) )
76adantr 274 . . . . 5  |-  ( (
ph  /\ DECID  ps )  ->  ( ps 
<->  ( ph  <->  ps )
) )
85, 7bitr2d 188 . . . 4  |-  ( (
ph  /\ DECID  ps )  ->  (
( ph  <->  ps )  <->  -.  ( ph 
<->  -.  ps ) ) )
98ex 114 . . 3  |-  ( ph  ->  (DECID  ps  ->  ( ( ph 
<->  ps )  <->  -.  ( ph 
<->  -.  ps ) ) ) )
10 dcn 812 . . . . . . 7  |-  (DECID  ps  -> DECID  -.  ps )
11 nbn2 671 . . . . . . . . 9  |-  ( -. 
ph  ->  ( -.  -.  ps 
<->  ( ph  <->  -.  ps )
) )
1211a1d 22 . . . . . . . 8  |-  ( -. 
ph  ->  (DECID  -.  ps  ->  ( -.  -.  ps  <->  ( ph  <->  -. 
ps ) ) ) )
1312con1biddc 846 . . . . . . 7  |-  ( -. 
ph  ->  (DECID  -.  ps  ->  ( -.  ( ph  <->  -.  ps )  <->  -. 
ps ) ) )
1410, 13syl5 32 . . . . . 6  |-  ( -. 
ph  ->  (DECID  ps  ->  ( -.  ( ph  <->  -.  ps )  <->  -. 
ps ) ) )
1514imp 123 . . . . 5  |-  ( ( -.  ph  /\ DECID  ps )  ->  ( -.  ( ph  <->  -.  ps )  <->  -. 
ps ) )
16 nbn2 671 . . . . . 6  |-  ( -. 
ph  ->  ( -.  ps  <->  (
ph 
<->  ps ) ) )
1716adantr 274 . . . . 5  |-  ( ( -.  ph  /\ DECID  ps )  ->  ( -.  ps  <->  ( ph  <->  ps )
) )
1815, 17bitr2d 188 . . . 4  |-  ( ( -.  ph  /\ DECID  ps )  ->  (
( ph  <->  ps )  <->  -.  ( ph 
<->  -.  ps ) ) )
1918ex 114 . . 3  |-  ( -. 
ph  ->  (DECID  ps  ->  ( ( ph 
<->  ps )  <->  -.  ( ph 
<->  -.  ps ) ) ) )
209, 19jaoi 690 . 2  |-  ( (
ph  \/  -.  ph )  ->  (DECID  ps  ->  ( ( ph 
<->  ps )  <->  -.  ( ph 
<->  -.  ps ) ) ) )
211, 20sylbi 120 1  |-  (DECID  ph  ->  (DECID  ps 
->  ( ( ph  <->  ps )  <->  -.  ( ph  <->  -.  ps )
) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 682  DECID wdc 804
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-in1 588  ax-in2 589  ax-io 683
This theorem depends on definitions:  df-bi 116  df-stab 801  df-dc 805
This theorem is referenced by:  xor3dc  1350  dfbi3dc  1360
  Copyright terms: Public domain W3C validator