![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ecopover | Structured version Visualization version GIF version |
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 an equivalence relation. (Contributed by NM, 16-Feb-1996.) (Revised by Mario Carneiro, 12-Aug-2015.) (Proof shortened by AV, 1-May-2021.) |
Ref | Expression |
---|---|
ecopopr.1 | ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = 〈𝑧, 𝑤〉 ∧ 𝑦 = 〈𝑣, 𝑢〉) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} |
ecopopr.com | ⊢ (𝑥 + 𝑦) = (𝑦 + 𝑥) |
ecopopr.cl | ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆) |
ecopopr.ass | ⊢ ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)) |
ecopopr.can | ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧)) |
Ref | Expression |
---|---|
ecopover | ⊢ ∼ Er (𝑆 × 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ecopopr.1 | . . 3 ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = 〈𝑧, 𝑤〉 ∧ 𝑦 = 〈𝑣, 𝑢〉) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} | |
2 | 1 | relopabi 5658 | . 2 ⊢ Rel ∼ |
3 | ecopopr.com | . . 3 ⊢ (𝑥 + 𝑦) = (𝑦 + 𝑥) | |
4 | 1, 3 | ecopovsym 8382 | . 2 ⊢ (𝑓 ∼ 𝑔 → 𝑔 ∼ 𝑓) |
5 | ecopopr.cl | . . 3 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆) | |
6 | ecopopr.ass | . . 3 ⊢ ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)) | |
7 | ecopopr.can | . . 3 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧)) | |
8 | 1, 3, 5, 6, 7 | ecopovtrn 8383 | . 2 ⊢ ((𝑓 ∼ 𝑔 ∧ 𝑔 ∼ ℎ) → 𝑓 ∼ ℎ) |
9 | vex 3444 | . . . . . . . . 9 ⊢ 𝑔 ∈ V | |
10 | vex 3444 | . . . . . . . . 9 ⊢ ℎ ∈ V | |
11 | 9, 10, 3 | caovcom 7325 | . . . . . . . 8 ⊢ (𝑔 + ℎ) = (ℎ + 𝑔) |
12 | 1 | ecopoveq 8381 | . . . . . . . 8 ⊢ (((𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆) ∧ (𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆)) → (〈𝑔, ℎ〉 ∼ 〈𝑔, ℎ〉 ↔ (𝑔 + ℎ) = (ℎ + 𝑔))) |
13 | 11, 12 | mpbiri 261 | . . . . . . 7 ⊢ (((𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆) ∧ (𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆)) → 〈𝑔, ℎ〉 ∼ 〈𝑔, ℎ〉) |
14 | 13 | anidms 570 | . . . . . 6 ⊢ ((𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆) → 〈𝑔, ℎ〉 ∼ 〈𝑔, ℎ〉) |
15 | 14 | rgen2 3168 | . . . . 5 ⊢ ∀𝑔 ∈ 𝑆 ∀ℎ ∈ 𝑆 〈𝑔, ℎ〉 ∼ 〈𝑔, ℎ〉 |
16 | breq12 5035 | . . . . . . 7 ⊢ ((𝑓 = 〈𝑔, ℎ〉 ∧ 𝑓 = 〈𝑔, ℎ〉) → (𝑓 ∼ 𝑓 ↔ 〈𝑔, ℎ〉 ∼ 〈𝑔, ℎ〉)) | |
17 | 16 | anidms 570 | . . . . . 6 ⊢ (𝑓 = 〈𝑔, ℎ〉 → (𝑓 ∼ 𝑓 ↔ 〈𝑔, ℎ〉 ∼ 〈𝑔, ℎ〉)) |
18 | 17 | ralxp 5676 | . . . . 5 ⊢ (∀𝑓 ∈ (𝑆 × 𝑆)𝑓 ∼ 𝑓 ↔ ∀𝑔 ∈ 𝑆 ∀ℎ ∈ 𝑆 〈𝑔, ℎ〉 ∼ 〈𝑔, ℎ〉) |
19 | 15, 18 | mpbir 234 | . . . 4 ⊢ ∀𝑓 ∈ (𝑆 × 𝑆)𝑓 ∼ 𝑓 |
20 | 19 | rspec 3172 | . . 3 ⊢ (𝑓 ∈ (𝑆 × 𝑆) → 𝑓 ∼ 𝑓) |
21 | opabssxp 5607 | . . . . . 6 ⊢ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = 〈𝑧, 𝑤〉 ∧ 𝑦 = 〈𝑣, 𝑢〉) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆)) | |
22 | 1, 21 | eqsstri 3949 | . . . . 5 ⊢ ∼ ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆)) |
23 | 22 | ssbri 5075 | . . . 4 ⊢ (𝑓 ∼ 𝑓 → 𝑓((𝑆 × 𝑆) × (𝑆 × 𝑆))𝑓) |
24 | brxp 5565 | . . . . 5 ⊢ (𝑓((𝑆 × 𝑆) × (𝑆 × 𝑆))𝑓 ↔ (𝑓 ∈ (𝑆 × 𝑆) ∧ 𝑓 ∈ (𝑆 × 𝑆))) | |
25 | 24 | simplbi 501 | . . . 4 ⊢ (𝑓((𝑆 × 𝑆) × (𝑆 × 𝑆))𝑓 → 𝑓 ∈ (𝑆 × 𝑆)) |
26 | 23, 25 | syl 17 | . . 3 ⊢ (𝑓 ∼ 𝑓 → 𝑓 ∈ (𝑆 × 𝑆)) |
27 | 20, 26 | impbii 212 | . 2 ⊢ (𝑓 ∈ (𝑆 × 𝑆) ↔ 𝑓 ∼ 𝑓) |
28 | 2, 4, 8, 27 | iseri 8299 | 1 ⊢ ∼ Er (𝑆 × 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 ∀wral 3106 〈cop 4531 class class class wbr 5030 {copab 5092 × cxp 5517 (class class class)co 7135 Er wer 8269 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-iota 6283 df-fv 6332 df-ov 7138 df-er 8272 |
This theorem is referenced by: enqer 10332 enrer 10474 |
Copyright terms: Public domain | W3C validator |