| 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 2730 | . . . 4 ⊢ (le‘𝐼) = (le‘𝐼) | |
| 3 | 1, 2 | ipole 18499 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋(le‘𝐼)𝑌 ↔ 𝑋 ⊆ 𝑌)) |
| 4 | 3 | anbi1d 631 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → ((𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌) ↔ (𝑋 ⊆ 𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 5 | 1 | fvexi 6879 | . . . 4 ⊢ 𝐼 ∈ V |
| 6 | ipolt.l | . . . . 5 ⊢ < = (lt‘𝐼) | |
| 7 | 2, 6 | pltval 18297 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 8 | 5, 7 | mp3an1 1450 | . . 3 ⊢ ((𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 9 | 8 | 3adant1 1130 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 10 | df-pss 3942 | . . 3 ⊢ (𝑋 ⊊ 𝑌 ↔ (𝑋 ⊆ 𝑌 ∧ 𝑋 ≠ 𝑌)) | |
| 11 | 10 | a1i 11 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 ⊊ 𝑌 ↔ (𝑋 ⊆ 𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 12 | 4, 9, 11 | 3bitr4d 311 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ 𝑋 ⊊ 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2927 Vcvv 3455 ⊆ wss 3922 ⊊ wpss 3923 class class class wbr 5115 ‘cfv 6519 lecple 17233 ltcplt 18275 toInccipo 18492 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5259 ax-nul 5269 ax-pow 5328 ax-pr 5395 ax-un 7718 ax-cnex 11142 ax-resscn 11143 ax-1cn 11144 ax-icn 11145 ax-addcl 11146 ax-addrcl 11147 ax-mulcl 11148 ax-mulrcl 11149 ax-mulcom 11150 ax-addass 11151 ax-mulass 11152 ax-distr 11153 ax-i2m1 11154 ax-1ne0 11155 ax-1rid 11156 ax-rnegex 11157 ax-rrecex 11158 ax-cnre 11159 ax-pre-lttri 11160 ax-pre-lttrn 11161 ax-pre-ltadd 11162 ax-pre-mulgt0 11163 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2880 df-ne 2928 df-nel 3032 df-ral 3047 df-rex 3056 df-reu 3358 df-rab 3412 df-v 3457 df-sbc 3762 df-csb 3871 df-dif 3925 df-un 3927 df-in 3929 df-ss 3939 df-pss 3942 df-nul 4305 df-if 4497 df-pw 4573 df-sn 4598 df-pr 4600 df-op 4604 df-uni 4880 df-iun 4965 df-br 5116 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5541 df-eprel 5546 df-po 5554 df-so 5555 df-fr 5599 df-we 5601 df-xp 5652 df-rel 5653 df-cnv 5654 df-co 5655 df-dm 5656 df-rn 5657 df-res 5658 df-ima 5659 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6472 df-fun 6521 df-fn 6522 df-f 6523 df-f1 6524 df-fo 6525 df-f1o 6526 df-fv 6527 df-riota 7351 df-ov 7397 df-oprab 7398 df-mpo 7399 df-om 7851 df-1st 7977 df-2nd 7978 df-frecs 8269 df-wrecs 8300 df-recs 8349 df-rdg 8387 df-1o 8443 df-er 8682 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-pnf 11228 df-mnf 11229 df-xr 11230 df-ltxr 11231 df-le 11232 df-sub 11425 df-neg 11426 df-nn 12198 df-2 12260 df-3 12261 df-4 12262 df-5 12263 df-6 12264 df-7 12265 df-8 12266 df-9 12267 df-n0 12459 df-z 12546 df-dec 12666 df-uz 12810 df-fz 13482 df-struct 17123 df-slot 17158 df-ndx 17170 df-base 17186 df-tset 17245 df-ple 17246 df-ocomp 17247 df-plt 18295 df-ipo 18493 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |