Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > imasless | Structured version Visualization version GIF version |
Description: The order relation defined on an image set is a subset of the base set. (Contributed by Mario Carneiro, 24-Feb-2015.) |
Ref | Expression |
---|---|
imasless.u | ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅)) |
imasless.v | ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) |
imasless.f | ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵) |
imasless.r | ⊢ (𝜑 → 𝑅 ∈ 𝑍) |
imasless.l | ⊢ ≤ = (le‘𝑈) |
Ref | Expression |
---|---|
imasless | ⊢ (𝜑 → ≤ ⊆ (𝐵 × 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | imasless.u | . . 3 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅)) | |
2 | imasless.v | . . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) | |
3 | imasless.f | . . 3 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵) | |
4 | imasless.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑍) | |
5 | eqid 2737 | . . 3 ⊢ (le‘𝑅) = (le‘𝑅) | |
6 | imasless.l | . . 3 ⊢ ≤ = (le‘𝑈) | |
7 | 1, 2, 3, 4, 5, 6 | imasle 17028 | . 2 ⊢ (𝜑 → ≤ = ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹)) |
8 | relco 6108 | . . . 4 ⊢ Rel ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) | |
9 | relssdmrn 6132 | . . . 4 ⊢ (Rel ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) → ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ (dom ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) × ran ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹))) | |
10 | 8, 9 | ax-mp 5 | . . 3 ⊢ ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ (dom ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) × ran ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹)) |
11 | dmco 6118 | . . . . 5 ⊢ dom ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) = (◡◡𝐹 “ dom (𝐹 ∘ (le‘𝑅))) | |
12 | fof 6633 | . . . . . . . . 9 ⊢ (𝐹:𝑉–onto→𝐵 → 𝐹:𝑉⟶𝐵) | |
13 | frel 6550 | . . . . . . . . 9 ⊢ (𝐹:𝑉⟶𝐵 → Rel 𝐹) | |
14 | 3, 12, 13 | 3syl 18 | . . . . . . . 8 ⊢ (𝜑 → Rel 𝐹) |
15 | dfrel2 6052 | . . . . . . . 8 ⊢ (Rel 𝐹 ↔ ◡◡𝐹 = 𝐹) | |
16 | 14, 15 | sylib 221 | . . . . . . 7 ⊢ (𝜑 → ◡◡𝐹 = 𝐹) |
17 | 16 | imaeq1d 5928 | . . . . . 6 ⊢ (𝜑 → (◡◡𝐹 “ dom (𝐹 ∘ (le‘𝑅))) = (𝐹 “ dom (𝐹 ∘ (le‘𝑅)))) |
18 | imassrn 5940 | . . . . . . 7 ⊢ (𝐹 “ dom (𝐹 ∘ (le‘𝑅))) ⊆ ran 𝐹 | |
19 | forn 6636 | . . . . . . . 8 ⊢ (𝐹:𝑉–onto→𝐵 → ran 𝐹 = 𝐵) | |
20 | 3, 19 | syl 17 | . . . . . . 7 ⊢ (𝜑 → ran 𝐹 = 𝐵) |
21 | 18, 20 | sseqtrid 3953 | . . . . . 6 ⊢ (𝜑 → (𝐹 “ dom (𝐹 ∘ (le‘𝑅))) ⊆ 𝐵) |
22 | 17, 21 | eqsstrd 3939 | . . . . 5 ⊢ (𝜑 → (◡◡𝐹 “ dom (𝐹 ∘ (le‘𝑅))) ⊆ 𝐵) |
23 | 11, 22 | eqsstrid 3949 | . . . 4 ⊢ (𝜑 → dom ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ 𝐵) |
24 | rncoss 5841 | . . . . 5 ⊢ ran ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ ran (𝐹 ∘ (le‘𝑅)) | |
25 | rnco2 6117 | . . . . . 6 ⊢ ran (𝐹 ∘ (le‘𝑅)) = (𝐹 “ ran (le‘𝑅)) | |
26 | imassrn 5940 | . . . . . . 7 ⊢ (𝐹 “ ran (le‘𝑅)) ⊆ ran 𝐹 | |
27 | 26, 20 | sseqtrid 3953 | . . . . . 6 ⊢ (𝜑 → (𝐹 “ ran (le‘𝑅)) ⊆ 𝐵) |
28 | 25, 27 | eqsstrid 3949 | . . . . 5 ⊢ (𝜑 → ran (𝐹 ∘ (le‘𝑅)) ⊆ 𝐵) |
29 | 24, 28 | sstrid 3912 | . . . 4 ⊢ (𝜑 → ran ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ 𝐵) |
30 | xpss12 5566 | . . . 4 ⊢ ((dom ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ 𝐵 ∧ ran ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ 𝐵) → (dom ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) × ran ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹)) ⊆ (𝐵 × 𝐵)) | |
31 | 23, 29, 30 | syl2anc 587 | . . 3 ⊢ (𝜑 → (dom ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) × ran ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹)) ⊆ (𝐵 × 𝐵)) |
32 | 10, 31 | sstrid 3912 | . 2 ⊢ (𝜑 → ((𝐹 ∘ (le‘𝑅)) ∘ ◡𝐹) ⊆ (𝐵 × 𝐵)) |
33 | 7, 32 | eqsstrd 3939 | 1 ⊢ (𝜑 → ≤ ⊆ (𝐵 × 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2110 ⊆ wss 3866 × cxp 5549 ◡ccnv 5550 dom cdm 5551 ran crn 5552 “ cima 5554 ∘ ccom 5555 Rel wrel 5556 ⟶wf 6376 –onto→wfo 6378 ‘cfv 6380 (class class class)co 7213 Basecbs 16760 lecple 16809 “s cimas 17009 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5179 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-1st 7761 df-2nd 7762 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-1o 8202 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-fin 8630 df-sup 9058 df-inf 9059 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-nn 11831 df-2 11893 df-3 11894 df-4 11895 df-5 11896 df-6 11897 df-7 11898 df-8 11899 df-9 11900 df-n0 12091 df-z 12177 df-dec 12294 df-uz 12439 df-fz 13096 df-struct 16700 df-slot 16735 df-ndx 16745 df-base 16761 df-plusg 16815 df-mulr 16816 df-sca 16818 df-vsca 16819 df-ip 16820 df-tset 16821 df-ple 16822 df-ds 16824 df-imas 17013 |
This theorem is referenced by: xpsless 17083 |
Copyright terms: Public domain | W3C validator |