Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ipopos | Structured version Visualization version GIF version |
Description: The inclusion poset on a family of sets is actually a poset. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
Ref | Expression |
---|---|
ipopos.i | ⊢ 𝐼 = (toInc‘𝐹) |
Ref | Expression |
---|---|
ipopos | ⊢ 𝐼 ∈ Poset |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ipopos.i | . . . . 5 ⊢ 𝐼 = (toInc‘𝐹) | |
2 | fvex 6113 | . . . . 5 ⊢ (toInc‘𝐹) ∈ V | |
3 | 1, 2 | eqeltri 2684 | . . . 4 ⊢ 𝐼 ∈ V |
4 | 3 | a1i 11 | . . 3 ⊢ (𝐹 ∈ V → 𝐼 ∈ V) |
5 | 1 | ipobas 16978 | . . 3 ⊢ (𝐹 ∈ V → 𝐹 = (Base‘𝐼)) |
6 | eqidd 2611 | . . 3 ⊢ (𝐹 ∈ V → (le‘𝐼) = (le‘𝐼)) | |
7 | ssid 3587 | . . . 4 ⊢ 𝑎 ⊆ 𝑎 | |
8 | eqid 2610 | . . . . . 6 ⊢ (le‘𝐼) = (le‘𝐼) | |
9 | 1, 8 | ipole 16981 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹 ∧ 𝑎 ∈ 𝐹) → (𝑎(le‘𝐼)𝑎 ↔ 𝑎 ⊆ 𝑎)) |
10 | 9 | 3anidm23 1377 | . . . 4 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹) → (𝑎(le‘𝐼)𝑎 ↔ 𝑎 ⊆ 𝑎)) |
11 | 7, 10 | mpbiri 247 | . . 3 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹) → 𝑎(le‘𝐼)𝑎) |
12 | 1, 8 | ipole 16981 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹) → (𝑎(le‘𝐼)𝑏 ↔ 𝑎 ⊆ 𝑏)) |
13 | 1, 8 | ipole 16981 | . . . . . 6 ⊢ ((𝐹 ∈ V ∧ 𝑏 ∈ 𝐹 ∧ 𝑎 ∈ 𝐹) → (𝑏(le‘𝐼)𝑎 ↔ 𝑏 ⊆ 𝑎)) |
14 | 13 | 3com23 1263 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹) → (𝑏(le‘𝐼)𝑎 ↔ 𝑏 ⊆ 𝑎)) |
15 | 12, 14 | anbi12d 743 | . . . 4 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹) → ((𝑎(le‘𝐼)𝑏 ∧ 𝑏(le‘𝐼)𝑎) ↔ (𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑎))) |
16 | simpl 472 | . . . . 5 ⊢ ((𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑎) → 𝑎 ⊆ 𝑏) | |
17 | simpr 476 | . . . . 5 ⊢ ((𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑎) → 𝑏 ⊆ 𝑎) | |
18 | 16, 17 | eqssd 3585 | . . . 4 ⊢ ((𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑎) → 𝑎 = 𝑏) |
19 | 15, 18 | syl6bi 242 | . . 3 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹) → ((𝑎(le‘𝐼)𝑏 ∧ 𝑏(le‘𝐼)𝑎) → 𝑎 = 𝑏)) |
20 | sstr 3576 | . . . . 5 ⊢ ((𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑐) → 𝑎 ⊆ 𝑐) | |
21 | 20 | a1i 11 | . . . 4 ⊢ ((𝐹 ∈ V ∧ (𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹)) → ((𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑐) → 𝑎 ⊆ 𝑐)) |
22 | 12 | 3adant3r3 1268 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ (𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹)) → (𝑎(le‘𝐼)𝑏 ↔ 𝑎 ⊆ 𝑏)) |
23 | 1, 8 | ipole 16981 | . . . . . 6 ⊢ ((𝐹 ∈ V ∧ 𝑏 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹) → (𝑏(le‘𝐼)𝑐 ↔ 𝑏 ⊆ 𝑐)) |
24 | 23 | 3adant3r1 1266 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ (𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹)) → (𝑏(le‘𝐼)𝑐 ↔ 𝑏 ⊆ 𝑐)) |
25 | 22, 24 | anbi12d 743 | . . . 4 ⊢ ((𝐹 ∈ V ∧ (𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹)) → ((𝑎(le‘𝐼)𝑏 ∧ 𝑏(le‘𝐼)𝑐) ↔ (𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑐))) |
26 | 1, 8 | ipole 16981 | . . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝑎 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹) → (𝑎(le‘𝐼)𝑐 ↔ 𝑎 ⊆ 𝑐)) |
27 | 26 | 3adant3r2 1267 | . . . 4 ⊢ ((𝐹 ∈ V ∧ (𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹)) → (𝑎(le‘𝐼)𝑐 ↔ 𝑎 ⊆ 𝑐)) |
28 | 21, 25, 27 | 3imtr4d 282 | . . 3 ⊢ ((𝐹 ∈ V ∧ (𝑎 ∈ 𝐹 ∧ 𝑏 ∈ 𝐹 ∧ 𝑐 ∈ 𝐹)) → ((𝑎(le‘𝐼)𝑏 ∧ 𝑏(le‘𝐼)𝑐) → 𝑎(le‘𝐼)𝑐)) |
29 | 4, 5, 6, 11, 19, 28 | isposd 16778 | . 2 ⊢ (𝐹 ∈ V → 𝐼 ∈ Poset) |
30 | fvprc 6097 | . . . 4 ⊢ (¬ 𝐹 ∈ V → (toInc‘𝐹) = ∅) | |
31 | 1, 30 | syl5eq 2656 | . . 3 ⊢ (¬ 𝐹 ∈ V → 𝐼 = ∅) |
32 | 0pos 16777 | . . 3 ⊢ ∅ ∈ Poset | |
33 | 31, 32 | syl6eqel 2696 | . 2 ⊢ (¬ 𝐹 ∈ V → 𝐼 ∈ Poset) |
34 | 29, 33 | pm2.61i 175 | 1 ⊢ 𝐼 ∈ Poset |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ⊆ wss 3540 ∅c0 3874 class class class wbr 4583 ‘cfv 5804 lecple 15775 Posetcpo 16763 toInccipo 16974 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-fz 12198 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-tset 15787 df-ple 15788 df-ocomp 15790 df-poset 16769 df-ipo 16975 |
This theorem is referenced by: isipodrs 16984 mrelatglb 17007 mrelatglb0 17008 mrelatlub 17009 mreclatBAD 17010 |
Copyright terms: Public domain | W3C validator |