Theorem uncompl 4075

Description: Union with complement. (Contributed by SF, 2-Jan-2018.)

Assertion

Ref	Expression
uncompl	⊢ (A ∪ ∼ A) = V

Proof of Theorem uncompl

Step	Hyp	Ref	Expression
1		df-un 3215	. 2 ⊢ (A ∪ ∼ A) = ( ∼ A ⩃ ∼ ∼ A)
2		nincompl 4073	. 2 ⊢ ( ∼ A ⩃ ∼ ∼ A) = V
3	1, 2	eqtri 2373	1 ⊢ (A ∪ ∼ A) = V

Syntax hints:   = wceq 1642  Vcvv 2860   ⩃ cnin 3205   ∼ ccompl 3206   ∪ cun 3208

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-v 2862  df-nin 3212  df-compl 3213  df-un 3215

This theorem is referenced by:  ssofss  4077  vvex  4110  vfintle  4547  vfin1cltv  4548  fnfullfun  5859