MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elsnxpOLD Structured version   Visualization version   GIF version

Theorem elsnxpOLD 5716
Description: Obsolete proof of elsnxp 5715 as of 14-Jul-2021. (Contributed by Thierry Arnoux, 10-Apr-2020.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
elsnxpOLD (𝑋𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩))
Distinct variable groups:   𝑦,𝐴   𝑦,𝑉   𝑦,𝑋   𝑦,𝑍

Proof of Theorem elsnxpOLD
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elxp 5165 . . . 4 (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
2 df-rex 2947 . . . . . . . 8 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
3 an13 857 . . . . . . . . 9 ((𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ (𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
43exbii 1814 . . . . . . . 8 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) ↔ ∃𝑦(𝑦𝐴 ∧ (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩)))
52, 4bitr4i 267 . . . . . . 7 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ ∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)))
6 velsn 4226 . . . . . . . . . 10 (𝑥 ∈ {𝑋} ↔ 𝑥 = 𝑋)
76anbi1i 731 . . . . . . . . 9 ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) ↔ (𝑥 = 𝑋𝑍 = ⟨𝑥, 𝑦⟩))
8 simpr 476 . . . . . . . . . 10 ((𝑥 = 𝑋𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑥, 𝑦⟩)
9 opeq1 4433 . . . . . . . . . . 11 (𝑥 = 𝑋 → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
109adantr 480 . . . . . . . . . 10 ((𝑥 = 𝑋𝑍 = ⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑦⟩)
118, 10eqtrd 2685 . . . . . . . . 9 ((𝑥 = 𝑋𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
127, 11sylbi 207 . . . . . . . 8 ((𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
1312reximi 3040 . . . . . . 7 (∃𝑦𝐴 (𝑥 ∈ {𝑋} ∧ 𝑍 = ⟨𝑥, 𝑦⟩) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
145, 13sylbir 225 . . . . . 6 (∃𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
1514eximi 1802 . . . . 5 (∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑥𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
16 19.9v 1953 . . . . 5 (∃𝑥𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩ ↔ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
1715, 16sylib 208 . . . 4 (∃𝑥𝑦(𝑍 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ {𝑋} ∧ 𝑦𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
181, 17sylbi 207 . . 3 (𝑍 ∈ ({𝑋} × 𝐴) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
1918adantl 481 . 2 ((𝑋𝑉𝑍 ∈ ({𝑋} × 𝐴)) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
20 nfv 1883 . . . 4 𝑦 𝑋𝑉
21 nfre1 3034 . . . 4 𝑦𝑦𝐴 𝑍 = ⟨𝑋, 𝑦
2220, 21nfan 1868 . . 3 𝑦(𝑋𝑉 ∧ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
23 simpr 476 . . . . 5 (((𝑋𝑉𝑦𝐴) ∧ 𝑍 = ⟨𝑋, 𝑦⟩) → 𝑍 = ⟨𝑋, 𝑦⟩)
24 snidg 4239 . . . . . . . 8 (𝑋𝑉𝑋 ∈ {𝑋})
2524adantr 480 . . . . . . 7 ((𝑋𝑉𝑦𝐴) → 𝑋 ∈ {𝑋})
26 simpr 476 . . . . . . 7 ((𝑋𝑉𝑦𝐴) → 𝑦𝐴)
27 opelxp 5180 . . . . . . . 8 (⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴) ↔ (𝑋 ∈ {𝑋} ∧ 𝑦𝐴))
2827biimpri 218 . . . . . . 7 ((𝑋 ∈ {𝑋} ∧ 𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
2925, 26, 28syl2anc 694 . . . . . 6 ((𝑋𝑉𝑦𝐴) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
3029adantr 480 . . . . 5 (((𝑋𝑉𝑦𝐴) ∧ 𝑍 = ⟨𝑋, 𝑦⟩) → ⟨𝑋, 𝑦⟩ ∈ ({𝑋} × 𝐴))
3123, 30eqeltrd 2730 . . . 4 (((𝑋𝑉𝑦𝐴) ∧ 𝑍 = ⟨𝑋, 𝑦⟩) → 𝑍 ∈ ({𝑋} × 𝐴))
3231adantllr 755 . . 3 ((((𝑋𝑉 ∧ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩) ∧ 𝑦𝐴) ∧ 𝑍 = ⟨𝑋, 𝑦⟩) → 𝑍 ∈ ({𝑋} × 𝐴))
33 simpr 476 . . 3 ((𝑋𝑉 ∧ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩) → ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩)
3422, 32, 33r19.29af 3105 . 2 ((𝑋𝑉 ∧ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩) → 𝑍 ∈ ({𝑋} × 𝐴))
3519, 34impbida 895 1 (𝑋𝑉 → (𝑍 ∈ ({𝑋} × 𝐴) ↔ ∃𝑦𝐴 𝑍 = ⟨𝑋, 𝑦⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1523  wex 1744  wcel 2030  wrex 2942  {csn 4210  cop 4216   × cxp 5141
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-opab 4746  df-xp 5149
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator