| 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 1938 | . 2 ⊢ (𝐵 ∈ 𝑉 → ∀𝑦 𝐵 ∈ 𝑉) | |
| 2 | r19.12sn 4685 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → (∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎 ↔ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎)) | |
| 3 | 2 | biimprd 251 | . . 3 ⊢ (𝐵 ∈ 𝑉 → (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎 → ∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎)) |
| 4 | 3 | alimi 1839 | . 2 ⊢ (∀𝑦 𝐵 ∈ 𝑉 → ∀𝑦(∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎 → ∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎)) |
| 5 | intimag 44352 | . 2 ⊢ (∀𝑦(∀𝑎 ∈ 𝐴 ∃𝑏 ∈ {𝐵}〈𝑏, 𝑦〉 ∈ 𝑎 → ∃𝑏 ∈ {𝐵}∀𝑎 ∈ 𝐴 〈𝑏, 𝑦〉 ∈ 𝑎) → (∩ 𝐴 “ {𝐵}) = ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ {𝐵})}) | |
| 6 | 1, 4, 5 | 3syl 19 | 1 ⊢ (𝐵 ∈ 𝑉 → (∩ 𝐴 “ {𝐵}) = ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ {𝐵})}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1566 = wceq 1568 ∈ wcel 2141 {cab 2739 ∀wral 3077 ∃wrex 3087 {csn 4588 〈cop 4594 ∩ cint 4911 “ cima 5664 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ral 3078 df-rex 3088 df-rab 3415 df-v 3455 df-sbc 3744 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-br 5109 df-opab 5173 df-xp 5667 df-cnv 5669 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 |
| This theorem is referenced by: intimasn2 44354 brtrclfv2 44423 |
| Copyright terms: Public domain | W3C validator |