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

Theorem ecopovsymg 6723
Description: Assuming the operation 𝐹 is commutative, show that the relation , specified by the first hypothesis, is symmetric. (Contributed by Jim Kingdon, 1-Sep-2019.)
Hypotheses
Ref Expression
ecopopr.1 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
ecopoprg.com ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
Assertion
Ref Expression
ecopovsymg (𝐴 𝐵𝐵 𝐴)
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢, +   𝑥,𝑆,𝑦,𝑧,𝑤,𝑣,𝑢
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐵(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   (𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)

Proof of Theorem ecopovsymg
Dummy variables 𝑓 𝑔 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ecopopr.1 . . . . 5 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
2 opabssxp 4750 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
31, 2eqsstri 3225 . . . 4 ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
43brel 4728 . . 3 (𝐴 𝐵 → (𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)))
5 eqid 2205 . . . 4 (𝑆 × 𝑆) = (𝑆 × 𝑆)
6 breq1 4048 . . . . 5 (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨𝑓, 𝑔, 𝑡⟩ ↔ 𝐴 , 𝑡⟩))
7 breq2 4049 . . . . 5 (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨, 𝑡𝑓, 𝑔⟩ ↔ ⟨, 𝑡 𝐴))
86, 7bibi12d 235 . . . 4 (⟨𝑓, 𝑔⟩ = 𝐴 → ((⟨𝑓, 𝑔, 𝑡⟩ ↔ ⟨, 𝑡𝑓, 𝑔⟩) ↔ (𝐴 , 𝑡⟩ ↔ ⟨, 𝑡 𝐴)))
9 breq2 4049 . . . . 5 (⟨, 𝑡⟩ = 𝐵 → (𝐴 , 𝑡⟩ ↔ 𝐴 𝐵))
10 breq1 4048 . . . . 5 (⟨, 𝑡⟩ = 𝐵 → (⟨, 𝑡 𝐴𝐵 𝐴))
119, 10bibi12d 235 . . . 4 (⟨, 𝑡⟩ = 𝐵 → ((𝐴 , 𝑡⟩ ↔ ⟨, 𝑡 𝐴) ↔ (𝐴 𝐵𝐵 𝐴)))
12 ecopoprg.com . . . . . . . . 9 ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
1312adantl 277 . . . . . . . 8 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
14 simpll 527 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → 𝑓𝑆)
15 simprr 531 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → 𝑡𝑆)
1613, 14, 15caovcomd 6105 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → (𝑓 + 𝑡) = (𝑡 + 𝑓))
17 simplr 528 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → 𝑔𝑆)
18 simprl 529 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → 𝑆)
1913, 17, 18caovcomd 6105 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → (𝑔 + ) = ( + 𝑔))
2016, 19eqeq12d 2220 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → ((𝑓 + 𝑡) = (𝑔 + ) ↔ (𝑡 + 𝑓) = ( + 𝑔)))
21 eqcom 2207 . . . . . 6 ((𝑡 + 𝑓) = ( + 𝑔) ↔ ( + 𝑔) = (𝑡 + 𝑓))
2220, 21bitrdi 196 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → ((𝑓 + 𝑡) = (𝑔 + ) ↔ ( + 𝑔) = (𝑡 + 𝑓)))
231ecopoveq 6719 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → (⟨𝑓, 𝑔, 𝑡⟩ ↔ (𝑓 + 𝑡) = (𝑔 + )))
241ecopoveq 6719 . . . . . 6 (((𝑆𝑡𝑆) ∧ (𝑓𝑆𝑔𝑆)) → (⟨, 𝑡𝑓, 𝑔⟩ ↔ ( + 𝑔) = (𝑡 + 𝑓)))
2524ancoms 268 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → (⟨, 𝑡𝑓, 𝑔⟩ ↔ ( + 𝑔) = (𝑡 + 𝑓)))
2622, 23, 253bitr4d 220 . . . 4 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → (⟨𝑓, 𝑔, 𝑡⟩ ↔ ⟨, 𝑡𝑓, 𝑔⟩))
275, 8, 11, 262optocl 4753 . . 3 ((𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)) → (𝐴 𝐵𝐵 𝐴))
284, 27syl 14 . 2 (𝐴 𝐵 → (𝐴 𝐵𝐵 𝐴))
2928ibi 176 1 (𝐴 𝐵𝐵 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wex 1515  wcel 2176  cop 3636   class class class wbr 4045  {copab 4105   × cxp 4674  (class class class)co 5946
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4163  ax-pow 4219  ax-pr 4254
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4046  df-opab 4107  df-xp 4682  df-iota 5233  df-fv 5280  df-ov 5949
This theorem is referenced by:  ecopoverg  6725
  Copyright terms: Public domain W3C validator