Theorem opreu2reu1 33155

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 33150	. 2 ⊢ (∃!𝑥 ∈ 𝐴 , 𝑦 ∈ 𝐵𝜑 ↔ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑))
2		opreu2reu1.a	. . 3 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (𝜒 ↔ 𝜑))
3	2	opreu2reurex 6318	. 2 ⊢ (∃!𝑝 ∈ (𝐴 × 𝐵)𝜒 ↔ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃!𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑))
4	1, 3	bitr4i 281	1 ⊢ (∃!𝑥 ∈ 𝐴 , 𝑦 ∈ 𝐵𝜑 ↔ ∃!𝑝 ∈ (𝐴 × 𝐵)𝜒)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wrex 3090  ∃!wreu 3367  ⟨cop 4838   × cxp 5654  ∃!w2reu 33149

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-iun 4956  df-opab 5172  df-xp 5662  df-rel 5663  df-2reu 33150

This theorem is used by: (None)