| 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 3936 | . . . . . . . 8 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ 𝐴) | |
| 3 | 1, 2 | ssind 4140 | . . . . . . 7 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ (𝐵 ∩ 𝐴)) |
| 4 | inss2 4137 | . . . . . . . 8 ⊢ (𝐵 ∩ 𝐴) ⊆ 𝐴 | |
| 5 | 4 | a1i 11 | . . . . . . 7 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ∩ 𝐴) ⊆ 𝐴) |
| 6 | 3, 5 | eqssd 3930 | . . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 = (𝐵 ∩ 𝐴)) |
| 7 | eleq1 2852 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑋 ↔ 𝐵 ∈ 𝑋)) | |
| 8 | ineq1 4113 | . . . . . . . . . . 11 ⊢ (𝑦 = 𝐵 → (𝑦 ∩ 𝐴) = (𝐵 ∩ 𝐴)) | |
| 9 | 8 | eqeq2d 2774 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝐴 = (𝑦 ∩ 𝐴) ↔ 𝐴 = (𝐵 ∩ 𝐴))) |
| 10 | 7, 9 | anbi12d 644 | . . . . . . . . 9 ⊢ (𝑦 = 𝐵 → ((𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴)) ↔ (𝐵 ∈ 𝑋 ∧ 𝐴 = (𝐵 ∩ 𝐴)))) |
| 11 | 10 | spcegv 3555 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑋 → ((𝐵 ∈ 𝑋 ∧ 𝐴 = (𝐵 ∩ 𝐴)) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴)))) |
| 12 | 11 | expd 421 | . . . . . . 7 ⊢ (𝐵 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝐴 = (𝐵 ∩ 𝐴) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴))))) |
| 13 | 12 | pm2.43i 53 | . . . . . 6 ⊢ (𝐵 ∈ 𝑋 → (𝐴 = (𝐵 ∩ 𝐴) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴)))) |
| 14 | 6, 13 | mpan9 516 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴))) |
| 15 | df-rex 3091 | . . . . 5 ⊢ (∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝑋 ∧ 𝐴 = (𝑦 ∩ 𝐴))) | |
| 16 | 14, 15 | sylibr 237 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → ∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴)) |
| 17 | 16 | adantl 487 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋)) → ∃𝑦 ∈ 𝑋 𝐴 = (𝑦 ∩ 𝐴)) |
| 18 | ssexg 5288 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ V) | |
| 19 | elrest 17648 | . . . 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 2147 ∃wrex 3090 Vcvv 3454 ⊆ wss 3900 ∩ cin 4092 (class class class)co 7451 ↾t crest 17641 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-rest 17643 |
| This theorem is used by: bj-restv 38286 bj-resta 38287 |
| Copyright terms: Public domain | W3C validator |