| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rint0 | Structured version Visualization version GIF version | ||
| Description: Relative intersection of an empty set. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
| Ref | Expression |
|---|---|
| rint0 | ⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inteq 4913 | . . 3 ⊢ (𝑋 = ∅ → ∩ 𝑋 = ∩ ∅) | |
| 2 | 1 | ineq2d 4169 | . 2 ⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = (𝐴 ∩ ∩ ∅)) |
| 3 | int0 4925 | . . . 4 ⊢ ∩ ∅ = V | |
| 4 | 3 | ineq2i 4166 | . . 3 ⊢ (𝐴 ∩ ∩ ∅) = (𝐴 ∩ V) |
| 5 | inv1 4351 | . . 3 ⊢ (𝐴 ∩ V) = 𝐴 | |
| 6 | 4, 5 | eqtri 2785 | . 2 ⊢ (𝐴 ∩ ∩ ∅) = 𝐴 |
| 7 | 2, 6 | eqtrdi 2813 | 1 ⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 Vcvv 3453 ∩ cin 3901 ∅c0 4282 ∩ cint 4910 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-in 3909 df-ss 3919 df-nul 4283 df-int 4911 |
| This theorem is used by: incexclem 15929 incexc 15930 mrerintcl 17687 ismred2 17693 txtube 23872 bj-mooreset 37860 bj-ismoored0 37864 bj-ismooredr2 37868 |
| Copyright terms: Public domain | W3C validator |