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

Theorem copsex4g 4247
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 2179 . . . . . . 7 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
2 vex 2740 . . . . . . . 8 𝑥 ∈ V
3 vex 2740 . . . . . . . 8 𝑦 ∈ V
42, 3opth 4237 . . . . . . 7 (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
51, 4bitri 184 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑥 = 𝐴𝑦 = 𝐵))
6 eqcom 2179 . . . . . . 7 (⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩ ↔ ⟨𝑧, 𝑤⟩ = ⟨𝐶, 𝐷⟩)
7 vex 2740 . . . . . . . 8 𝑧 ∈ V
8 vex 2740 . . . . . . . 8 𝑤 ∈ V
97, 8opth 4237 . . . . . . 7 (⟨𝑧, 𝑤⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝑧 = 𝐶𝑤 = 𝐷))
106, 9bitri 184 . . . . . 6 (⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩ ↔ (𝑧 = 𝐶𝑤 = 𝐷))
115, 10anbi12i 460 . . . . 5 ((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ↔ ((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)))
1211anbi1i 458 . . . 4 (((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑))
1312a1i 9 . . 3 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑)))
14134exbidv 1870 . 2 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ ∃𝑥𝑦𝑧𝑤(((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑)))
15 id 19 . . 3 (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) → ((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)))
16 copsex4g.1 . . 3 (((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) → (𝜑𝜓))
1715, 16cgsex4g 2774 . 2 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤(((𝑥 = 𝐴𝑦 = 𝐵) ∧ (𝑧 = 𝐶𝑤 = 𝐷)) ∧ 𝜑) ↔ 𝜓))
1814, 17bitrd 188 1 (((𝐴𝑅𝐵𝑆) ∧ (𝐶𝑅𝐷𝑆)) → (∃𝑥𝑦𝑧𝑤((⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ ⟨𝐶, 𝐷⟩ = ⟨𝑧, 𝑤⟩) ∧ 𝜑) ↔ 𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1353  wex 1492  wcel 2148  cop 3595
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 4121  ax-pow 4174  ax-pr 4209
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  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 3577  df-sn 3598  df-pr 3599  df-op 3601
This theorem is referenced by:  opbrop  4705  ovi3  6010  dfplpq2  7352  dfmpq2  7353  enq0breq  7434
  Copyright terms: Public domain W3C validator