| 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 2734 | . . . 4 ⊢ (le‘𝐼) = (le‘𝐼) | |
| 3 | 1, 2 | ipole 18547 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋(le‘𝐼)𝑌 ↔ 𝑋 ⊆ 𝑌)) |
| 4 | 3 | anbi1d 631 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → ((𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌) ↔ (𝑋 ⊆ 𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 5 | 1 | fvexi 6899 | . . . 4 ⊢ 𝐼 ∈ V |
| 6 | ipolt.l | . . . . 5 ⊢ < = (lt‘𝐼) | |
| 7 | 2, 6 | pltval 18345 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 8 | 5, 7 | mp3an1 1449 | . . 3 ⊢ ((𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 9 | 8 | 3adant1 1130 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐼)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 10 | df-pss 3951 | . . 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 1539 ∈ wcel 2107 ≠ wne 2931 Vcvv 3463 ⊆ wss 3931 ⊊ wpss 3932 class class class wbr 5123 ‘cfv 6540 lecple 17279 ltcplt 18323 toInccipo 18540 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7736 ax-cnex 11192 ax-resscn 11193 ax-1cn 11194 ax-icn 11195 ax-addcl 11196 ax-addrcl 11197 ax-mulcl 11198 ax-mulrcl 11199 ax-mulcom 11200 ax-addass 11201 ax-mulass 11202 ax-distr 11203 ax-i2m1 11204 ax-1ne0 11205 ax-1rid 11206 ax-rnegex 11207 ax-rrecex 11208 ax-cnre 11209 ax-pre-lttri 11210 ax-pre-lttrn 11211 ax-pre-ltadd 11212 ax-pre-mulgt0 11213 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6493 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7869 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-er 8726 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-pnf 11278 df-mnf 11279 df-xr 11280 df-ltxr 11281 df-le 11282 df-sub 11475 df-neg 11476 df-nn 12248 df-2 12310 df-3 12311 df-4 12312 df-5 12313 df-6 12314 df-7 12315 df-8 12316 df-9 12317 df-n0 12509 df-z 12596 df-dec 12716 df-uz 12860 df-fz 13529 df-struct 17165 df-slot 17200 df-ndx 17212 df-base 17229 df-tset 17291 df-ple 17292 df-ocomp 17293 df-plt 18343 df-ipo 18541 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |