ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  copsex2t GIF version

Theorem copsex2t 4008
Description: Closed theorem form of copsex2g 4009. (Contributed by NM, 17-Feb-2013.)
Assertion
Ref Expression
copsex2t ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝐴𝑉𝐵𝑊)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
Distinct variable groups:   𝑥,𝑦,𝜓   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem copsex2t
StepHypRef Expression
1 elisset 2614 . . . 4 (𝐴𝑉 → ∃𝑥 𝑥 = 𝐴)
2 elisset 2614 . . . 4 (𝐵𝑊 → ∃𝑦 𝑦 = 𝐵)
31, 2anim12i 331 . . 3 ((𝐴𝑉𝐵𝑊) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
4 eeanv 1849 . . 3 (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
53, 4sylibr 132 . 2 ((𝐴𝑉𝐵𝑊) → ∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵))
6 nfa1 1475 . . . 4 𝑥𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
7 nfe1 1426 . . . . 5 𝑥𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
8 nfv 1462 . . . . 5 𝑥𝜓
97, 8nfbi 1522 . . . 4 𝑥(∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)
10 nfa2 1512 . . . . 5 𝑦𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
11 nfe1 1426 . . . . . . 7 𝑦𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
1211nfex 1569 . . . . . 6 𝑦𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
13 nfv 1462 . . . . . 6 𝑦𝜓
1412, 13nfbi 1522 . . . . 5 𝑦(∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)
15 opeq12 3580 . . . . . . . . 9 ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
16 copsexg 4007 . . . . . . . . . 10 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1716eqcoms 2085 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1815, 17syl 14 . . . . . . . 8 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1918adantl 271 . . . . . . 7 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
20 sp 1442 . . . . . . . . 9 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ∀𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)))
212019.21bi 1491 . . . . . . . 8 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)))
2221imp 122 . . . . . . 7 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝜑𝜓))
2319, 22bitr3d 188 . . . . . 6 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
2423ex 113 . . . . 5 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ((𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
2510, 14, 24exlimd 1529 . . . 4 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → (∃𝑦(𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
266, 9, 25exlimd 1529 . . 3 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
2726imp 122 . 2 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ ∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
285, 27sylan2 280 1 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝐴𝑉𝐵𝑊)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103  wal 1283   = wceq 1285  wex 1422  wcel 1434  cop 3409
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-pow 3956  ax-pr 3972
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-v 2604  df-un 2978  df-in 2980  df-ss 2987  df-pw 3392  df-sn 3412  df-pr 3413  df-op 3415
This theorem is referenced by:  opelopabt  4025
  Copyright terms: Public domain W3C validator