| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-restb | Structured version Visualization version GIF version | ||
| Description: An elementwise intersection by a set on a family containing a superset of that set contains that set. (Contributed by BJ, 27-Apr-2021.) |
| Ref | Expression |
|---|---|
| bj-restb | ⊢ (𝑋 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ (𝑋 ↾t 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . . . . . . 8 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ 𝐵) | |
| 2 | ssidd 3954 | . . . . . . . 8 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ 𝐴) | |
| 3 | 1, 2 | ssind 4186 | . . . . . . 7 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ (𝐵 ∩ 𝐴)) |
| 4 | inss2 4183 | . . . . . . . 8 ⊢ (𝐵 ∩ 𝐴) ⊆ 𝐴 | |
| 5 | 4 | a1i 11 | . . . . . . 7 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ∩ 𝐴) ⊆ 𝐴) |
| 6 | 3, 5 | eqssd 3948 | . . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 = (𝐵 ∩ 𝐴)) |
| 7 | eleq1 2848 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑋 ↔ 𝐵 ∈ 𝑋)) | |
| 8 | ineq1 4159 | . . . . . . . . . . 11 ⊢ (𝑦 = 𝐵 → (𝑦 ∩ 𝐴) = (𝐵 ∩ 𝐴)) | |
| 9 | 8 | eqeq2d 2771 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝐴 = (𝑦 ∩ 𝐴) ↔ 𝐴 = (𝐵 ∩ 𝐴))) |
| 10 | 7, 9 | anbi12d 644 | . . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴)) ↔ (𝐵 ∈ 𝑋 ∧ 𝐴 = (𝐵 ∩ 𝐴)))) |
| 11 | 10 | spcegv 3551 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑋 → ((𝐵 ∈ 𝑋 ∧ 𝐴 = (𝐵 ∩ 𝐴)) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴)))) |
| 12 | 11 | expd 421 | . . . . . . 7 ⊢ (𝐵 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝐴 = (𝐵 ∩ 𝐴) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴))))) |
| 13 | 12 | pm2.43i 53 | . . . . . 6 ⊢ (𝐵 ∈ 𝑋 → (𝐴 = (𝐵 ∩ 𝐴) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴)))) |
| 14 | 6, 13 | mpan9 516 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴))) |
| 15 | df-rex 3087 | . . . . 5 ⊢ (∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴))) | |
| 16 | 14, 15 | sylibr 237 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴)) |
| 17 | 16 | adantl 487 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋)) → ∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴)) |
| 18 | ssexg 5284 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ V) | |
| 19 | elrest 17512 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝐴 ∈ (𝑋 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴))) | |
| 20 | 18, 19 | sylan2 605 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋)) → (𝐴 ∈ (𝑋 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴))) |
| 21 | 17, 20 | mpbird 260 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋)) → 𝐴 ∈ (𝑋 ↾t 𝐴)) |
| 22 | 21 | ex 418 | 1 ⊢ (𝑋 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ (𝑋 ↾t 𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ∃wrex 3086 Vcvv 3450 ∩ cin 3898 ⊆ wss 3899 (class class class)co 7413 ↾t crest 17505 |
| 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-rep 5232 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 |
| 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-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 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-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-rest 17507 |
| This theorem is used by: bj-restv 37845 bj-resta 37846 |
| Copyright terms: Public domain | W3C validator |