Nuprl Lemma : rec-combined-class-1_wf

[Info,A,B:Type]. ∀[F:bag(A) ⟶ bag(B) ⟶ bag(B)]. ∀[X:EClass(A)].  (F|X,Prior(self)| ∈ EClass(B))


Proof




Definitions occuring in Statement :  rec-combined-class-1: F|X,Prior(self)| eclass: EClass(A[eo; e]) uall: [x:A]. B[x] member: t ∈ T function: x:A ⟶ B[x] universe: Type bag: bag(T)
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T rec-combined-class-1: F|X,Prior(self)| nat: le: A ≤ B and: P ∧ Q less_than': less_than'(a;b) false: False not: ¬A implies:  Q prop: so_lambda: λ2y.t[x; y] subtype_rel: A ⊆B so_apply: x[s1;s2] int_seg: {i..j-} uimplies: supposing a guard: {T} lelt: i ≤ j < k all: x:A. B[x] decidable: Dec(P) or: P ∨ Q satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] top: Top less_than: a < b squash: T true: True

Latex:
\mforall{}[Info,A,B:Type].  \mforall{}[F:bag(A)  {}\mrightarrow{}  bag(B)  {}\mrightarrow{}  bag(B)].  \mforall{}[X:EClass(A)].    (F|X,Prior(self)|  \mmember{}  EClass(B))



Date html generated: 2016_05_17-AM-00_06_23
Last ObjectModification: 2016_01_17-PM-06_55_12

Theory : event-ordering


Home Index