Theorem subord-P3.43c.RC 351

Description: Inference Form of subord-P3.43c 350. †

Hypotheses

Ref	Expression
subord-P3.43c.RC.1	⊢ (𝜑 ↔ 𝜓)
subord-P3.43c.RC.2	⊢ (𝜒 ↔ 𝜗)

Assertion

Ref	Expression
subord-P3.43c.RC	⊢ ((𝜑 ∨ 𝜒) ↔ (𝜓 ∨ 𝜗))

Proof of Theorem subord-P3.43c.RC

Step	Hyp	Ref	Expression
1		subord-P3.43c.RC.1	. . . 4 ⊢ (𝜑 ↔ 𝜓)
2	1	ndtruei-P3.17 182	. . 3 ⊢ (⊤ → (𝜑 ↔ 𝜓))
3		subord-P3.43c.RC.2	. . . 4 ⊢ (𝜒 ↔ 𝜗)
4	3	ndtruei-P3.17 182	. . 3 ⊢ (⊤ → (𝜒 ↔ 𝜗))
5	2, 4	subord-P3.43c 350	. 2 ⊢ (⊤ → ((𝜑 ∨ 𝜒) ↔ (𝜓 ∨ 𝜗)))
6	5	ndtruee-P3.18 183	1 ⊢ ((𝜑 ∨ 𝜒) ↔ (𝜓 ∨ 𝜗))

Syntax hints:   ↔ wff-bi 104   ∨ wff-or 144  ⊤wff-true 153

This theorem was proved from axioms:  ax-L1 11  ax-L2 12  ax-L3 13  ax-MP 14

This theorem depends on definitions:  df-bi-D2.1 107  df-and-D2.2 133  df-or-D2.3 145  df-true-D2.4 155  df-rcp-AND3 161

This theorem is referenced by:  biasandor-P4.34a  491  nfrleq-P6  687