Nuprl Lemma : bpa-equiv-equiv

`∀[p:{2...}]. EquivRel(basic-padic(p);x,y.bpa-equiv(p;x;y))`

Proof

Definitions occuring in Statement :  bpa-equiv: `bpa-equiv(p;x;y)` basic-padic: `basic-padic(p)` equiv_rel: `EquivRel(T;x,y.E[x; y])` int_upper: `{i...}` uall: `∀[x:A]. B[x]` natural_number: `\$n`
Definitions unfolded in proof :  uall: `∀[x:A]. B[x]` member: `t ∈ T` crng: `CRng` rng: `Rng` p-adic-ring: `ℤ(p)` ring_p: `IsRing(T;plus;zero;neg;times;one)` rng_car: `|r|` pi1: `fst(t)` rng_plus: `+r` pi2: `snd(t)` rng_zero: `0` rng_minus: `-r` rng_times: `*` rng_one: `1` monoid_p: `IsMonoid(T;op;id)` group_p: `IsGroup(T;op;id;inv)` bilinear: `BiLinear(T;pl;tm)` ident: `Ident(T;op;id)` assoc: `Assoc(T;op)` inverse: `Inverse(T;op;id;inv)` infix_ap: `x f y` comm: `Comm(T;op)` and: `P ∧ Q` equiv_rel: `EquivRel(T;x,y.E[x; y])` refl: `Refl(T;x,y.E[x; y])` all: `∀x:A. B[x]` basic-padic: `basic-padic(p)` bpa-equiv: `bpa-equiv(p;x;y)` nat_plus: `ℕ+` int_upper: `{i...}` nat: `ℕ` le: `A ≤ B` decidable: `Dec(P)` or: `P ∨ Q` iff: `P `⇐⇒` Q` not: `¬A` rev_implies: `P `` Q` implies: `P `` Q` false: `False` prop: `ℙ` uiff: `uiff(P;Q)` uimplies: `b supposing a` subtype_rel: `A ⊆r B` top: `Top` less_than': `less_than'(a;b)` true: `True` cand: `A c∧ B` sym: `Sym(T;x,y.E[x; y])` trans: `Trans(T;x,y.E[x; y])` squash: `↓T` guard: `{T}` ge: `i ≥ j ` satisfiable_int_formula: `satisfiable_int_formula(fmla)` exists: `∃x:A. B[x]` p-adics: `p-adics(p)` so_lambda: `λ2x.t[x]` subtract: `n - m` int_seg: `{i..j-}` so_apply: `x[s]`
Rules used in proof :  cut introduction extract_by_obid sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation hypothesis sqequalHypSubstitution isectElimination thin hypothesisEquality equalityTransitivity equalitySymmetry applyLambdaEquality setElimination rename sqequalRule productElimination independent_pairFormation lambdaFormation dependent_set_memberEquality dependent_functionElimination natural_numberEquality unionElimination voidElimination independent_functionElimination independent_isectElimination applyEquality lambdaEquality isect_memberEquality voidEquality intEquality because_Cache imageElimination imageMemberEquality baseClosed equalityUniverse levelHypothesis addEquality approximateComputation dependent_pairFormation int_eqEquality minusEquality universeEquality instantiate

Latex: