Theorem ralprgf 4697

Description: Convert a restricted universal quantification over a pair to a conjunction, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 17-Sep-2011.) (Revised by AV, 8-Apr-2023.)

Hypotheses

Ref	Expression
ralprgf.1	⊢ Ⅎ𝑥𝜓
ralprgf.2	⊢ Ⅎ𝑥𝜒
ralprgf.a	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
ralprgf.b	⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))

Assertion

Ref	Expression
ralprgf	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)   𝜒(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem ralprgf

Step	Hyp	Ref	Expression
1		df-pr 4632	. . . 4 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
2	1	raleqi 3324	. . 3 ⊢ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ ∀𝑥 ∈ ({𝐴} ∪ {𝐵})𝜑)
3		ralunb 4192	. . 3 ⊢ (∀𝑥 ∈ ({𝐴} ∪ {𝐵})𝜑 ↔ (∀𝑥 ∈ {𝐴}𝜑 ∧ ∀𝑥 ∈ {𝐵}𝜑))
4	2, 3	bitri 275	. 2 ⊢ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (∀𝑥 ∈ {𝐴}𝜑 ∧ ∀𝑥 ∈ {𝐵}𝜑))
5		ralprgf.1	. . . 4 ⊢ Ⅎ𝑥𝜓
6		ralprgf.a	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
7	5, 6	ralsngf 4676	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ {𝐴}𝜑 ↔ 𝜓))
8		ralprgf.2	. . . 4 ⊢ Ⅎ𝑥𝜒
9		ralprgf.b	. . . 4 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))
10	8, 9	ralsngf 4676	. . 3 ⊢ (𝐵 ∈ 𝑊 → (∀𝑥 ∈ {𝐵}𝜑 ↔ 𝜒))
11	7, 10	bi2anan9 638	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∀𝑥 ∈ {𝐴}𝜑 ∧ ∀𝑥 ∈ {𝐵}𝜑) ↔ (𝜓 ∧ 𝜒)))
12	4, 11	bitrid 283	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542  Ⅎwnf 1786   ∈ wcel 2107  ∀wral 3062   ∪ cun 3947  {csn 4629  {cpr 4631

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-12 2172  ax-ext 2704

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-v 3477  df-sbc 3779  df-un 3954  df-sn 4630  df-pr 4632

This theorem is referenced by:  ralprgOLD  4700