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

Theorem iftrueb01 7533
Description: Using an  if expression to represent a truth value by  (/) or  1o. Unlike some theorems using  if,  ph does not need to be decidable. (Contributed by Jim Kingdon, 9-Jan-2026.)
Assertion
Ref Expression
iftrueb01  |-  ( if ( ph ,  1o ,  (/) )  =  1o  <->  ph )

Proof of Theorem iftrueb01
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 0lt1o 6673 . . . 4  |-  (/)  e.  1o
2 elex2 2830 . . . 4  |-  ( (/)  e.  1o  ->  E. x  x  e.  1o )
31, 2ax-mp 5 . . 3  |-  E. x  x  e.  1o
4 eleq2 2296 . . . . . 6  |-  ( if ( ph ,  1o ,  (/) )  =  1o 
->  ( x  e.  if ( ph ,  1o ,  (/) )  <->  x  e.  1o ) )
5 elif 3634 . . . . . . 7  |-  ( x  e.  if ( ph ,  1o ,  (/) )  <->  ( ( ph  /\  x  e.  1o )  \/  ( -.  ph 
/\  x  e.  (/) ) ) )
6 noel 3512 . . . . . . . . 9  |-  -.  x  e.  (/)
76intnan 937 . . . . . . . 8  |-  -.  ( -.  ph  /\  x  e.  (/) )
87biorfi 754 . . . . . . 7  |-  ( (
ph  /\  x  e.  1o )  <->  ( ( ph  /\  x  e.  1o )  \/  ( -.  ph  /\  x  e.  (/) ) ) )
95, 8bitr4i 187 . . . . . 6  |-  ( x  e.  if ( ph ,  1o ,  (/) )  <->  ( ph  /\  x  e.  1o ) )
104, 9bitr3di 195 . . . . 5  |-  ( if ( ph ,  1o ,  (/) )  =  1o 
->  ( x  e.  1o  <->  (
ph  /\  x  e.  1o ) ) )
11 pm4.71r 390 . . . . 5  |-  ( ( x  e.  1o  ->  ph )  <->  ( x  e.  1o  <->  ( ph  /\  x  e.  1o )
) )
1210, 11sylibr 134 . . . 4  |-  ( if ( ph ,  1o ,  (/) )  =  1o 
->  ( x  e.  1o  ->  ph ) )
1312exlimdv 1868 . . 3  |-  ( if ( ph ,  1o ,  (/) )  =  1o 
->  ( E. x  x  e.  1o  ->  ph )
)
143, 13mpi 15 . 2  |-  ( if ( ph ,  1o ,  (/) )  =  1o 
->  ph )
15 iftrue 3627 . 2  |-  ( ph  ->  if ( ph ,  1o ,  (/) )  =  1o )
1614, 15impbii 126 1  |-  ( if ( ph ,  1o ,  (/) )  =  1o  <->  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716    = wceq 1398   E.wex 1541    e. wcel 2203   (/)c0 3508   ifcif 3620   1oc1o 6640
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214  ax-nul 4236
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-dif 3213  df-un 3215  df-nul 3509  df-if 3621  df-sn 3695  df-suc 4492  df-1o 6647
This theorem is referenced by:  pw1map  16769
  Copyright terms: Public domain W3C validator