| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > intimasn | Structured version Visualization version GIF version | ||
| Description: Two ways to express the image of a singleton when the relation is an intersection. (Contributed by RP, 13-Apr-2020.) |
| Ref | Expression |
|---|---|
| intimasn | ⊢ (𝐵 ∈ 𝑉 → (∩ 𝐴 “ {𝐵}) = ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ {𝐵})}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-5 1943 | . 2 ⊢ (𝐵 ∈ 𝑉 → ∀𝑦 𝐵 ∈ 𝑉) | |
| 2 | r19.12sn 4680 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → (∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎 ↔ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎)) | |
| 3 | 2 | biimprd 251 | . . 3 ⊢ (𝐵 ∈ 𝑉 → (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎 → ∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎)) |
| 4 | 3 | alimi 1844 | . 2 ⊢ (∀𝑦 𝐵 ∈ 𝑉 → ∀𝑦(∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎 → ∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎)) |
| 5 | intimag 44600 | . 2 ⊢ (∀𝑦(∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎 → ∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎) → (∩ 𝐴 “ {𝐵}) = ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ {𝐵})}) | |
| 6 | 1, 4, 5 | 3syl 19 | 1 ⊢ (𝐵 ∈ 𝑉 → (∩ 𝐴 “ {𝐵}) = ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ {𝐵})}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1568 = wceq 1570 ∈ wcel 2145 {cab 2738 ∀wral 3076 ∃wrex 3086 {csn 4583 〈cop 4589 ∩ cint 4906 “ cima 5650 |
| 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-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7734 |
| 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-nf 1817 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-xp 5653 df-cnv 5655 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 |
| This theorem is used by: intimasn2 44602 brtrclfv2 44671 |
| Copyright terms: Public domain | W3C validator |