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

Theorem pw1if 7486
Description: Expressing a truth value in terms of an  if expression. (Contributed by Jim Kingdon, 10-Jan-2026.)
Assertion
Ref Expression
pw1if  |-  ( A  e.  ~P 1o  ->  if ( A  =  1o ,  1o ,  (/) )  =  A )

Proof of Theorem pw1if
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 110 . . . . . 6  |-  ( ( A  e.  ~P 1o  /\  x  e.  if ( A  =  1o ,  1o ,  (/) ) )  ->  x  e.  if ( A  =  1o ,  1o ,  (/) ) )
2 elif 3621 . . . . . . 7  |-  ( x  e.  if ( A  =  1o ,  1o ,  (/) )  <->  ( ( A  =  1o  /\  x  e.  1o )  \/  ( -.  A  =  1o  /\  x  e.  (/) ) ) )
3 noel 3500 . . . . . . . . 9  |-  -.  x  e.  (/)
43intnan 937 . . . . . . . 8  |-  -.  ( -.  A  =  1o  /\  x  e.  (/) )
54biorfi 754 . . . . . . 7  |-  ( ( A  =  1o  /\  x  e.  1o )  <->  ( ( A  =  1o 
/\  x  e.  1o )  \/  ( -.  A  =  1o  /\  x  e.  (/) ) ) )
62, 5bitr4i 187 . . . . . 6  |-  ( x  e.  if ( A  =  1o ,  1o ,  (/) )  <->  ( A  =  1o  /\  x  e.  1o ) )
71, 6sylib 122 . . . . 5  |-  ( ( A  e.  ~P 1o  /\  x  e.  if ( A  =  1o ,  1o ,  (/) ) )  ->  ( A  =  1o  /\  x  e.  1o ) )
87simprd 114 . . . 4  |-  ( ( A  e.  ~P 1o  /\  x  e.  if ( A  =  1o ,  1o ,  (/) ) )  ->  x  e.  1o )
97simpld 112 . . . 4  |-  ( ( A  e.  ~P 1o  /\  x  e.  if ( A  =  1o ,  1o ,  (/) ) )  ->  A  =  1o )
108, 9eleqtrrd 2311 . . 3  |-  ( ( A  e.  ~P 1o  /\  x  e.  if ( A  =  1o ,  1o ,  (/) ) )  ->  x  e.  A
)
11 elex2 2820 . . . . 5  |-  ( x  e.  A  ->  E. y 
y  e.  A )
12 pw1m 7485 . . . . 5  |-  ( ( A  e.  ~P 1o  /\ 
E. y  y  e.  A )  ->  A  =  1o )
1311, 12sylan2 286 . . . 4  |-  ( ( A  e.  ~P 1o  /\  x  e.  A )  ->  A  =  1o )
14 simpr 110 . . . . 5  |-  ( ( A  e.  ~P 1o  /\  x  e.  A )  ->  x  e.  A
)
1514, 13eleqtrd 2310 . . . 4  |-  ( ( A  e.  ~P 1o  /\  x  e.  A )  ->  x  e.  1o )
1613, 15, 6sylanbrc 417 . . 3  |-  ( ( A  e.  ~P 1o  /\  x  e.  A )  ->  x  e.  if ( A  =  1o ,  1o ,  (/) ) )
1710, 16impbida 600 . 2  |-  ( A  e.  ~P 1o  ->  ( x  e.  if ( A  =  1o ,  1o ,  (/) )  <->  x  e.  A ) )
1817eqrdv 2229 1  |-  ( A  e.  ~P 1o  ->  if ( A  =  1o ,  1o ,  (/) )  =  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716    = wceq 1398   E.wex 1541    e. wcel 2202   (/)c0 3496   ifcif 3607   ~Pcpw 3656   1oc1o 6618
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 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-suc 4474  df-1o 6625
This theorem is referenced by:  pw1map  16700
  Copyright terms: Public domain W3C validator