Theorem reuprg 4663

Description: Convert a restricted existential uniqueness over a pair to a disjunction and an implication . (Contributed by AV, 2-Apr-2023.)

Hypotheses

Ref	Expression
reuprg.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
reuprg.2	⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))

Assertion

Ref	Expression
reuprg	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃!𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ ((𝜓 ∨ 𝜒) ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵))))

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

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

Proof of Theorem reuprg

Step	Hyp	Ref	Expression
1		reuprg.1	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2		reuprg.2	. . 3 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))
3	1, 2	reuprg0 4662	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃!𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ ((𝜓 ∧ (𝜒 → 𝐴 = 𝐵)) ∨ (𝜒 ∧ (𝜓 → 𝐴 = 𝐵)))))
4		orddi 1027	. . 3 ⊢ (((𝜓 ∧ (𝜒 → 𝐴 = 𝐵)) ∨ (𝜒 ∧ (𝜓 → 𝐴 = 𝐵))) ↔ (((𝜓 ∨ 𝜒) ∧ (𝜓 ∨ (𝜓 → 𝐴 = 𝐵))) ∧ (((𝜒 → 𝐴 = 𝐵) ∨ 𝜒) ∧ ((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵)))))
5		curryax 907	. . . . . 6 ⊢ (𝜓 ∨ (𝜓 → 𝐴 = 𝐵))
6	5	biantru 539	. . . . 5 ⊢ ((𝜓 ∨ 𝜒) ↔ ((𝜓 ∨ 𝜒) ∧ (𝜓 ∨ (𝜓 → 𝐴 = 𝐵))))
7	6	bicomi 227	. . . 4 ⊢ (((𝜓 ∨ 𝜒) ∧ (𝜓 ∨ (𝜓 → 𝐴 = 𝐵))) ↔ (𝜓 ∨ 𝜒))
8		curryax 907	. . . . . . . 8 ⊢ (𝜒 ∨ (𝜒 → 𝐴 = 𝐵))
9		orcom 884	. . . . . . . 8 ⊢ (((𝜒 → 𝐴 = 𝐵) ∨ 𝜒) ↔ (𝜒 ∨ (𝜒 → 𝐴 = 𝐵)))
10	8, 9	mpbir 234	. . . . . . 7 ⊢ ((𝜒 → 𝐴 = 𝐵) ∨ 𝜒)
11	10	biantrur 540	. . . . . 6 ⊢ (((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵)) ↔ (((𝜒 → 𝐴 = 𝐵) ∨ 𝜒) ∧ ((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵))))
12	11	bicomi 227	. . . . 5 ⊢ ((((𝜒 → 𝐴 = 𝐵) ∨ 𝜒) ∧ ((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵))) ↔ ((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵)))
13		pm4.79 1021	. . . . 5 ⊢ (((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵)) ↔ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵))
14	12, 13	bitri 278	. . . 4 ⊢ ((((𝜒 → 𝐴 = 𝐵) ∨ 𝜒) ∧ ((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵))) ↔ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵))
15	7, 14	anbi12i 640	. . 3 ⊢ ((((𝜓 ∨ 𝜒) ∧ (𝜓 ∨ (𝜓 → 𝐴 = 𝐵))) ∧ (((𝜒 → 𝐴 = 𝐵) ∨ 𝜒) ∧ ((𝜒 → 𝐴 = 𝐵) ∨ (𝜓 → 𝐴 = 𝐵)))) ↔ ((𝜓 ∨ 𝜒) ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵)))
16	4, 15	bitri 278	. 2 ⊢ (((𝜓 ∧ (𝜒 → 𝐴 = 𝐵)) ∨ (𝜒 ∧ (𝜓 → 𝐴 = 𝐵))) ↔ ((𝜓 ∨ 𝜒) ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵)))
17	3, 16	bitrdi 290	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃!𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ ((𝜓 ∨ 𝜒) ∧ ((𝜒 ∧ 𝜓) → 𝐴 = 𝐵))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2146  ∃!wreu 3366  {cpr 4589

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-v 3455  df-sbc 3742  df-un 4153  df-sn 4588  df-pr 4590

This theorem is used by:  reurexprg  4664