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

Theorem un0 3556
Description: The union of a class with the empty set is itself. Dual of inv1 3559. Theorem 24 of [Suppes] p. 27. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
un0  |-  ( A  u.  (/) )  =  A

Proof of Theorem un0
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 noel 3525 . . . 4  |-  -.  x  e.  (/)
21biorfi 758 . . 3  |-  ( x  e.  A  <->  ( x  e.  A  \/  x  e.  (/) ) )
32bicomi 132 . 2  |-  ( ( x  e.  A  \/  x  e.  (/) )  <->  x  e.  A )
43uneqri 3371 1  |-  ( A  u.  (/) )  =  A
Colors of variables:    wff set class
This proof depends on syntax axioms:    \/ wo 720    = wceq 1402    e. wcel 2209    u. cun 3218   (/)c0 3520
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-dif 3222  df-un 3224  df-nul 3521
This theorem is used by:  un00  3567  disjssun  3588  difun2  3607  difdifdirss  3612  if0ab  3641  disjpr2  3773  prprc1  3821  diftpsn3  3856  iununir  4096  exmid1stab  4345  suc0  4556  sucprc  4557  fresaunres2disj  5570  fvun1  5769  fmptpr  5907  fvunsng  5909  fvsnun1  5912  fvsnun2  5913  fsnunfv  5916  fsnunres  5917  rdg0  6658  omv2  6738  unsnfidcex  7227  unfidisj  7229  undifdc  7231  ssfirab  7244  dju0en  7570  djuassen  7573  fzsuc2  10486  fseq1p1m1  10501  hashunlem  11244  ballotfilemfp1  13231  ennnfonelem1  13298  setsresg  13390  setsslid  13403  gsump1  14157  birthdaylem2  16088  lgsquadlem2  16197
  Copyright terms: Public domain W3C validator