| 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 8814 | . . . . 5 ⊢ ((( ∼ “ 𝑉) ⊆ 𝑉 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉))) | |
| 3 | 1, 2 | sylan 580 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → [𝑥] ∼ = [𝑥]( ∼ ∩ (𝑉 × 𝑉))) |
| 4 | 3 | mpteq2dva 5222 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉)))) |
| 5 | 4 | oveq1d 7428 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅)) |
| 6 | qusin.u | . . 3 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ )) | |
| 7 | qusin.v | . . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) | |
| 8 | eqid 2734 | . . 3 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
| 9 | qusin.e | . . 3 ⊢ (𝜑 → ∼ ∈ 𝑊) | |
| 10 | qusin.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑍) | |
| 11 | 6, 7, 8, 9, 10 | qusval 17558 | . 2 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅)) |
| 12 | eqidd 2735 | . . 3 ⊢ (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉)))) | |
| 13 | eqid 2734 | . . 3 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) = (𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) | |
| 14 | inex1g 5299 | . . . 4 ⊢ ( ∼ ∈ 𝑊 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V) | |
| 15 | 9, 14 | syl 17 | . . 3 ⊢ (𝜑 → ( ∼ ∩ (𝑉 × 𝑉)) ∈ V) |
| 16 | 12, 7, 13, 15, 10 | qusval 17558 | . 2 ⊢ (𝜑 → (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉))) = ((𝑥 ∈ 𝑉 ↦ [𝑥]( ∼ ∩ (𝑉 × 𝑉))) “s 𝑅)) |
| 17 | 5, 11, 16 | 3eqtr4d 2779 | 1 ⊢ (𝜑 → 𝑈 = (𝑅 /s ( ∼ ∩ (𝑉 × 𝑉)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2107 Vcvv 3463 ∩ cin 3930 ⊆ wss 3931 ↦ cmpt 5205 × cxp 5663 “ cima 5668 ‘cfv 6541 (class class class)co 7413 [cec 8725 Basecbs 17229 “s cimas 17520 /s cqus 17521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pr 5412 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3420 df-v 3465 df-sbc 3771 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-br 5124 df-opab 5186 df-mpt 5206 df-id 5558 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-iota 6494 df-fun 6543 df-fv 6549 df-ov 7416 df-oprab 7417 df-mpo 7418 df-ec 8729 df-qus 17525 |
| This theorem is referenced by: pi1addf 25016 pi1addval 25017 pi1grplem 25018 |
| Copyright terms: Public domain | W3C validator |