Theorem ioran 764

Description: Negated disjunction in terms of conjunction. This version of DeMorgan's law is a biconditional for all propositions (not just decidable ones), unlike oranim 793, anordc 969, or ianordc 911. Compare Theorem *4.56 of [WhiteheadRussell] p. 120. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 31-Jan-2015.)

Assertion

Ref	Expression
ioran	⊢ (¬ (𝜑 ∨ 𝜓) ↔ (¬ 𝜑 ∧ ¬ 𝜓))

Proof of Theorem ioran

Step	Hyp	Ref	Expression
1		pm2.45 750	. . 3 ⊢ (¬ (𝜑 ∨ 𝜓) → ¬ 𝜑)
2		pm2.46 751	. . 3 ⊢ (¬ (𝜑 ∨ 𝜓) → ¬ 𝜓)
3	1, 2	jca 306	. 2 ⊢ (¬ (𝜑 ∨ 𝜓) → (¬ 𝜑 ∧ ¬ 𝜓))
4		simpl 109	. . . . 5 ⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ¬ 𝜑)
5	4	con2i 636	. . . 4 ⊢ (𝜑 → ¬ (¬ 𝜑 ∧ ¬ 𝜓))
6		simpr 110	. . . . 5 ⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ¬ 𝜓)
7	6	con2i 636	. . . 4 ⊢ (𝜓 → ¬ (¬ 𝜑 ∧ ¬ 𝜓))
8	5, 7	jaoi 728	. . 3 ⊢ ((𝜑 ∨ 𝜓) → ¬ (¬ 𝜑 ∧ ¬ 𝜓))
9	8	con2i 636	. 2 ⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ¬ (𝜑 ∨ 𝜓))
10	3, 9	impbii 126	1 ⊢ (¬ (𝜑 ∨ 𝜓) ↔ (¬ 𝜑 ∧ ¬ 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 104   ↔ wb 105   ∨ wo 720

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

This proof depends on definitions:  df-bi 117

This theorem is used by:  pm4.56  792  nnexmid  862  dcor  948  3ioran  1024  3ori  1341  ecase2d  1392  unssdif  3466  difundi  3483  dcun  3637  sotricim  4468  sotritrieq  4470  en2lp  4701  poxp  6468  nntri2  6767  finexdc  7207  elssdc  7209  unfidisj  7229  fidcenumlemrks  7270  pw1nel3  7590  sucpw1nel3  7592  onntri45  7600  aptipr  8008  lttri3  8405  letr  8408  apirr  8933  apti  8950  elnnz  9654  xrlttri3  10199  xrletr  10210  exp3val  10978  bcval4  11190  hashunlem  11244  maxleast  11979  xrmaxlesup  12025  lcmval  12841  lcmcllem  12845  lcmgcdlem  12855  isprm3  12896  pcpremul  13072  ivthinc  15744  lgsdir2  16152  2lgslem3  16220  structiedg0val  16281  vtxd0nedgbfi  16540  vdegp1aid  16555  bj-nnor  16762  pwtrufal  17027  pwle2  17028