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

Theorem copsex4g 4065
Description: An implicit substitution inference for 2 ordered pairs. (Contributed by NM, 5-Aug-1995.)
Hypothesis
Ref Expression
copsex4g.1 (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) → (𝜑𝜓))
Assertion
Ref Expression
copsex4g (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ 𝜓))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤   𝑥,𝐶,𝑦,𝑧,𝑤   𝑥,𝐷,𝑦,𝑧,𝑤   𝜓,𝑥,𝑦,𝑧,𝑤   𝑥,𝑅,𝑦,𝑧,𝑤   𝑥,𝑆,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem copsex4g
StepHypRef Expression
1 eqcom 2090 . . . . . . 7 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
2 vex 2622 . . . . . . . 8 𝑥 ∈ V
3 vex 2622 . . . . . . . 8 𝑦 ∈ V
42, 3opth 4055 . . . . . . 7 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
51, 4bitri 182 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
6 eqcom 2090 . . . . . . 7 (⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩ ↔ ⟨𝑧, 𝑤⟩ = ⟨𝐶, 𝐷⟩)
7 vex 2622 . . . . . . . 8 𝑧 ∈ V
8 vex 2622 . . . . . . . 8 𝑤 ∈ V
97, 8opth 4055 . . . . . . 7 (⟨𝑧, 𝑤⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝑧 = 𝐶𝑤 = 𝐷))
106, 9bitri 182 . . . . . 6 (⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩ ↔ (𝑧 = 𝐶𝑤 = 𝐷))
115, 10anbi12i 448 . . . . 5 ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ↔ ((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)))
1211anbi1i 446 . . . 4 (((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑))
1312a1i 9 . . 3 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑)))
14134exbidv 1798 . 2 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ ∃𝑥𝑦𝑧𝑤(((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑)))
15 id 19 . . 3 (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) → ((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)))
16 copsex4g.1 . . 3 (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) → (𝜑𝜓))
1715, 16cgsex4g 2656 . 2 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤(((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑) ↔ 𝜓))
1814, 17bitrd 186 1 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ 𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1289  wex 1426  wcel 1438  cop 3444
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 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3949  ax-pow 4001  ax-pr 4027
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-v 2621  df-un 3001  df-in 3003  df-ss 3010  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450
This theorem is referenced by:  opbrop  4505  ovi3  5763  dfplpq2  6892  dfmpq2  6893  enq0breq  6974
  Copyright terms: Public domain W3C validator