Theorem ralpr 4634

Description: Convert a restricted universal quantification over a pair to a conjunction. (Contributed by NM, 3-Jun-2007.) (Revised by Mario Carneiro, 23-Apr-2015.)

Hypotheses

Ref	Expression
ralpr.1	⊢ 𝐴 ∈ V
ralpr.2	⊢ 𝐵 ∈ V
ralpr.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
ralpr.4	⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))

Assertion

Ref	Expression
ralpr	⊢ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜓,𝑥   𝜒,𝑥

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem ralpr

Step	Hyp	Ref	Expression
1		ralpr.1	. 2 ⊢ 𝐴 ∈ V
2		ralpr.2	. 2 ⊢ 𝐵 ∈ V
3		ralpr.3	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
4		ralpr.4	. . 3 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))
5	3, 4	ralprg 4630	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒)))
6	1, 2, 5	mp2an 693	1 ⊢ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3049  Vcvv 3427  {cpr 4559

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-ral 3050  df-rex 3060  df-v 3429  df-un 3890  df-sn 4558  df-pr 4560

This theorem is referenced by:  fprb  7138  fzprval  13528  fvinim0ffz  13733  wwlktovf1  14908  xpsfrnel  17515  xpsle  17532  isdrs2  18261  pmtrsn  19483  iblcnlem1  25743  lfuhgr1v0e  29311  nbgr2vtx1edg  29407  nbuhgr2vtx1edgb  29409  umgr2v2evd2  29584  2wlklem  29722  dfpth2  29785  2wlkdlem5  29985  2wlkdlem10  29991  clwwlknonex2lem2  30166  3pthdlem1  30222  upgr4cycl4dv4e  30243  subfacp1lem3  35352  mh-infprim2bi  36717  poimirlem1  37930  paireqne  47959  requad2  48087  ldepsnlinc  48972  rrx2pnecoorneor  49179  rrx2line  49204  rrx2linest  49206