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

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

Proof of Theorem copsex2t
StepHypRef Expression
1 elisset 2744 . . . 4 (𝐴𝑉 → ∃𝑥 𝑥 = 𝐴)
2 elisset 2744 . . . 4 (𝐵𝑊 → ∃𝑦 𝑦 = 𝐵)
31, 2anim12i 336 . . 3 ((𝐴𝑉𝐵𝑊) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
4 eeanv 1925 . . 3 (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
53, 4sylibr 133 . 2 ((𝐴𝑉𝐵𝑊) → ∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵))
6 nfa1 1534 . . . 4 𝑥𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
7 nfe1 1489 . . . . 5 𝑥𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
8 nfv 1521 . . . . 5 𝑥𝜓
97, 8nfbi 1582 . . . 4 𝑥(∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)
10 nfa2 1572 . . . . 5 𝑦𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
11 nfe1 1489 . . . . . . 7 𝑦𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
1211nfex 1630 . . . . . 6 𝑦𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
13 nfv 1521 . . . . . 6 𝑦𝜓
1412, 13nfbi 1582 . . . . 5 𝑦(∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)
15 opeq12 3767 . . . . . . . . 9 ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
16 copsexg 4229 . . . . . . . . . 10 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1716eqcoms 2173 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1815, 17syl 14 . . . . . . . 8 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1918adantl 275 . . . . . . 7 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
20 sp 1504 . . . . . . . . 9 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ∀𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)))
212019.21bi 1551 . . . . . . . 8 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)))
2221imp 123 . . . . . . 7 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝜑𝜓))
2319, 22bitr3d 189 . . . . . 6 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
2423ex 114 . . . . 5 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ((𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
2510, 14, 24exlimd 1590 . . . 4 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → (∃𝑦(𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
266, 9, 25exlimd 1590 . . 3 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
2726imp 123 . 2 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ ∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
285, 27sylan2 284 1 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝐴𝑉𝐵𝑊)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wal 1346   = wceq 1348  wex 1485  wcel 2141  cop 3586
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592
This theorem is referenced by:  opelopabt  4247
  Copyright terms: Public domain W3C validator