| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prsref | Structured version Visualization version GIF version | ||
| Description: "Less than or equal to" is reflexive in a proset. (Contributed by Stefan O'Rear, 1-Feb-2015.) |
| Ref | Expression |
|---|---|
| isprs.b | ⊢ 𝐵 = (Base‘𝐾) |
| isprs.l | ⊢ ≤ = (le‘𝐾) |
| Ref | Expression |
|---|---|
| prsref | ⊢ ((𝐾 ∈ Proset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
| 2 | 1, 1, 1 | 3jca 1140 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
| 3 | isprs.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 4 | isprs.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 5 | 3, 4 | prslem 18319 | . . 3 ⊢ ((𝐾 ∈ Proset ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑋) → 𝑋 ≤ 𝑋))) |
| 6 | 2, 5 | sylan2 602 | . 2 ⊢ ((𝐾 ∈ Proset ∧ 𝑋 ∈ 𝐵) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑋) → 𝑋 ≤ 𝑋))) |
| 7 | 6 | simpld 498 | 1 ⊢ ((𝐾 ∈ Proset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 class class class wbr 5097 ‘cfv 6515 Basecbs 17235 lecple 17283 Proset cproset 18314 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-nul 5253 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-iota 6471 df-fv 6523 df-proset 18316 |
| This theorem is referenced by: posref 18340 mgccole1 33128 mgccole2 33129 prsdm 34171 prsrn 34172 prsthinc 50045 |
| Copyright terms: Public domain | W3C validator |