const ordinal : set prop const PNoLt : set (set prop) set (set prop) prop term PNo_strict_lowerbd = \P:set (set prop) prop.\x:set.\p:set prop.!y:set.ordinal y -> !q:set prop.P y q -> PNoLt x p y q term PNo_strict_upperbd = \P:set (set prop) prop.\x:set.\p:set prop.!y:set.ordinal y -> !q:set prop.P y q -> PNoLt y q x p term PNo_strict_imv = \P:set (set prop) prop.\Q:set (set prop) prop.\x:set.\p:set prop.PNo_strict_upperbd P x p & PNo_strict_lowerbd Q x p const In : set set prop term iIn = In infix iIn 2000 2000 const PNoLe : set (set prop) set (set prop) prop term PNo_downc = \P:set (set prop) prop.\x:set.\p:set prop.?y:set.ordinal y & ?q:set prop.P y q & PNoLe x p y q term PNo_rel_strict_upperbd = \P:set (set prop) prop.\x:set.\p:set prop.!y:set.y iIn x -> !q:set prop.PNo_downc P y q -> PNoLt y q x p const PNoEq_ : set (set prop) (set prop) prop term PNoLt_ = \x:set.\p:set prop.\q:set prop.?y:set.y iIn x & (PNoEq_ y p q & ~ p y & q y) term Subq = \x:set.\y:set.!z:set.z iIn x -> z iIn y term PNo_upc = \P:set (set prop) prop.\x:set.\p:set prop.?y:set.ordinal y & ?q:set prop.P y q & PNoLe y q x p term PNo_rel_strict_lowerbd = \P:set (set prop) prop.\x:set.\p:set prop.!y:set.y iIn x -> !q:set prop.PNo_upc P y q -> PNoLt x p y q term PNo_rel_strict_imv = \P:set (set prop) prop.\Q:set (set prop) prop.\x:set.\p:set prop.PNo_rel_strict_upperbd P x p & PNo_rel_strict_lowerbd Q x p term PNo_rel_strict_upperbd = \P:set (set prop) prop.\x:set.\p:set prop.!y:set.y iIn x -> !q:set prop.PNo_downc P y q -> PNoLt y q x p term PNo_rel_strict_imv = \P:set (set prop) prop.\Q:set (set prop) prop.\x:set.\p:set prop.PNo_rel_strict_upperbd P x p & PNo_rel_strict_lowerbd Q x p const ordsucc : set set term PNo_rel_strict_split_imv = \P:set (set prop) prop.\Q:set (set prop) prop.\x:set.\p:set prop.PNo_rel_strict_imv P Q (ordsucc x) (\y:set.p y & y != x) & PNo_rel_strict_imv P Q (ordsucc x) \y:set.p y | y = x axiom PNo_extend1_eq: !x:set.!p:set prop.PNoEq_ x p \y:set.p y | y = x axiom PNoEq_antimon_: !p:set prop.!q:set prop.!x:set.ordinal x -> !y:set.y iIn x -> PNoEq_ x p q -> PNoEq_ y p q axiom ordsuccE: !x:set.!y:set.y iIn ordsucc x -> y iIn x | y = x axiom PNoEq_tra_: !x:set.!p:set prop.!q:set prop.!p2:set prop.PNoEq_ x p q -> PNoEq_ x q p2 -> PNoEq_ x p p2 axiom PNoLtI2: !x:set.!y:set.!p:set prop.!q:set prop.x iIn y -> PNoEq_ x p q -> q x -> PNoLt x p y q lemma !x:set.!p:set prop.!q:set prop.!y:set.ordinal x -> ordinal (ordsucc x) -> y iIn ordsucc x -> PNoEq_ y q p -> p y | y = x -> ordinal y -> PNoLt (ordsucc x) (\z:set.p z | z = x) y q -> ~ PNoLt y q (ordsucc x) \z:set.p z | z = x var P:set (set prop) prop var x:set var p:set prop var q:set prop var y:set hyp ordinal x hyp ordinal (ordsucc x) hyp PNo_rel_strict_lowerbd P (ordsucc x) \z:set.p z | z = x hyp y iIn ordsucc x hyp PNoEq_ y q p hyp p y | y = x hyp ordinal y hyp PNo_upc P y q claim ~ PNoLt (ordsucc x) (\z:set.p z | z = x) y q