| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipolt | Structured version Visualization version GIF version | ||
| Description: Strict order condition of the inclusion poset. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
| Ref | Expression |
|---|---|
| ipolt.i | ⊢ 𝐼 = (toInc‘𝐹) |
| ipolt.l | ⊢ < = (lt‘𝐼) |
| Ref | Expression |
|---|---|
| ipolt | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ 𝑋 ⊊ 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ipolt.i | . . . 4 ⊢ 𝐼 = (toInc‘𝐹) | |
| 2 | eqid 2765 | . . . 4 ⊢ (le‘𝐼) = (le‘𝐼) | |
| 3 | 1, 2 | ipole 18578 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋(le‘𝐼)𝑌 ↔ 𝑋 ⊆ 𝑌)) |
| 4 | 3 | anbi1d 642 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → ((𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌) ↔ (𝑋 ⊆ 𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 5 | 1 | fvexi 6885 | . . . 4 ⊢ 𝐼 ∈ V |
| 6 | ipolt.l | . . . . 5 ⊢ < = (lt‘𝐼) | |
| 7 | 2, 6 | pltval 18374 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 8 | 5, 7 | mp3an1 1472 | . . 3 ⊢ ((𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 9 | 8 | 3adant1 1146 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 10 | df-pss 3927 | . . 3 ⊢ (𝑋 ⊊ 𝑌 ↔ (𝑋 ⊆ 𝑌 ∧ 𝑋 ≠ 𝑌)) | |
| 11 | 10 | a1i 11 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 ⊊ 𝑌 ↔ (𝑋 ⊆ 𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 12 | 4, 9, 11 | 3bitr4d 314 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ 𝑋 ⊊ 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 Vcvv 3457 ⊆ wss 3907 ⊊ wpss 3908 class class class wbr 5104 ‘cfv 6525 lecple 17305 ltcplt 18352 toInccipo 18571 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12222 df-2 12291 df-3 12292 df-4 12293 df-5 12294 df-6 12295 df-7 12296 df-8 12297 df-9 12298 df-n0 12493 df-z 12580 df-dec 12700 df-uz 12851 df-fz 13524 df-struct 17195 df-slot 17230 df-ndx 17242 df-base 17258 df-tset 17317 df-ple 17318 df-ocomp 17319 df-plt 18372 df-ipo 18572 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |