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

Theorem ecovcom 6243
 Description: Lemma used to transfer a commutative law via an equivalence relation. Most uses will want ecovicom 6244 instead. (Contributed by NM, 29-Aug-1995.) (Revised by David Abernethy, 4-Jun-2013.)
Hypotheses
Ref Expression
ecovcom.1 𝐶 = ((𝑆 × 𝑆) / )
ecovcom.2 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = [⟨𝐷, 𝐺⟩] )
ecovcom.3 (((𝑧𝑆𝑤𝑆) ∧ (𝑥𝑆𝑦𝑆)) → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = [⟨𝐻, 𝐽⟩] )
ecovcom.4 𝐷 = 𝐻
ecovcom.5 𝐺 = 𝐽
Assertion
Ref Expression
ecovcom ((𝐴𝐶𝐵𝐶) → (𝐴 + 𝐵) = (𝐵 + 𝐴))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝐴   𝑧,𝐵,𝑤   𝑥, + ,𝑦,𝑧,𝑤   𝑥, ,𝑦,𝑧,𝑤   𝑥,𝑆,𝑦,𝑧,𝑤   𝑧,𝐶,𝑤
Allowed substitution hints:   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐷(𝑥,𝑦,𝑧,𝑤)   𝐺(𝑥,𝑦,𝑧,𝑤)   𝐻(𝑥,𝑦,𝑧,𝑤)   𝐽(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem ecovcom
StepHypRef Expression
1 ecovcom.1 . 2 𝐶 = ((𝑆 × 𝑆) / )
2 oveq1 5546 . . 3 ([⟨𝑥, 𝑦⟩] = 𝐴 → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = (𝐴 + [⟨𝑧, 𝑤⟩] ))
3 oveq2 5547 . . 3 ([⟨𝑥, 𝑦⟩] = 𝐴 → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = ([⟨𝑧, 𝑤⟩] + 𝐴))
42, 3eqeq12d 2070 . 2 ([⟨𝑥, 𝑦⟩] = 𝐴 → (([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) ↔ (𝐴 + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + 𝐴)))
5 oveq2 5547 . . 3 ([⟨𝑧, 𝑤⟩] = 𝐵 → (𝐴 + [⟨𝑧, 𝑤⟩] ) = (𝐴 + 𝐵))
6 oveq1 5546 . . 3 ([⟨𝑧, 𝑤⟩] = 𝐵 → ([⟨𝑧, 𝑤⟩] + 𝐴) = (𝐵 + 𝐴))
75, 6eqeq12d 2070 . 2 ([⟨𝑧, 𝑤⟩] = 𝐵 → ((𝐴 + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + 𝐴) ↔ (𝐴 + 𝐵) = (𝐵 + 𝐴)))
8 ecovcom.4 . . . 4 𝐷 = 𝐻
9 ecovcom.5 . . . 4 𝐺 = 𝐽
10 opeq12 3578 . . . . 5 ((𝐷 = 𝐻𝐺 = 𝐽) → ⟨𝐷, 𝐺⟩ = ⟨𝐻, 𝐽⟩)
1110eceq1d 6172 . . . 4 ((𝐷 = 𝐻𝐺 = 𝐽) → [⟨𝐷, 𝐺⟩] = [⟨𝐻, 𝐽⟩] )
128, 9, 11mp2an 410 . . 3 [⟨𝐷, 𝐺⟩] = [⟨𝐻, 𝐽⟩]
13 ecovcom.2 . . 3 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = [⟨𝐷, 𝐺⟩] )
14 ecovcom.3 . . . 4 (((𝑧𝑆𝑤𝑆) ∧ (𝑥𝑆𝑦𝑆)) → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = [⟨𝐻, 𝐽⟩] )
1514ancoms 259 . . 3 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = [⟨𝐻, 𝐽⟩] )
1612, 13, 153eqtr4a 2114 . 2 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ))
171, 4, 7, 162ecoptocl 6224 1 ((𝐴𝐶𝐵𝐶) → (𝐴 + 𝐵) = (𝐵 + 𝐴))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 101   = wceq 1259   ∈ wcel 1409  ⟨cop 3405   × cxp 4370  (class class class)co 5539  [cec 6134   / cqs 6135 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-br 3792  df-opab 3846  df-xp 4378  df-cnv 4380  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fv 4937  df-ov 5542  df-ec 6138  df-qs 6142 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator