Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ustneism | Structured version Visualization version GIF version |
Description: For a point 𝐴 in 𝑋, (𝑉 “ {𝐴}) is small enough in (𝑉 ∘ ◡𝑉). This proposition actually does not require any axiom of the definition of uniform structures. (Contributed by Thierry Arnoux, 18-Nov-2017.) |
Ref | Expression |
---|---|
ustneism | ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})) ⊆ (𝑉 ∘ ◡𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snnzg 4710 | . . . 4 ⊢ (𝐴 ∈ 𝑋 → {𝐴} ≠ ∅) | |
2 | 1 | adantl 482 | . . 3 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → {𝐴} ≠ ∅) |
3 | xpco 6192 | . . 3 ⊢ ({𝐴} ≠ ∅ → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) = ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴}))) | |
4 | 2, 3 | syl 17 | . 2 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) = ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴}))) |
5 | cnvxp 6060 | . . . . 5 ⊢ ◡({𝐴} × (𝑉 “ {𝐴})) = ((𝑉 “ {𝐴}) × {𝐴}) | |
6 | ressn 6188 | . . . . . . 7 ⊢ (𝑉 ↾ {𝐴}) = ({𝐴} × (𝑉 “ {𝐴})) | |
7 | 6 | cnveqi 5783 | . . . . . 6 ⊢ ◡(𝑉 ↾ {𝐴}) = ◡({𝐴} × (𝑉 “ {𝐴})) |
8 | resss 5916 | . . . . . . 7 ⊢ (𝑉 ↾ {𝐴}) ⊆ 𝑉 | |
9 | cnvss 5781 | . . . . . . 7 ⊢ ((𝑉 ↾ {𝐴}) ⊆ 𝑉 → ◡(𝑉 ↾ {𝐴}) ⊆ ◡𝑉) | |
10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ ◡(𝑉 ↾ {𝐴}) ⊆ ◡𝑉 |
11 | 7, 10 | eqsstrri 3956 | . . . . 5 ⊢ ◡({𝐴} × (𝑉 “ {𝐴})) ⊆ ◡𝑉 |
12 | 5, 11 | eqsstrri 3956 | . . . 4 ⊢ ((𝑉 “ {𝐴}) × {𝐴}) ⊆ ◡𝑉 |
13 | coss2 5765 | . . . 4 ⊢ (((𝑉 “ {𝐴}) × {𝐴}) ⊆ ◡𝑉 → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉)) | |
14 | 12, 13 | mp1i 13 | . . 3 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉)) |
15 | 6, 8 | eqsstrri 3956 | . . . 4 ⊢ ({𝐴} × (𝑉 “ {𝐴})) ⊆ 𝑉 |
16 | coss1 5764 | . . . 4 ⊢ (({𝐴} × (𝑉 “ {𝐴})) ⊆ 𝑉 → (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉) ⊆ (𝑉 ∘ ◡𝑉)) | |
17 | 15, 16 | mp1i 13 | . . 3 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉) ⊆ (𝑉 ∘ ◡𝑉)) |
18 | 14, 17 | sstrd 3931 | . 2 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (𝑉 ∘ ◡𝑉)) |
19 | 4, 18 | eqsstrrd 3960 | 1 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})) ⊆ (𝑉 ∘ ◡𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ⊆ wss 3887 ∅c0 4256 {csn 4561 × cxp 5587 ◡ccnv 5588 ↾ cres 5591 “ cima 5592 ∘ ccom 5593 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 |
This theorem is referenced by: neipcfilu 23448 |
Copyright terms: Public domain | W3C validator |