![]() |
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 1127 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
3 | isprs.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
4 | isprs.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
5 | 3, 4 | prslem 18355 | . . 3 ⊢ ((𝐾 ∈ Proset ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑋) → 𝑋 ≤ 𝑋))) |
6 | 2, 5 | sylan2 593 | . 2 ⊢ ((𝐾 ∈ Proset ∧ 𝑋 ∈ 𝐵) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑋 ∧ 𝑋 ≤ 𝑋) → 𝑋 ≤ 𝑋))) |
7 | 6 | simpld 494 | 1 ⊢ ((𝐾 ∈ Proset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 class class class wbr 5148 ‘cfv 6563 Basecbs 17245 lecple 17305 Proset cproset 18350 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-nul 5312 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-iota 6516 df-fv 6571 df-proset 18352 |
This theorem is referenced by: posref 18376 mgccole1 32965 mgccole2 32966 prsdm 33875 prsrn 33876 prsthinc 48855 |
Copyright terms: Public domain | W3C validator |