| 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 4120 | . 2 ⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = (𝐴 ∩ ∩ ∅)) |
| 3 | int0 4925 | . . . 4 ⊢ ∩ ∅ = V | |
| 4 | 3 | ineq2i 4117 | . . 3 ⊢ (𝐴 ∩ ∩ ∅) = (𝐴 ∩ V) |
| 5 | inv1 4351 | . . 3 ⊢ (𝐴 ∩ V) = 𝐴 | |
| 6 | 4, 5 | eqtri 2786 | . 2 ⊢ (𝐴 ∩ ∩ ∅) = 𝐴 |
| 7 | 2, 6 | eqtrdi 2814 | 1 ⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 Vcvv 3454 ∩ cin 4092 ∅c0 4281 ∩ 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-nul 4282 df-int 4911 |
| This theorem is used by: incexclem 16037 incexc 16038 mrerintcl 17799 ismred2 17805 txtube 23992 bj-mooreset 38227 bj-ismoored0 38231 bj-ismooredr2 38235 |
| Copyright terms: Public domain | W3C validator |