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

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

Proof of Theorem copsex2t
StepHypRef Expression
1 elisset 2751 . . . 4 (𝐴𝑉 → ∃𝑥 𝑥 = 𝐴)
2 elisset 2751 . . . 4 (𝐵𝑊 → ∃𝑦 𝑦 = 𝐵)
31, 2anim12i 338 . . 3 ((𝐴𝑉𝐵𝑊) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
4 eeanv 1932 . . 3 (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
53, 4sylibr 134 . 2 ((𝐴𝑉𝐵𝑊) → ∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵))
6 nfa1 1541 . . . 4 𝑥𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
7 nfe1 1496 . . . . 5 𝑥𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
8 nfv 1528 . . . . 5 𝑥𝜓
97, 8nfbi 1589 . . . 4 𝑥(∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)
10 nfa2 1579 . . . . 5 𝑦𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
11 nfe1 1496 . . . . . . 7 𝑦𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
1211nfex 1637 . . . . . 6 𝑦𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
13 nfv 1528 . . . . . 6 𝑦𝜓
1412, 13nfbi 1589 . . . . 5 𝑦(∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)
15 opeq12 3778 . . . . . . . . 9 ((𝑥 = 𝐴𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
16 copsexg 4241 . . . . . . . . . 10 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1716eqcoms 2180 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1815, 17syl 14 . . . . . . . 8 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
1918adantl 277 . . . . . . 7 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝜑 ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
20 sp 1511 . . . . . . . . 9 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ∀𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)))
212019.21bi 1558 . . . . . . . 8 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)))
2221imp 124 . . . . . . 7 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (𝜑𝜓))
2319, 22bitr3d 190 . . . . . 6 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝑥 = 𝐴𝑦 = 𝐵)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
2423ex 115 . . . . 5 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → ((𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
2510, 14, 24exlimd 1597 . . . 4 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → (∃𝑦(𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
266, 9, 25exlimd 1597 . . 3 (∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) → (∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓)))
2726imp 124 . 2 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ ∃𝑥𝑦(𝑥 = 𝐴𝑦 = 𝐵)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
285, 27sylan2 286 1 ((∀𝑥𝑦((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓)) ∧ (𝐴𝑉𝐵𝑊)) → (∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ 𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1351   = wceq 1353  wex 1492  wcel 2148  cop 3594
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600
This theorem is referenced by:  opelopabt  4259
  Copyright terms: Public domain W3C validator