Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eroprf2 | 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 6602 | 1 ⊢ (𝜑 → ⨣ :(𝐽 × 𝐽)⟶𝐽) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1348 ∈ wcel 2141 ∃wrex 2449 ⊆ wss 3121 class class class wbr 3987 × cxp 4607 ⟶wf 5192 (class class class)co 5850 {coprab 5851 Er wer 6506 [cec 6507 / cqs 6508 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4105 ax-pow 4158 ax-pr 4192 ax-un 4416 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-un 3125 df-in 3127 df-ss 3134 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-iun 3873 df-br 3988 df-opab 4049 df-mpt 4050 df-id 4276 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-rn 4620 df-res 4621 df-ima 4622 df-iota 5158 df-fun 5198 df-fn 5199 df-f 5200 df-fv 5204 df-ov 5853 df-oprab 5854 df-mpo 5855 df-1st 6116 df-2nd 6117 df-er 6509 df-ec 6511 df-qs 6515 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |