Metamath Proof Explorer


Theorem probinc

Description: A probability law is increasing with regard to event set inclusion. (Contributed by Thierry Arnoux, 10-Feb-2017)

Ref Expression
Assertion probinc ⊢ P ∈ Prob ∧ A ∈ dom ⁡ P ∧ B ∈ dom ⁡ P ∧ A ⊆ B → P ⁡ A ≤ P ⁡ B

Proof

Step Hyp Ref Expression
1 simpl1 ⊢ P ∈ Prob ∧ A ∈ dom ⁡ P ∧ B ∈ dom ⁡ P ∧ A ⊆ B → P ∈ Prob
2 domprobmeas ⊢ P ∈ Prob → P ∈ measures ⁡ dom ⁡ P
3 1 2 syl ⊢ P ∈ Prob ∧ A ∈ dom ⁡ P ∧ B ∈ dom ⁡ P ∧ A ⊆ B → P ∈ measures ⁡ dom ⁡ P
4 simpl2 ⊢ P ∈ Prob ∧ A ∈ dom ⁡ P ∧ B ∈ dom ⁡ P ∧ A ⊆ B → A ∈ dom ⁡ P
5 simpl3 ⊢ P ∈ Prob ∧ A ∈ dom ⁡ P ∧ B ∈ dom ⁡ P ∧ A ⊆ B → B ∈ dom ⁡ P
6 simpr ⊢ P ∈ Prob ∧ A ∈ dom ⁡ P ∧ B ∈ dom ⁡ P ∧ A ⊆ B → A ⊆ B
7 3 4 5 6 measssd ⊢ P ∈ Prob ∧ A ∈ dom ⁡ P ∧ B ∈ dom ⁡ P ∧ A ⊆ B → P ⁡ A ≤ P ⁡ B