Theorem 2albiim 1891

Description: Split a biconditional and distribute two quantifiers. (Contributed by NM, 3-Feb-2005.)

Assertion

Ref	Expression
2albiim	⊢ (∀𝑥∀𝑦(𝜑 ↔ 𝜓) ↔ (∀𝑥∀𝑦(𝜑 → 𝜓) ∧ ∀𝑥∀𝑦(𝜓 → 𝜑)))

Proof of Theorem 2albiim

Step	Hyp	Ref	Expression
1		albiim 1890	. . 3 ⊢ (∀𝑦(𝜑 ↔ 𝜓) ↔ (∀𝑦(𝜑 → 𝜓) ∧ ∀𝑦(𝜓 → 𝜑)))
2	1	albii 1821	. 2 ⊢ (∀𝑥∀𝑦(𝜑 ↔ 𝜓) ↔ ∀𝑥(∀𝑦(𝜑 → 𝜓) ∧ ∀𝑦(𝜓 → 𝜑)))
3		19.26 1871	. 2 ⊢ (∀𝑥(∀𝑦(𝜑 → 𝜓) ∧ ∀𝑦(𝜓 → 𝜑)) ↔ (∀𝑥∀𝑦(𝜑 → 𝜓) ∧ ∀𝑥∀𝑦(𝜓 → 𝜑)))
4	2, 3	bitri 278	1 ⊢ (∀𝑥∀𝑦(𝜑 ↔ 𝜓) ↔ (∀𝑥∀𝑦(𝜑 → 𝜓) ∧ ∀𝑥∀𝑦(𝜓 → 𝜑)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536

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

This theorem depends on definitions:  df-bi 210  df-an 400

This theorem is referenced by:  sbnf2  2366  2eu6  2719  eqopab2bw  5400  eqopab2b  5404  eqrel  5622  eqrelrel  5634  eqoprab2bw  7203  eqoprab2b  7204  eqrelrd2  30380  eqrel2  35717  relcnveq2  35740  elrelscnveq2  35893  pm14.123a  41129