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

Theorem ecopovtrng 6236
Description: Assuming that operation 𝐹 is commutative (second hypothesis), closed (third hypothesis), associative (fourth hypothesis), and has the cancellation property (fifth hypothesis), show that the relation , specified by the first hypothesis, is transitive. (Contributed by Jim Kingdon, 1-Sep-2019.)
Hypotheses
Ref Expression
ecopopr.1 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
ecopoprg.com ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
ecopoprg.cl ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
ecopoprg.ass ((𝑥𝑆𝑦𝑆𝑧𝑆) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
ecopoprg.can ((𝑥𝑆𝑦𝑆𝑧𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧))
Assertion
Ref Expression
ecopovtrng ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶)
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢, +   𝑥,𝑆,𝑦,𝑧,𝑤,𝑣,𝑢
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐵(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐶(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   (𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)

Proof of Theorem ecopovtrng
Dummy variables 𝑓 𝑔 𝑡 𝑠 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ecopopr.1 . . . . . . 7 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
2 opabssxp 4441 . . . . . . 7 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
31, 2eqsstri 3002 . . . . . 6 ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
43brel 4419 . . . . 5 (𝐴 𝐵 → (𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)))
54simpld 109 . . . 4 (𝐴 𝐵𝐴 ∈ (𝑆 × 𝑆))
63brel 4419 . . . 4 (𝐵 𝐶 → (𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)))
75, 6anim12i 325 . . 3 ((𝐴 𝐵𝐵 𝐶) → (𝐴 ∈ (𝑆 × 𝑆) ∧ (𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆))))
8 3anass 900 . . 3 ((𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)) ↔ (𝐴 ∈ (𝑆 × 𝑆) ∧ (𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆))))
97, 8sylibr 141 . 2 ((𝐴 𝐵𝐵 𝐶) → (𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)))
10 eqid 2056 . . 3 (𝑆 × 𝑆) = (𝑆 × 𝑆)
11 breq1 3794 . . . . 5 (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨𝑓, 𝑔, 𝑡⟩ ↔ 𝐴 , 𝑡⟩))
1211anbi1d 446 . . . 4 (⟨𝑓, 𝑔⟩ = 𝐴 → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) ↔ (𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩)))
13 breq1 3794 . . . 4 (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨𝑓, 𝑔𝑠, 𝑟⟩ ↔ 𝐴 𝑠, 𝑟⟩))
1412, 13imbi12d 227 . . 3 (⟨𝑓, 𝑔⟩ = 𝐴 → (((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → ⟨𝑓, 𝑔𝑠, 𝑟⟩) ↔ ((𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩)))
15 breq2 3795 . . . . 5 (⟨, 𝑡⟩ = 𝐵 → (𝐴 , 𝑡⟩ ↔ 𝐴 𝐵))
16 breq1 3794 . . . . 5 (⟨, 𝑡⟩ = 𝐵 → (⟨, 𝑡𝑠, 𝑟⟩ ↔ 𝐵 𝑠, 𝑟⟩))
1715, 16anbi12d 450 . . . 4 (⟨, 𝑡⟩ = 𝐵 → ((𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) ↔ (𝐴 𝐵𝐵 𝑠, 𝑟⟩)))
1817imbi1d 224 . . 3 (⟨, 𝑡⟩ = 𝐵 → (((𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩) ↔ ((𝐴 𝐵𝐵 𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩)))
19 breq2 3795 . . . . 5 (⟨𝑠, 𝑟⟩ = 𝐶 → (𝐵 𝑠, 𝑟⟩ ↔ 𝐵 𝐶))
2019anbi2d 445 . . . 4 (⟨𝑠, 𝑟⟩ = 𝐶 → ((𝐴 𝐵𝐵 𝑠, 𝑟⟩) ↔ (𝐴 𝐵𝐵 𝐶)))
21 breq2 3795 . . . 4 (⟨𝑠, 𝑟⟩ = 𝐶 → (𝐴 𝑠, 𝑟⟩ ↔ 𝐴 𝐶))
2220, 21imbi12d 227 . . 3 (⟨𝑠, 𝑟⟩ = 𝐶 → (((𝐴 𝐵𝐵 𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩) ↔ ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶)))
231ecopoveq 6231 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → (⟨𝑓, 𝑔, 𝑡⟩ ↔ (𝑓 + 𝑡) = (𝑔 + )))
24233adant3 935 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨𝑓, 𝑔, 𝑡⟩ ↔ (𝑓 + 𝑡) = (𝑔 + )))
251ecopoveq 6231 . . . . . . . 8 (((𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨, 𝑡𝑠, 𝑟⟩ ↔ ( + 𝑟) = (𝑡 + 𝑠)))
26253adant1 933 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨, 𝑡𝑠, 𝑟⟩ ↔ ( + 𝑟) = (𝑡 + 𝑠)))
2724, 26anbi12d 450 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) ↔ ((𝑓 + 𝑡) = (𝑔 + ) ∧ ( + 𝑟) = (𝑡 + 𝑠))))
28 oveq12 5548 . . . . . . 7 (((𝑓 + 𝑡) = (𝑔 + ) ∧ ( + 𝑟) = (𝑡 + 𝑠)) → ((𝑓 + 𝑡) + ( + 𝑟)) = ((𝑔 + ) + (𝑡 + 𝑠)))
29 simp2l 941 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑆)
30 simp2r 942 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑡𝑆)
31 simp1l 939 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑓𝑆)
32 ecopoprg.com . . . . . . . . . 10 ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3332adantl 266 . . . . . . . . 9 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
34 ecopoprg.ass . . . . . . . . . 10 ((𝑥𝑆𝑦𝑆𝑧𝑆) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
3534adantl 266 . . . . . . . . 9 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
36 simp3r 944 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑟𝑆)
37 ecopoprg.cl . . . . . . . . . 10 ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
3837adantl 266 . . . . . . . . 9 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
3929, 30, 31, 33, 35, 36, 38caov411d 5713 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (( + 𝑡) + (𝑓 + 𝑟)) = ((𝑓 + 𝑡) + ( + 𝑟)))
40 simp1r 940 . . . . . . . . . 10 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑔𝑆)
41 simp3l 943 . . . . . . . . . 10 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑠𝑆)
4240, 30, 29, 33, 35, 41, 38caov411d 5713 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((𝑔 + 𝑡) + ( + 𝑠)) = (( + 𝑡) + (𝑔 + 𝑠)))
4340, 30, 29, 33, 35, 41, 38caov4d 5712 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((𝑔 + 𝑡) + ( + 𝑠)) = ((𝑔 + ) + (𝑡 + 𝑠)))
4442, 43eqtr3d 2090 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (( + 𝑡) + (𝑔 + 𝑠)) = ((𝑔 + ) + (𝑡 + 𝑠)))
4539, 44eqeq12d 2070 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠)) ↔ ((𝑓 + 𝑡) + ( + 𝑟)) = ((𝑔 + ) + (𝑡 + 𝑠))))
4628, 45syl5ibr 149 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (((𝑓 + 𝑡) = (𝑔 + ) ∧ ( + 𝑟) = (𝑡 + 𝑠)) → (( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠))))
4727, 46sylbid 143 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → (( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠))))
48 ecopoprg.can . . . . . . . 8 ((𝑥𝑆𝑦𝑆𝑧𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧))
49 oveq2 5547 . . . . . . . 8 (𝑦 = 𝑧 → (𝑥 + 𝑦) = (𝑥 + 𝑧))
5048, 49impbid1 134 . . . . . . 7 ((𝑥𝑆𝑦𝑆𝑧𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) ↔ 𝑦 = 𝑧))
5150adantl 266 . . . . . 6 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) ↔ 𝑦 = 𝑧))
5237caovcl 5682 . . . . . . 7 ((𝑆𝑡𝑆) → ( + 𝑡) ∈ 𝑆)
5329, 30, 52syl2anc 397 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ( + 𝑡) ∈ 𝑆)
5437caovcl 5682 . . . . . . 7 ((𝑓𝑆𝑟𝑆) → (𝑓 + 𝑟) ∈ 𝑆)
5531, 36, 54syl2anc 397 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (𝑓 + 𝑟) ∈ 𝑆)
5638, 40, 41caovcld 5681 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (𝑔 + 𝑠) ∈ 𝑆)
5751, 53, 55, 56caovcand 5690 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠)) ↔ (𝑓 + 𝑟) = (𝑔 + 𝑠)))
5847, 57sylibd 142 . . . 4 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → (𝑓 + 𝑟) = (𝑔 + 𝑠)))
591ecopoveq 6231 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨𝑓, 𝑔𝑠, 𝑟⟩ ↔ (𝑓 + 𝑟) = (𝑔 + 𝑠)))
60593adant2 934 . . . 4 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨𝑓, 𝑔𝑠, 𝑟⟩ ↔ (𝑓 + 𝑟) = (𝑔 + 𝑠)))
6158, 60sylibrd 162 . . 3 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → ⟨𝑓, 𝑔𝑠, 𝑟⟩))
6210, 14, 18, 22, 613optocl 4445 . 2 ((𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)) → ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶))
639, 62mpcom 36 1 ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  w3a 896   = wceq 1259  wex 1397  wcel 1409  cop 3405   class class class wbr 3791  {copab 3844   × cxp 4370  (class class class)co 5539
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-eu 1919  df-mo 1920  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-iota 4894  df-fv 4937  df-ov 5542
This theorem is referenced by:  ecopoverg  6237
  Copyright terms: Public domain W3C validator