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

Theorem optoclOLD 5746
Description: Obsolete version of optocl 5745 as of 29-Dec-2025. (Contributed by NM, 5-Mar-1995.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
optocl.1 𝐷 = (𝐵 × 𝐶)
optocl.2 (⟨𝑥, 𝑦⟩ = 𝐴 → (𝜑 ↔ 𝜓))
optocl.3 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑)
Assertion
Ref Expression
optoclOLD (𝐴 ∈ 𝐷 → 𝜓)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝜓,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐷(𝑥, 𝑦)

Proof of Theorem optoclOLD
StepHypRef Expression
1 elxp3 5717 . . 3 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)))
2 opelxp 5687 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
3 optocl.3 . . . . . . 7 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑)
42, 3sylbi 220 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) → 𝜑)
5 optocl.2 . . . . . 6 (⟨𝑥, 𝑦⟩ = 𝐴 → (𝜑 ↔ 𝜓))
64, 5imbitrid 247 . . . . 5 (⟨𝑥, 𝑦⟩ = 𝐴 → (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) → 𝜓))
76imp 412 . . . 4 ((⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) → 𝜓)
87exlimivv 1965 . . 3 (∃𝑥∃𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) → 𝜓)
91, 8sylbi 220 . 2 (𝐴 ∈ (𝐵 × 𝐶) → 𝜓)
10 optocl.1 . 2 𝐷 = (𝐵 × 𝐶)
119, 10eleq2s 2879 1 (𝐴 ∈ 𝐷 → 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ⟨cop 4590   × cxp 5649
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5657
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator