![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ssrest | Structured version Visualization version GIF version |
Description: If 𝐾 is a finer topology than 𝐽, then the subspace topologies induced by 𝐴 maintain this relationship. (Contributed by Mario Carneiro, 21-Mar-2015.) (Revised by Mario Carneiro, 1-May-2015.) |
Ref | Expression |
---|---|
ssrest | ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) → (𝐽 ↾t 𝐴) ⊆ (𝐾 ↾t 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 484 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → 𝑥 ∈ (𝐽 ↾t 𝐴)) | |
2 | ssrexv 4078 | . . . . . 6 ⊢ (𝐽 ⊆ 𝐾 → (∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴) → ∃𝑦 ∈ 𝐾 𝑥 = (𝑦 ∩ 𝐴))) | |
3 | 2 | ad2antlr 726 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → (∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴) → ∃𝑦 ∈ 𝐾 𝑥 = (𝑦 ∩ 𝐴))) |
4 | n0i 4363 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ¬ (𝐽 ↾t 𝐴) = ∅) | |
5 | restfn 17484 | . . . . . . . . . 10 ⊢ ↾t Fn (V × V) | |
6 | 5 | fndmi 6683 | . . . . . . . . 9 ⊢ dom ↾t = (V × V) |
7 | 6 | ndmov 7634 | . . . . . . . 8 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
8 | 4, 7 | nsyl2 141 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
9 | 8 | adantl 481 | . . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
10 | elrest 17487 | . . . . . 6 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) | |
11 | 9, 10 | syl 17 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) |
12 | simpll 766 | . . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → 𝐾 ∈ 𝑉) | |
13 | 9 | simprd 495 | . . . . . 6 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → 𝐴 ∈ V) |
14 | elrest 17487 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝑥 ∈ (𝐾 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐾 𝑥 = (𝑦 ∩ 𝐴))) | |
15 | 12, 13, 14 | syl2anc 583 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → (𝑥 ∈ (𝐾 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐾 𝑥 = (𝑦 ∩ 𝐴))) |
16 | 3, 11, 15 | 3imtr4d 294 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ∈ (𝐾 ↾t 𝐴))) |
17 | 1, 16 | mpd 15 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐽 ↾t 𝐴)) → 𝑥 ∈ (𝐾 ↾t 𝐴)) |
18 | 17 | ex 412 | . 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ∈ (𝐾 ↾t 𝐴))) |
19 | 18 | ssrdv 4014 | 1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐾) → (𝐽 ↾t 𝐴) ⊆ (𝐾 ↾t 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∃wrex 3076 Vcvv 3488 ∩ cin 3975 ⊆ wss 3976 ∅c0 4352 × cxp 5698 (class class class)co 7448 ↾t crest 17480 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 df-rest 17482 |
This theorem is referenced by: 1stcrest 23482 kgencmp 23574 kgencmp2 23575 kgen2ss 23584 ssufl 23947 cnfsmf 46661 smfsssmf 46664 |
Copyright terms: Public domain | W3C validator |