| 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 2215 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) | |
| 2 | 1 | ancoms 462 | . . . . . 6 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) |
| 3 | vex 3457 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 4 | 3 | elima2 6051 | . . . . . 6 ⊢ (𝑦 ∈ (𝑅 “ 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) |
| 5 | 2, 4 | sylibr 236 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ (𝑅 “ 𝐴)) |
| 6 | vex 3457 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 7 | 3, 6 | brcnv 5850 | . . . . . 6 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
| 8 | 7 | biranri 509 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦◡𝑅𝑥) |
| 9 | 5, 8 | jca 519 | . . . 4 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 10 | 9 | eximi 1854 | . . 3 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 11 | 6 | eldm 5872 | . . . . 5 ⊢ (𝑥 ∈ dom 𝑅 ↔ ∃𝑦 𝑥𝑅𝑦) |
| 12 | 11 | anbi1i 633 | . . . 4 ⊢ ((𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) |
| 13 | elin 3918 | . . . 4 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ (𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴)) | |
| 14 | 19.41v 1968 | . . . 4 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) | |
| 15 | 12, 13, 14 | 3bitr4i 305 | . . 3 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴)) |
| 16 | 6 | elima2 6051 | . . 3 ⊢ (𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴)) ↔ ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥)) |
| 17 | 10, 15, 16 | 3imtr4i 294 | . 2 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴))) |
| 18 | 17 | ssriv 3938 | 1 ⊢ (dom 𝑅 ∩ 𝐴) ⊆ (◡𝑅 “ (𝑅 “ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 399 ∃wex 1798 ∈ wcel 2141 ∩ cin 3901 ⊆ wss 3902 class class class wbr 5097 ◡ccnv 5642 dom cdm 5643 “ cima 5646 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 df-opab 5160 df-xp 5649 df-cnv 5651 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 |
| This theorem is referenced by: lmhmlsp 21104 cnclsi 23320 kgencn3 23606 kqsat 23779 kqcldsat 23781 cfilucfil 24607 elrgspnsubrunlem2 33390 elrspunidl 33575 |
| Copyright terms: Public domain | W3C validator |