| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > resinsn | Structured version Visualization version GIF version | ||
| Description: Restriction to the intersection with a singleton. (Contributed by Zhi Wang, 6-Oct-2025.) |
| Ref | Expression |
|---|---|
| resinsn | ⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relres 6000 | . . 3 ⊢ Rel (𝐹 ↾ (𝐴 ∩ {𝐵})) | |
| 2 | reldm0 5914 | . . 3 ⊢ (Rel (𝐹 ↾ (𝐴 ∩ {𝐵})) → ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅)) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅) |
| 4 | incom 4108 | . . . 4 ⊢ ((𝐴 ∩ {𝐵}) ∩ dom 𝐹) = (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) | |
| 5 | dmres 6008 | . . . 4 ⊢ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ((𝐴 ∩ {𝐵}) ∩ dom 𝐹) | |
| 6 | inass 4126 | . . . 4 ⊢ ((dom 𝐹 ∩ 𝐴) ∩ {𝐵}) = (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) | |
| 7 | 4, 5, 6 | 3eqtr4i 2796 | . . 3 ⊢ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ((dom 𝐹 ∩ 𝐴) ∩ {𝐵}) |
| 8 | 7 | eqeq1i 2768 | . 2 ⊢ (dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ ((dom 𝐹 ∩ 𝐴) ∩ {𝐵}) = ∅) |
| 9 | disjsn 4671 | . 2 ⊢ (((dom 𝐹 ∩ 𝐴) ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴)) | |
| 10 | 3, 8, 9 | 3bitri 300 | 1 ⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 = wceq 1569 ∈ wcel 2146 ∩ cin 4091 ∅c0 4280 {csn 4587 dom cdm 5654 ↾ cres 5656 Rel wrel 5659 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5251 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-br 5106 df-opab 5170 df-xp 5660 df-rel 5661 df-dm 5664 df-res 5666 |
| This theorem is used by: tposres2 50132 |
| Copyright terms: Public domain | W3C validator |