| 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 1129 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
| 3 | isprs.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 4 | isprs.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 5 | 3, 4 | prslem 18232 | . . 3 ⊢ ((𝐾 ∈ Proset ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑋) → 𝑋 ≤ 𝑋))) |
| 6 | 2, 5 | sylan2 594 | . 2 ⊢ ((𝐾 ∈ Proset ∧ 𝑋 ∈ 𝐵) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑋) → 𝑋 ≤ 𝑋))) |
| 7 | 6 | simpld 494 | 1 ⊢ ((𝐾 ∈ Proset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 ‘cfv 6500 Basecbs 17148 lecple 17196 Proset cproset 18227 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-nul 5253 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-proset 18229 |
| This theorem is referenced by: posref 18253 mgccole1 33082 mgccole2 33083 prsdm 34091 prsrn 34092 prsthinc 49817 |
| Copyright terms: Public domain | W3C validator |