Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eroprf2 | Structured version Visualization version GIF version |
Description: Functionality of an operation defined on equivalence classes. (Contributed by Jeff Madsen, 10-Jun-2010.) |
Ref | Expression |
---|---|
eropr2.1 | ⊢ 𝐽 = (𝐴 / ∼ ) |
eropr2.2 | ⊢ ⨣ = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑥 = [𝑝] ∼ ∧ 𝑦 = [𝑞] ∼ ) ∧ 𝑧 = [(𝑝 + 𝑞)] ∼ )} |
eropr2.3 | ⊢ (𝜑 → ∼ ∈ 𝑋) |
eropr2.4 | ⊢ (𝜑 → ∼ Er 𝑈) |
eropr2.5 | ⊢ (𝜑 → 𝐴 ⊆ 𝑈) |
eropr2.6 | ⊢ (𝜑 → + :(𝐴 × 𝐴)⟶𝐴) |
eropr2.7 | ⊢ ((𝜑 ∧ ((𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑡 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴))) → ((𝑟 ∼ 𝑠 ∧ 𝑡 ∼ 𝑢) → (𝑟 + 𝑡) ∼ (𝑠 + 𝑢))) |
Ref | Expression |
---|---|
eroprf2 | ⊢ (𝜑 → ⨣ :(𝐽 × 𝐽)⟶𝐽) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eropr2.1 | . 2 ⊢ 𝐽 = (𝐴 / ∼ ) | |
2 | eropr2.3 | . 2 ⊢ (𝜑 → ∼ ∈ 𝑋) | |
3 | eropr2.4 | . 2 ⊢ (𝜑 → ∼ Er 𝑈) | |
4 | eropr2.5 | . 2 ⊢ (𝜑 → 𝐴 ⊆ 𝑈) | |
5 | eropr2.6 | . 2 ⊢ (𝜑 → + :(𝐴 × 𝐴)⟶𝐴) | |
6 | eropr2.7 | . 2 ⊢ ((𝜑 ∧ ((𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑡 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴))) → ((𝑟 ∼ 𝑠 ∧ 𝑡 ∼ 𝑢) → (𝑟 + 𝑡) ∼ (𝑠 + 𝑢))) | |
7 | eropr2.2 | . 2 ⊢ ⨣ = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑥 = [𝑝] ∼ ∧ 𝑦 = [𝑞] ∼ ) ∧ 𝑧 = [(𝑝 + 𝑞)] ∼ )} | |
8 | 1, 1, 2, 3, 3, 3, 4, 4, 4, 5, 6, 7, 2, 2, 1 | eroprf 8578 | 1 ⊢ (𝜑 → ⨣ :(𝐽 × 𝐽)⟶𝐽) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2109 ∃wrex 3066 ⊆ wss 3891 class class class wbr 5078 × cxp 5586 ⟶wf 6426 (class class class)co 7268 {coprab 7269 Er wer 8469 [cec 8470 / cqs 8471 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pr 5355 ax-un 7579 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-ral 3070 df-rex 3071 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4845 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-id 5488 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-fv 6438 df-ov 7271 df-oprab 7272 df-mpo 7273 df-1st 7817 df-2nd 7818 df-er 8472 df-ec 8474 df-qs 8478 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |