Theorem: ProbabilityTheory.Indep.indepSet_of_measurableSet
File: Mathlib/Probability/Independence/Basic.lean

tactic: refine fun s' t' hs' ht' => h_indep s' t' ?_ ?_
state_before: Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
⊢ IndepSet s t

tactic: refine @generateFrom_induction _ (fun u => MeasurableSet[m₁] u) {s} ?_ ?_ ?_ ?_ _ hs'
state_before: case refine_1
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ s' ∈ {s | MeasurableSet s}

tactic: simp only [Set.mem_singleton_iff, forall_eq, hs]
state_before: case refine_1.refine_1
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ ∀ (t : Set Ω), t ∈ {s} → (fun u => MeasurableSet u) t

tactic: exact @MeasurableSet.empty _ m₁
state_before: case refine_1.refine_2
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ (fun u => MeasurableSet u) ∅

tactic: exact fun u hu => hu.compl
state_before: case refine_1.refine_3
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ ∀ (t : Set Ω), (fun u => MeasurableSet u) t → (fun u => MeasurableSet u) (tᶜ)

tactic: exact fun f hf => MeasurableSet.iUnion hf
state_before: case refine_1.refine_4
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ ∀ (f : ℕ → Set Ω), (∀ (n : ℕ), (fun u => MeasurableSet u) (f n)) → (fun u => MeasurableSet u) (⋃ (i : ℕ), f i)

tactic: refine @generateFrom_induction _ (fun u => MeasurableSet[m₂] u) {t} ?_ ?_ ?_ ?_ _ ht'
state_before: case refine_2
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ t' ∈ {s | MeasurableSet s}

tactic: simp only [Set.mem_singleton_iff, forall_eq, ht]
state_before: case refine_2.refine_1
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ ∀ (t_1 : Set Ω), t_1 ∈ {t} → (fun u => MeasurableSet u) t_1

tactic: exact @MeasurableSet.empty _ m₂
state_before: case refine_2.refine_2
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ (fun u => MeasurableSet u) ∅

tactic: exact fun u hu => hu.compl
state_before: case refine_2.refine_3
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ ∀ (t : Set Ω), (fun u => MeasurableSet u) t → (fun u => MeasurableSet u) (tᶜ)

tactic: exact fun f hf => MeasurableSet.iUnion hf
state_before: case refine_2.refine_4
Ω : Type u_1
ι : Type ?u.2871903
s✝ t✝ : Set Ω
S T : Set (Set Ω)
m₁ m₂ m0 : MeasurableSpace Ω
μ : MeasureTheory.Measure Ω
h_indep : Indep m₁ m₂
s t : Set Ω
hs : MeasurableSet s
ht : MeasurableSet t
s' t' : Set Ω
hs' : s' ∈ {s_1 | MeasurableSet s_1}
ht' : t' ∈ {s | MeasurableSet s}
⊢ ∀ (f : ℕ → Set Ω), (∀ (n : ℕ), (fun u => MeasurableSet u) (f n)) → (fun u => MeasurableSet u) (⋃ (i : ℕ), f i)