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

Theorem optoclOLD 5752
Description: Obsolete version of optocl 5751 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 5722 . . 3 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)))
2 opelxp 5692 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))
3 optocl.3 . . . . . . 7 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑)
42, 3sylbi 220 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) → 𝜑)
5 optocl.2 . . . . . 6 (⟨𝑥, 𝑦⟩ = 𝐴 → (𝜑 ↔ 𝜓))
64, 5imbitrid 247 . . . . 5 (⟨𝑥, 𝑦⟩ = 𝐴 → (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶) → 𝜓))
76imp 412 . . . 4 ((⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) → 𝜓)
87exlimivv 1967 . . 3 (∃𝑥∃𝑦(⟨𝑥, 𝑦⟩ = 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐶)) → 𝜓)
91, 8sylbi 220 . 2 (𝐴 ∈ (𝐵 × 𝐶) → 𝜓)
10 optocl.1 . 2 𝐷 = (𝐵 × 𝐶)
119, 10eleq2s 2882 1 (𝐴 ∈ 𝐷 → 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ⟨cop 4838   × cxp 5654
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-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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  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-opab 5172  df-xp 5662
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator