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

Theorem ecopovtrn 6598
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 NM, 11-Feb-1996.) (Revised by Mario Carneiro, 26-Apr-2015.)
Hypotheses
Ref Expression
ecopopr.1 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
ecopopr.com (𝑥 + 𝑦) = (𝑦 + 𝑥)
ecopopr.cl ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
ecopopr.ass ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))
ecopopr.can ((𝑥𝑆𝑦𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧))
Assertion
Ref Expression
ecopovtrn ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶)
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢, +   𝑥,𝑆,𝑦,𝑧,𝑤,𝑣,𝑢
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐵(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐶(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   (𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)

Proof of Theorem ecopovtrn
Dummy variables 𝑓 𝑔 𝑡 𝑠 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ecopopr.1 . . . . . . 7 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
2 opabssxp 4678 . . . . . . 7 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
31, 2eqsstri 3174 . . . . . 6 ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
43brel 4656 . . . . 5 (𝐴 𝐵 → (𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)))
54simpld 111 . . . 4 (𝐴 𝐵𝐴 ∈ (𝑆 × 𝑆))
63brel 4656 . . . 4 (𝐵 𝐶 → (𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)))
75, 6anim12i 336 . . 3 ((𝐴 𝐵𝐵 𝐶) → (𝐴 ∈ (𝑆 × 𝑆) ∧ (𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆))))
8 3anass 972 . . 3 ((𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)) ↔ (𝐴 ∈ (𝑆 × 𝑆) ∧ (𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆))))
97, 8sylibr 133 . 2 ((𝐴 𝐵𝐵 𝐶) → (𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)))
10 eqid 2165 . . 3 (𝑆 × 𝑆) = (𝑆 × 𝑆)
11 breq1 3985 . . . . 5 (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨𝑓, 𝑔, 𝑡⟩ ↔ 𝐴 , 𝑡⟩))
1211anbi1d 461 . . . 4 (⟨𝑓, 𝑔⟩ = 𝐴 → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) ↔ (𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩)))
13 breq1 3985 . . . 4 (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨𝑓, 𝑔𝑠, 𝑟⟩ ↔ 𝐴 𝑠, 𝑟⟩))
1412, 13imbi12d 233 . . 3 (⟨𝑓, 𝑔⟩ = 𝐴 → (((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → ⟨𝑓, 𝑔𝑠, 𝑟⟩) ↔ ((𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩)))
15 breq2 3986 . . . . 5 (⟨, 𝑡⟩ = 𝐵 → (𝐴 , 𝑡⟩ ↔ 𝐴 𝐵))
16 breq1 3985 . . . . 5 (⟨, 𝑡⟩ = 𝐵 → (⟨, 𝑡𝑠, 𝑟⟩ ↔ 𝐵 𝑠, 𝑟⟩))
1715, 16anbi12d 465 . . . 4 (⟨, 𝑡⟩ = 𝐵 → ((𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) ↔ (𝐴 𝐵𝐵 𝑠, 𝑟⟩)))
1817imbi1d 230 . . 3 (⟨, 𝑡⟩ = 𝐵 → (((𝐴 , 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩) ↔ ((𝐴 𝐵𝐵 𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩)))
19 breq2 3986 . . . . 5 (⟨𝑠, 𝑟⟩ = 𝐶 → (𝐵 𝑠, 𝑟⟩ ↔ 𝐵 𝐶))
2019anbi2d 460 . . . 4 (⟨𝑠, 𝑟⟩ = 𝐶 → ((𝐴 𝐵𝐵 𝑠, 𝑟⟩) ↔ (𝐴 𝐵𝐵 𝐶)))
21 breq2 3986 . . . 4 (⟨𝑠, 𝑟⟩ = 𝐶 → (𝐴 𝑠, 𝑟⟩ ↔ 𝐴 𝐶))
2220, 21imbi12d 233 . . 3 (⟨𝑠, 𝑟⟩ = 𝐶 → (((𝐴 𝐵𝐵 𝑠, 𝑟⟩) → 𝐴 𝑠, 𝑟⟩) ↔ ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶)))
231ecopoveq 6596 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆)) → (⟨𝑓, 𝑔, 𝑡⟩ ↔ (𝑓 + 𝑡) = (𝑔 + )))
24233adant3 1007 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨𝑓, 𝑔, 𝑡⟩ ↔ (𝑓 + 𝑡) = (𝑔 + )))
251ecopoveq 6596 . . . . . . . 8 (((𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨, 𝑡𝑠, 𝑟⟩ ↔ ( + 𝑟) = (𝑡 + 𝑠)))
26253adant1 1005 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨, 𝑡𝑠, 𝑟⟩ ↔ ( + 𝑟) = (𝑡 + 𝑠)))
2724, 26anbi12d 465 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) ↔ ((𝑓 + 𝑡) = (𝑔 + ) ∧ ( + 𝑟) = (𝑡 + 𝑠))))
28 oveq12 5851 . . . . . . 7 (((𝑓 + 𝑡) = (𝑔 + ) ∧ ( + 𝑟) = (𝑡 + 𝑠)) → ((𝑓 + 𝑡) + ( + 𝑟)) = ((𝑔 + ) + (𝑡 + 𝑠)))
29 simp2l 1013 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑆)
30 simp2r 1014 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑡𝑆)
31 simp1l 1011 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑓𝑆)
32 ecopopr.com . . . . . . . . . 10 (𝑥 + 𝑦) = (𝑦 + 𝑥)
3332a1i 9 . . . . . . . . 9 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
34 ecopopr.ass . . . . . . . . . 10 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))
3534a1i 9 . . . . . . . . 9 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
36 simp3r 1016 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑟𝑆)
37 ecopopr.cl . . . . . . . . . 10 ((𝑥𝑆𝑦𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
3837adantl 275 . . . . . . . . 9 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
3929, 30, 31, 33, 35, 36, 38caov411d 6027 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (( + 𝑡) + (𝑓 + 𝑟)) = ((𝑓 + 𝑡) + ( + 𝑟)))
40 simp1r 1012 . . . . . . . . . 10 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑔𝑆)
41 simp3l 1015 . . . . . . . . . 10 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → 𝑠𝑆)
4240, 30, 29, 33, 35, 41, 38caov411d 6027 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((𝑔 + 𝑡) + ( + 𝑠)) = (( + 𝑡) + (𝑔 + 𝑠)))
4340, 30, 29, 33, 35, 41, 38caov4d 6026 . . . . . . . . 9 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((𝑔 + 𝑡) + ( + 𝑠)) = ((𝑔 + ) + (𝑡 + 𝑠)))
4442, 43eqtr3d 2200 . . . . . . . 8 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (( + 𝑡) + (𝑔 + 𝑠)) = ((𝑔 + ) + (𝑡 + 𝑠)))
4539, 44eqeq12d 2180 . . . . . . 7 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠)) ↔ ((𝑓 + 𝑡) + ( + 𝑟)) = ((𝑔 + ) + (𝑡 + 𝑠))))
4628, 45syl5ibr 155 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (((𝑓 + 𝑡) = (𝑔 + ) ∧ ( + 𝑟) = (𝑡 + 𝑠)) → (( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠))))
4727, 46sylbid 149 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → (( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠))))
48 ecopopr.can . . . . . . . . 9 ((𝑥𝑆𝑦𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧))
49483adant3 1007 . . . . . . . 8 ((𝑥𝑆𝑦𝑆𝑧𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧))
50 oveq2 5850 . . . . . . . 8 (𝑦 = 𝑧 → (𝑥 + 𝑦) = (𝑥 + 𝑧))
5149, 50impbid1 141 . . . . . . 7 ((𝑥𝑆𝑦𝑆𝑧𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) ↔ 𝑦 = 𝑧))
5251adantl 275 . . . . . 6 ((((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) ↔ 𝑦 = 𝑧))
5337caovcl 5996 . . . . . . 7 ((𝑆𝑡𝑆) → ( + 𝑡) ∈ 𝑆)
5429, 30, 53syl2anc 409 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ( + 𝑡) ∈ 𝑆)
5537caovcl 5996 . . . . . . 7 ((𝑓𝑆𝑟𝑆) → (𝑓 + 𝑟) ∈ 𝑆)
5631, 36, 55syl2anc 409 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (𝑓 + 𝑟) ∈ 𝑆)
5738, 40, 41caovcld 5995 . . . . . 6 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (𝑔 + 𝑠) ∈ 𝑆)
5852, 54, 56, 57caovcand 6004 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((( + 𝑡) + (𝑓 + 𝑟)) = (( + 𝑡) + (𝑔 + 𝑠)) ↔ (𝑓 + 𝑟) = (𝑔 + 𝑠)))
5947, 58sylibd 148 . . . 4 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → (𝑓 + 𝑟) = (𝑔 + 𝑠)))
601ecopoveq 6596 . . . . 5 (((𝑓𝑆𝑔𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨𝑓, 𝑔𝑠, 𝑟⟩ ↔ (𝑓 + 𝑟) = (𝑔 + 𝑠)))
61603adant2 1006 . . . 4 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → (⟨𝑓, 𝑔𝑠, 𝑟⟩ ↔ (𝑓 + 𝑟) = (𝑔 + 𝑠)))
6259, 61sylibrd 168 . . 3 (((𝑓𝑆𝑔𝑆) ∧ (𝑆𝑡𝑆) ∧ (𝑠𝑆𝑟𝑆)) → ((⟨𝑓, 𝑔, 𝑡⟩ ∧ ⟨, 𝑡𝑠, 𝑟⟩) → ⟨𝑓, 𝑔𝑠, 𝑟⟩))
6310, 14, 18, 22, 623optocl 4682 . 2 ((𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆) ∧ 𝐶 ∈ (𝑆 × 𝑆)) → ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶))
649, 63mpcom 36 1 ((𝐴 𝐵𝐵 𝐶) → 𝐴 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 968   = wceq 1343  wex 1480  wcel 2136  cop 3579   class class class wbr 3982  {copab 4042   × cxp 4602  (class class class)co 5842
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-xp 4610  df-iota 5153  df-fv 5196  df-ov 5845
This theorem is referenced by:  ecopover  6599
  Copyright terms: Public domain W3C validator