![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > qusin | Structured version Visualization version GIF version |
Description: Restrict the equivalence relation in a quotient structure to the base set. (Contributed by Mario Carneiro, 23-Feb-2015.) |
Ref | Expression |
---|---|
qusin.u | ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ )) |
qusin.v | ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) |
qusin.e | ⊢ (𝜑 → ∼ ∈ 𝑊) |
qusin.r | ⊢ (𝜑 → 𝑅 ∈ 𝑍) |
qusin.s | ⊢ (𝜑 → ( ∼ “ 𝑉) ⊆ 𝑉) |
Ref | Expression |
---|---|
qusin | ⊢ (𝜑 → 𝑈 = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | qusin.s | . . . . 5 ⊢ (𝜑 → ( ∼ “ 𝑉) ⊆ 𝑉) | |
2 | ecinxp 8782 | . . . . 5 ⊢ ((( ∼ “ 𝑉) ⊆ 𝑉 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉))) | |
3 | 1, 2 | sylan 580 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉))) |
4 | 3 | mpteq2dva 5247 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉)))) |
5 | 4 | oveq1d 7420 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅)) |
6 | qusin.u | . . 3 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ )) | |
7 | qusin.v | . . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) | |
8 | eqid 2732 | . . 3 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
9 | qusin.e | . . 3 ⊢ (𝜑 → ∼ ∈ 𝑊) | |
10 | qusin.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑍) | |
11 | 6, 7, 8, 9, 10 | qusval 17484 | . 2 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅)) |
12 | eqidd 2733 | . . 3 ⊢ (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉)))) | |
13 | eqid 2732 | . . 3 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) | |
14 | inex1g 5318 | . . . 4 ⊢ ( ∼ ∈ 𝑊 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V) | |
15 | 9, 14 | syl 17 | . . 3 ⊢ (𝜑 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V) |
16 | 12, 7, 13, 15, 10 | qusval 17484 | . 2 ⊢ (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅)) |
17 | 5, 11, 16 | 3eqtr4d 2782 | 1 ⊢ (𝜑 → 𝑈 = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∩ cin 3946 ⊆ wss 3947 ↦ cmpt 5230 × cxp 5673 “ cima 5678 ‘cfv 6540 (class class class)co 7405 [cec 8697 Basecbs 17140 “s cimas 17446 /s cqus 17447 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3777 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fv 6548 df-ov 7408 df-oprab 7409 df-mpo 7410 df-ec 8701 df-qus 17451 |
This theorem is referenced by: pi1addf 24554 pi1addval 24555 pi1grplem 24556 |
Copyright terms: Public domain | W3C validator |