Theorem opreu2reu1 32503

Description: Equivalent definition of the double restricted existential uniqueness quantifier, using uniqueness of ordered pairs. (Contributed by Thierry Arnoux, 4-Jul-2023.)

Hypothesis

Ref	Expression
opreu2reu1.a	⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (𝜒 ↔ 𝜑))

Assertion

Ref	Expression
opreu2reu1	⊢ (∃!𝑥 ∈ 𝐴 , 𝑦 ∈ 𝐵𝜑 ↔ ∃!𝑝 ∈ (𝐴 × 𝐵)𝜒)

Distinct variable groups:   𝐴,𝑝,𝑥,𝑦   𝐵,𝑝,𝑥,𝑦   𝜒,𝑥,𝑦   𝜑,𝑝,𝑥,𝑦

Allowed substitution hint:   𝜒(𝑝)

Proof of Theorem opreu2reu1

Step	Hyp	Ref	Expression
1		df-2reu 32498	. 2 ⊢ (∃!𝑥 ∈ 𝐴 , 𝑦 ∈ 𝐵𝜑 ↔ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑))
2		opreu2reu1.a	. . 3 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (𝜒 ↔ 𝜑))
3	2	opreu2reurex 6314	. 2 ⊢ (∃!𝑝 ∈ (𝐴 × 𝐵)𝜒 ↔ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑))
4	1, 3	bitr4i 278	1 ⊢ (∃!𝑥 ∈ 𝐴 , 𝑦 ∈ 𝐵𝜑 ↔ ∃!𝑝 ∈ (𝐴 × 𝐵)𝜒)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wrex 3070  ∃!wreu 3378  ⟨cop 4632   × cxp 5683  ∃!w2reu 32497

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-iun 4993  df-opab 5206  df-xp 5691  df-rel 5692  df-2reu 32498

This theorem is referenced by: (None)