| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dminss | Structured version Visualization version GIF version | ||
| Description: An upper bound for intersection with a domain. Theorem 40 of [Suppes] p. 66, who calls it "somewhat surprising". (Contributed by NM, 11-Aug-2004.) |
| Ref | Expression |
|---|---|
| dminss | ⊢ (dom 𝑅 ∩ 𝐴) ⊆ (◡𝑅 “ (𝑅 “ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.8a 2223 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) | |
| 2 | 1 | ancoms 463 | . . . . . 6 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) |
| 3 | vex 3467 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 4 | 3 | elima2 6066 | . . . . . 6 ⊢ (𝑦 ∈ (𝑅 “ 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) |
| 5 | 2, 4 | sylibr 237 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ (𝑅 “ 𝐴)) |
| 6 | vex 3467 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 7 | 3, 6 | brcnv 5866 | . . . . . 6 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
| 8 | 7 | biranri 510 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦◡𝑅𝑥) |
| 9 | 5, 8 | jca 520 | . . . 4 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 10 | 9 | eximi 1862 | . . 3 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 11 | 6 | eldm 5888 | . . . . 5 ⊢ (𝑥 ∈ dom 𝑅 ↔ ∃𝑦 𝑥𝑅𝑦) |
| 12 | 11 | anbi1i 635 | . . . 4 ⊢ ((𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) |
| 13 | elin 3929 | . . . 4 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ (𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴)) | |
| 14 | 19.41v 1976 | . . . 4 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) | |
| 15 | 12, 13, 14 | 3bitr4i 306 | . . 3 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) |
| 16 | 6 | elima2 6066 | . . 3 ⊢ (𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴)) ↔ ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 17 | 10, 15, 16 | 3imtr4i 295 | . 2 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴))) |
| 18 | 17 | ssriv 3949 | 1 ⊢ (dom 𝑅 ∩ 𝐴) ⊆ (◡𝑅 “ (𝑅 “ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 ∃wex 1806 ∈ wcel 2149 ∩ cin 3912 ⊆ wss 3913 class class class wbr 5110 ◡ccnv 5658 dom cdm 5659 “ cima 5662 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-pr 5402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5175 df-xp 5665 df-cnv 5667 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 |
| This theorem is referenced by: lmhmlsp 21144 cnclsi 23394 kgencn3 23680 kqsat 23853 kqcldsat 23855 cfilucfil 24681 elrgspnsubrunlem2 33505 elrspunidl 33676 |
| Copyright terms: Public domain | W3C validator |