Theorem cad0OLD 1621

Description: Obsolete version of cad0 1620 as of 21-Sep-2024. (Contributed by Mario Carneiro, 8-Sep-2016.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
cad0OLD	⊢ (¬ 𝜒 → (cadd(𝜑, 𝜓, 𝜒) ↔ (𝜑 ∧ 𝜓)))

Proof of Theorem cad0OLD

Step	Hyp	Ref	Expression
1		df-cad 1609	. 2 ⊢ (cadd(𝜑, 𝜓, 𝜒) ↔ ((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))))
2		idd 24	. . . 4 ⊢ (¬ 𝜒 → ((𝜑 ∧ 𝜓) → (𝜑 ∧ 𝜓)))
3		pm2.21 123	. . . . 5 ⊢ (¬ 𝜒 → (𝜒 → (𝜑 ∧ 𝜓)))
4	3	adantrd 492	. . . 4 ⊢ (¬ 𝜒 → ((𝜒 ∧ (𝜑 ⊻ 𝜓)) → (𝜑 ∧ 𝜓)))
5	2, 4	jaod 856	. . 3 ⊢ (¬ 𝜒 → (((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))) → (𝜑 ∧ 𝜓)))
6		orc 864	. . 3 ⊢ ((𝜑 ∧ 𝜓) → ((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))))
7	5, 6	impbid1 224	. 2 ⊢ (¬ 𝜒 → (((𝜑 ∧ 𝜓) ∨ (𝜒 ∧ (𝜑 ⊻ 𝜓))) ↔ (𝜑 ∧ 𝜓)))
8	1, 7	bitrid 282	1 ⊢ (¬ 𝜒 → (cadd(𝜑, 𝜓, 𝜒) ↔ (𝜑 ∧ 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 844   ⊻ wxo 1506  caddwcad 1608

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-cad 1609

This theorem is referenced by: (None)