| 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 2218 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) | |
| 2 | 1 | ancoms 464 | . . . . . 6 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) |
| 3 | vex 3455 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 4 | 3 | elima2 6062 | . . . . . 6 ⊢ (𝑦 ∈ (𝑅 “ 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) |
| 5 | 2, 4 | sylibr 237 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ (𝑅 “ 𝐴)) |
| 6 | vex 3455 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 7 | 3, 6 | brcnv 5860 | . . . . . 6 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
| 8 | 7 | biranri 511 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦◡𝑅𝑥) |
| 9 | 5, 8 | jca 521 | . . . 4 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 10 | 9 | eximi 1868 | . . 3 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 11 | 6 | eldm 5882 | . . . . 5 ⊢ (𝑥 ∈ dom 𝑅 ↔ ∃𝑦 𝑥𝑅𝑦) |
| 12 | 11 | anbi1i 636 | . . . 4 ⊢ ((𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) |
| 13 | elin 3915 | . . . 4 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ (𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴)) | |
| 14 | 19.41v 1982 | . . . 4 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) | |
| 15 | 12, 13, 14 | 3bitr4i 306 | . . 3 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) |
| 16 | 6 | elima2 6062 | . . 3 ⊢ (𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴)) ↔ ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 17 | 10, 15, 16 | 3imtr4i 295 | . 2 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴))) |
| 18 | 17 | ssriv 3935 | 1 ⊢ (dom 𝑅 ∩ 𝐴) ⊆ (◡𝑅 “ (𝑅 “ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∃wex 1812 ∈ wcel 2145 ∩ cin 3898 ⊆ wss 3899 class class class wbr 5103 ◡ccnv 5650 dom cdm 5651 “ cima 5654 |
| 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-12 2213 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5657 df-cnv 5659 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 |
| This theorem is used by: lmhmlsp 21317 cnclsi 23583 kgencn3 23870 kqsat 24043 kqcldsat 24045 cfilucfil 24871 elrgspnsubrunlem2 33802 elrspunidl 33971 |
| Copyright terms: Public domain | W3C validator |