 Home Intuitionistic Logic ExplorerTheorem List (p. 100 of 101) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 9901-10000   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremcbvrald 9901* Rule used to change bound variables, using implicit substitution. (Contributed by BJ, 22-Nov-2019.)
𝑥𝜑    &   𝑦𝜑    &   (𝜑 → Ⅎ𝑦𝜓)    &   (𝜑 → Ⅎ𝑥𝜒)    &   (𝜑 → (𝑥 = 𝑦 → (𝜓𝜒)))       (𝜑 → (∀𝑥𝐴 𝜓 ↔ ∀𝑦𝐴 𝜒))

Theorembj-intabssel 9902 Version of intss1 3630 using a class abstraction and explicit substitution. (Contributed by BJ, 29-Nov-2019.)
𝑥𝐴       (𝐴𝑉 → ([𝐴 / 𝑥]𝜑 {𝑥𝜑} ⊆ 𝐴))

Theorembj-intabssel1 9903 Version of intss1 3630 using a class abstraction and implicit substitution. Closed form of intmin3 3642. (Contributed by BJ, 29-Nov-2019.)
𝑥𝐴    &   𝑥𝜓    &   (𝑥 = 𝐴 → (𝜓𝜑))       (𝐴𝑉 → (𝜓 {𝑥𝜑} ⊆ 𝐴))

Theorembj-elssuniab 9904 Version of elssuni 3608 using a class abstraction and explicit substitution. (Contributed by BJ, 29-Nov-2019.)
𝑥𝐴       (𝐴𝑉 → ([𝐴 / 𝑥]𝜑𝐴 {𝑥𝜑}))

Theorembj-sseq 9905 If two converse inclusions are characterized each by a formula, then equality is characterized by the conjunction of these formulas. (Contributed by BJ, 30-Nov-2019.)
(𝜑 → (𝜓𝐴𝐵))    &   (𝜑 → (𝜒𝐵𝐴))       (𝜑 → ((𝜓𝜒) ↔ 𝐴 = 𝐵))

6.3.4  Bounded formulas

This is an ongoing project to define bounded formulas, following a discussion on GitHub between Jim Kingdon, Mario Carneiro and I, started 23-Sept-2019 (see https://github.com/metamath/set.mm/issues/1173 and links therein).

In order to state certain axiom schemes of Constructive Zermelo–Fraenkel (CZF) set theory, like the axiom scheme of bounded (or restricted, or Δ0) separation, it is necessary to distinguish certain formulas, called bounded (or restricted, or Δ0) formulas. The necessity of considering bounded formulas also arises in several theories of bounded arithmetic, both classical or intuitonistic, for instance to state the axiom scheme of Δ0-induction.

To formalize this in Metamath, there are several choices to make.

A first choice is to either create a new type for bounded formulas, or to create a predicate on formulas that indicates whether they are bounded. In the first case, one creates a new type "wff0" with a new set of metavariables (ph0 ...) and an axiom "\$a wff ph0 " ensuring that bounded formulas are formulas, so that one can reuse existing theorems, and then axioms take the form "\$a wff0 ( ph0 -> ps0 )", etc. In the second case, one introduces a predicate "BOUNDED " with the intended meaning that "BOUNDED 𝜑 " is a formula meaning that 𝜑 is a bounded formula. We choose the second option, since the first would complicate the grammar, risking to make it ambiguous. (TODO: elaborate.)

A second choice is to view "bounded" either as a syntactic or a semantic property. For instance, 𝑥 is not syntactically bounded since it has an unbounded universal quantifier, but it is semantically bounded since it is equivalent to which is bounded. We choose the second option, so that formulas using defined symbols can be proved bounded.

A third choice is in the form of the axioms, either in closed form or in inference form. One cannot state all the axioms in closed form, especially ax-bd0 9907. Indeed, if we posited it in closed form, then we could prove for instance (𝜑BOUNDED 𝜑) and 𝜑BOUNDED 𝜑) which is problematic (with the law of excluded middle, this would entail that all formulas are bounded, but even without it, too many formulas could be proved bounded...). (TODO: elaborate.)

Having ax-bd0 9907 in inference form ensures that a formula can be proved bounded only if it is equivalent *for all values of the free variables* to a syntactically bounded one. The other axioms (ax-bdim 9908 through ax-bdsb 9916) can be written either in closed or inference form. The fact that ax-bd0 9907 is an inference is enough to ensure that the closed forms cannot be "exploited" to prove that some unbounded formulas are bounded. (TODO: check.) However, we state all the axioms in inference form to make it clear that we do not exploit any over-permissiveness.

Finally, note that our logic has no terms, only variables. Therefore, we cannot prove for instance that 𝑥 ∈ ω is a bounded formula. However, since ω can be defined as "the 𝑦 such that PHI" a proof using the fact that 𝑥 ∈ ω is bounded can be converted to a proof in iset.mm by replacing ω with 𝑦 everywhere and prepending the antecedent PHI, since 𝑥𝑦 is bounded by ax-bdel 9915. For a similar method, see bj-omtrans 10055.

Note that one cannot add an axiom BOUNDED 𝑥𝐴 since by bdph 9944 it would imply that every formula is bounded.

For CZF, a useful set of notes is

Peter Aczel and Michael Rathjen, CST Book draft. (available at http://www1.maths.leeds.ac.uk/~rathjen/book.pdf)

and an interesting article is

Michael Shulman, Comparing material and structural set theories, Annals of Pure and Applied Logic, Volume 170, Issue 4 (Apr. 2019), 465--504. (available at https://arxiv.org/abs/1808.05204)

Syntaxwbd 9906 Syntax for the predicate BOUNDED.
wff BOUNDED 𝜑

Axiomax-bd0 9907 If two formulas are equivalent, then boundedness of one implies boundedness of the other. (Contributed by BJ, 3-Oct-2019.)
(𝜑𝜓)       (BOUNDED 𝜑BOUNDED 𝜓)

Axiomax-bdim 9908 An implication between two bounded formulas is bounded. (Contributed by BJ, 25-Sep-2019.)
BOUNDED 𝜑    &   BOUNDED 𝜓       BOUNDED (𝜑𝜓)

Axiomax-bdan 9909 The conjunction of two bounded formulas is bounded. (Contributed by BJ, 25-Sep-2019.)
BOUNDED 𝜑    &   BOUNDED 𝜓       BOUNDED (𝜑𝜓)

Axiomax-bdor 9910 The disjunction of two bounded formulas is bounded. (Contributed by BJ, 25-Sep-2019.)
BOUNDED 𝜑    &   BOUNDED 𝜓       BOUNDED (𝜑𝜓)

Axiomax-bdn 9911 The negation of a bounded formula is bounded. (Contributed by BJ, 25-Sep-2019.)
BOUNDED 𝜑       BOUNDED ¬ 𝜑

Axiomax-bdal 9912* A bounded universal quantification of a bounded formula is bounded. Note the DV condition on 𝑥, 𝑦. (Contributed by BJ, 25-Sep-2019.)
BOUNDED 𝜑       BOUNDED𝑥𝑦 𝜑

Axiomax-bdex 9913* A bounded existential quantification of a bounded formula is bounded. Note the DV condition on 𝑥, 𝑦. (Contributed by BJ, 25-Sep-2019.)
BOUNDED 𝜑       BOUNDED𝑥𝑦 𝜑

Axiomax-bdeq 9914 An atomic formula is bounded (equality predicate). (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝑥 = 𝑦

Axiomax-bdel 9915 An atomic formula is bounded (membership predicate). (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝑥𝑦

Axiomax-bdsb 9916 A formula resulting from proper substitution in a bounded formula is bounded. This probably cannot be proved from the other axioms, since neither the definiens in df-sb 1646, nor probably any other equivalent formula, is syntactically bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑       BOUNDED [𝑦 / 𝑥]𝜑

Theorembdeq 9917 Equality property for the predicate BOUNDED. (Contributed by BJ, 3-Oct-2019.)
(𝜑𝜓)       (BOUNDED 𝜑BOUNDED 𝜓)

Theorembd0 9918 A formula equivalent to a bounded one is bounded. See also bd0r 9919. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑    &   (𝜑𝜓)       BOUNDED 𝜓

Theorembd0r 9919 A formula equivalent to a bounded one is bounded. Stated with a commuted (compared with bd0 9918) biconditional in the hypothesis, to work better with definitions (𝜓 is the definiendum that one wants to prove bounded). (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑    &   (𝜓𝜑)       BOUNDED 𝜓

Theorembdbi 9920 A biconditional between two bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑    &   BOUNDED 𝜓       BOUNDED (𝜑𝜓)

Theorembdstab 9921 Stability of a bounded formula is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑       BOUNDED STAB 𝜑

Theorembddc 9922 Decidability of a bounded formula is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑       BOUNDED DECID 𝜑

Theorembd3or 9923 A disjunction of three bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑    &   BOUNDED 𝜓    &   BOUNDED 𝜒       BOUNDED (𝜑𝜓𝜒)

Theorembd3an 9924 A conjunction of three bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑    &   BOUNDED 𝜓    &   BOUNDED 𝜒       BOUNDED (𝜑𝜓𝜒)

Theorembdth 9925 A truth (a (closed) theorem) is a bounded formula. (Contributed by BJ, 6-Oct-2019.)
𝜑       BOUNDED 𝜑

Theorembdtru 9926 The truth value is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED

Theorembdfal 9927 The truth value is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED

Theorembdnth 9928 A falsity is a bounded formula. (Contributed by BJ, 6-Oct-2019.)
¬ 𝜑       BOUNDED 𝜑

TheorembdnthALT 9929 Alternate proof of bdnth 9928 not using bdfal 9927. Then, bdfal 9927 can be proved from this theorem, using fal 1250. The total number of proof steps would be 17 (for bdnthALT 9929) + 3 = 20, which is more than 8 (for bdfal 9927) + 9 (for bdnth 9928) = 17. (Contributed by BJ, 6-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
¬ 𝜑       BOUNDED 𝜑

Theorembdxor 9930 The exclusive disjunction of two bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑    &   BOUNDED 𝜓       BOUNDED (𝜑𝜓)

Theorembj-bdcel 9931* Boundedness of a membership formula. (Contributed by BJ, 8-Dec-2019.)
BOUNDED 𝑦 = 𝐴       BOUNDED 𝐴𝑥

Theorembdab 9932 Membership in a class defined by class abstraction using a bounded formula, is a bounded formula. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝜑       BOUNDED 𝑥 ∈ {𝑦𝜑}

Theorembdcdeq 9933 Conditional equality of a bounded formula is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝜑       BOUNDED CondEq(𝑥 = 𝑦𝜑)

6.3.5  Bounded classes

In line with our definitions of classes as extensions of predicates, it is useful to define a predicate for bounded classes, which is done in df-bdc 9935. Note that this notion is only a technical device which can be used to shorten proofs of (semantic) boundedness of formulas.

As will be clear by the end of this subsection (see for instance bdop 9969), one can prove the boundedness of any concrete term using only setvars and bounded formulas, for instance, BOUNDED 𝜑 BOUNDED ⟨{𝑥𝜑}, ({𝑦, suc 𝑧} × ⟨𝑡, ∅⟩)⟩. The proofs are long since one has to prove boundedness at each step of the construction, without being able to prove general theorems like BOUNDED 𝐴BOUNDED {𝐴}.

Syntaxwbdc 9934 Syntax for the predicate BOUNDED.
wff BOUNDED 𝐴

Definitiondf-bdc 9935* Define a bounded class as one such that membership in this class is a bounded formula. (Contributed by BJ, 3-Oct-2019.)
(BOUNDED 𝐴 ↔ ∀𝑥BOUNDED 𝑥𝐴)

Theorembdceq 9936 Equality property for the predicate BOUNDED. (Contributed by BJ, 3-Oct-2019.)
𝐴 = 𝐵       (BOUNDED 𝐴BOUNDED 𝐵)

Theorembdceqi 9937 A class equal to a bounded one is bounded. Note the use of ax-ext 2022. See also bdceqir 9938. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴    &   𝐴 = 𝐵       BOUNDED 𝐵

Theorembdceqir 9938 A class equal to a bounded one is bounded. Stated with a commuted (compared with bdceqi 9937) equality in the hypothesis, to work better with definitions (𝐵 is the definiendum that one wants to prove bounded; see comment of bd0r 9919). (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴    &   𝐵 = 𝐴       BOUNDED 𝐵

Theorembdel 9939* The belonging of a setvar in a bounded class is a bounded formula. (Contributed by BJ, 3-Oct-2019.)
(BOUNDED 𝐴BOUNDED 𝑥𝐴)

Theorembdeli 9940* Inference associated with bdel 9939. Its converse is bdelir 9941. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴       BOUNDED 𝑥𝐴

Theorembdelir 9941* Inference associated with df-bdc 9935. Its converse is bdeli 9940. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝑥𝐴       BOUNDED 𝐴

Theorembdcv 9942 A setvar is a bounded class. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝑥

Theorembdcab 9943 A class defined by class abstraction using a bounded formula is bounded. (Contributed by BJ, 6-Oct-2019.)
BOUNDED 𝜑       BOUNDED {𝑥𝜑}

Theorembdph 9944 A formula which defines (by class abstraction) a bounded class is bounded. (Contributed by BJ, 6-Oct-2019.)
BOUNDED {𝑥𝜑}       BOUNDED 𝜑

Theorembds 9945* Boundedness of a formula resulting from implicit substitution in a bounded formula. Note that the proof does not use ax-bdsb 9916; therefore, using implicit instead of explicit substitution when boundedness is important, one might avoid using ax-bdsb 9916. (Contributed by BJ, 19-Nov-2019.)
BOUNDED 𝜑    &   (𝑥 = 𝑦 → (𝜑𝜓))       BOUNDED 𝜓

Theorembdcrab 9946* A class defined by restricted abstraction from a bounded class and a bounded formula is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴    &   BOUNDED 𝜑       BOUNDED {𝑥𝐴𝜑}

Theorembdne 9947 Inequality of two setvars is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝑥𝑦

Theorembdnel 9948* Non-membership of a setvar in a bounded formula is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝐴       BOUNDED 𝑥𝐴

Theorembdreu 9949* Boundedness of existential uniqueness.

Remark regarding restricted quantifiers: the formula 𝑥𝐴𝜑 need not be bounded even if 𝐴 and 𝜑 are. Indeed, V is bounded by bdcvv 9951, and (∀𝑥 ∈ V𝜑 ↔ ∀𝑥𝜑) (in minimal propositional calculus), so by bd0 9918, if 𝑥 ∈ V𝜑 were bounded when 𝜑 is bounded, then 𝑥𝜑 would be bounded as well when 𝜑 is bounded, which is not the case. The same remark holds with ∃, ∃!, ∃*. (Contributed by BJ, 16-Oct-2019.)

BOUNDED 𝜑       BOUNDED ∃!𝑥𝑦 𝜑

Theorembdrmo 9950* Boundedness of existential at-most-one. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝜑       BOUNDED ∃*𝑥𝑦 𝜑

Theorembdcvv 9951 The universal class is bounded. The formulation may sound strange, but recall that here, "bounded" means "Δ0". (Contributed by BJ, 3-Oct-2019.)
BOUNDED V

Theorembdsbc 9952 A formula resulting from proper substitution of a setvar for a setvar in a bounded formula is bounded. See also bdsbcALT 9953. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝜑       BOUNDED [𝑦 / 𝑥]𝜑

TheorembdsbcALT 9953 Alternate proof of bdsbc 9952. (Contributed by BJ, 16-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
BOUNDED 𝜑       BOUNDED [𝑦 / 𝑥]𝜑

Theorembdccsb 9954 A class resulting from proper substitution of a setvar for a setvar in a bounded class is bounded. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝐴       BOUNDED 𝑦 / 𝑥𝐴

Theorembdcdif 9955 The difference of two bounded classes is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴    &   BOUNDED 𝐵       BOUNDED (𝐴𝐵)

Theorembdcun 9956 The union of two bounded classes is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴    &   BOUNDED 𝐵       BOUNDED (𝐴𝐵)

Theorembdcin 9957 The intersection of two bounded classes is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴    &   BOUNDED 𝐵       BOUNDED (𝐴𝐵)

Theorembdss 9958 The inclusion of a setvar in a bounded class is a bounded formula. Note: apparently, we cannot prove from the present axioms that equality of two bounded classes is a bounded formula. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴       BOUNDED 𝑥𝐴

Theorembdcnul 9959 The empty class is bounded. See also bdcnulALT 9960. (Contributed by BJ, 3-Oct-2019.)
BOUNDED

TheorembdcnulALT 9960 Alternate proof of bdcnul 9959. Similarly, for the next few theorems proving boundedness of a class, one can either use their definition followed by bdceqir 9938, or use the corresponding characterizations of its elements followed by bdelir 9941. (Contributed by BJ, 3-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
BOUNDED

Theorembdeq0 9961 Boundedness of the formula expressing that a setvar is equal to the empty class. (Contributed by BJ, 21-Nov-2019.)
BOUNDED 𝑥 = ∅

Theorembj-bd0el 9962 Boundedness of the formula "the empty set belongs to the setvar 𝑥". (Contributed by BJ, 30-Nov-2019.)
BOUNDED ∅ ∈ 𝑥

Theorembdcpw 9963 The power class of a bounded class is bounded. (Contributed by BJ, 3-Oct-2019.)
BOUNDED 𝐴       BOUNDED 𝒫 𝐴

Theorembdcsn 9964 The singleton of a setvar is bounded. (Contributed by BJ, 16-Oct-2019.)
BOUNDED {𝑥}

Theorembdcpr 9965 The pair of two setvars is bounded. (Contributed by BJ, 16-Oct-2019.)
BOUNDED {𝑥, 𝑦}

Theorembdctp 9966 The unordered triple of three setvars is bounded. (Contributed by BJ, 16-Oct-2019.)
BOUNDED {𝑥, 𝑦, 𝑧}

Theorembdsnss 9967* Inclusion of a singleton of a setvar in a bounded class is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝐴       BOUNDED {𝑥} ⊆ 𝐴

Theorembdvsn 9968* Equality of a setvar with a singleton of a setvar is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝑥 = {𝑦}

Theorembdop 9969 The ordered pair of two setvars is a bounded class. (Contributed by BJ, 21-Nov-2019.)
BOUNDED𝑥, 𝑦

Theorembdcuni 9970 The union of a setvar is a bounded class. (Contributed by BJ, 15-Oct-2019.)
BOUNDED 𝑥

Theorembdcint 9971 The intersection of a setvar is a bounded class. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝑥

Theorembdciun 9972* The indexed union of a bounded class with a setvar indexing set is a bounded class. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝐴       BOUNDED 𝑥𝑦 𝐴

Theorembdciin 9973* The indexed intersection of a bounded class with a setvar indexing set is a bounded class. (Contributed by BJ, 16-Oct-2019.)
BOUNDED 𝐴       BOUNDED 𝑥𝑦 𝐴

Theorembdcsuc 9974 The successor of a setvar is a bounded class. (Contributed by BJ, 16-Oct-2019.)
BOUNDED suc 𝑥

Theorembdeqsuc 9975* Boundedness of the formula expressing that a setvar is equal to the successor of another. (Contributed by BJ, 21-Nov-2019.)
BOUNDED 𝑥 = suc 𝑦

Theorembj-bdsucel 9976 Boundedness of the formula "the successor of the setvar 𝑥 belongs to the setvar 𝑦". (Contributed by BJ, 30-Nov-2019.)
BOUNDED suc 𝑥𝑦

Theorembdcriota 9977* A class given by a restricted definition binder is bounded, under the given hypotheses. (Contributed by BJ, 24-Nov-2019.)
BOUNDED 𝜑    &   ∃!𝑥𝑦 𝜑       BOUNDED (𝑥𝑦 𝜑)

6.3.6  Bounded separation

In this section, we state the axiom scheme of bounded separation, which is part of CZF set theory.

Axiomax-bdsep 9978* Axiom scheme of bounded (or restricted, or Δ0) separation. It is stated with all possible disjoint variable conditions, to show that this weak form is sufficient. For the full axiom of separation, see ax-sep 3875. (Contributed by BJ, 5-Oct-2019.)
BOUNDED 𝜑       𝑎𝑏𝑥(𝑥𝑏 ↔ (𝑥𝑎𝜑))

Theorembdsep1 9979* Version of ax-bdsep 9978 without initial universal quantifier. (Contributed by BJ, 5-Oct-2019.)
BOUNDED 𝜑       𝑏𝑥(𝑥𝑏 ↔ (𝑥𝑎𝜑))

Theorembdsep2 9980* Version of ax-bdsep 9978 with one DV condition removed and without initial universal quantifier. Use bdsep1 9979 when sufficient. (Contributed by BJ, 5-Oct-2019.)
BOUNDED 𝜑       𝑏𝑥(𝑥𝑏 ↔ (𝑥𝑎𝜑))

Theorembdsepnft 9981* Closed form of bdsepnf 9982. Version of ax-bdsep 9978 with one DV condition removed, the other DV condition replaced by a non-freeness antecedent, and without initial universal quantifier. Use bdsep1 9979 when sufficient. (Contributed by BJ, 19-Oct-2019.)
BOUNDED 𝜑       (∀𝑥𝑏𝜑 → ∃𝑏𝑥(𝑥𝑏 ↔ (𝑥𝑎𝜑)))

Theorembdsepnf 9982* Version of ax-bdsep 9978 with one DV condition removed, the other DV condition replaced by a non-freeness hypothesis, and without initial universal quantifier. See also bdsepnfALT 9983. Use bdsep1 9979 when sufficient. (Contributed by BJ, 5-Oct-2019.)
𝑏𝜑    &   BOUNDED 𝜑       𝑏𝑥(𝑥𝑏 ↔ (𝑥𝑎𝜑))

TheorembdsepnfALT 9983* Alternate proof of bdsepnf 9982, not using bdsepnft 9981. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
𝑏𝜑    &   BOUNDED 𝜑       𝑏𝑥(𝑥𝑏 ↔ (𝑥𝑎𝜑))

Theorembdzfauscl 9984* Closed form of the version of zfauscl 3877 for bounded formulas using bounded separation. (Contributed by BJ, 13-Nov-2019.)
BOUNDED 𝜑       (𝐴𝑉 → ∃𝑦𝑥(𝑥𝑦 ↔ (𝑥𝐴𝜑)))

Theorembdbm1.3ii 9985* Bounded version of bm1.3ii 3878. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
BOUNDED 𝜑    &   𝑥𝑦(𝜑𝑦𝑥)       𝑥𝑦(𝑦𝑥𝜑)

Theorembj-axemptylem 9986* Lemma for bj-axempty 9987 and bj-axempty2 9988. (Contributed by BJ, 25-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 3883 instead. (New usage is discouraged.)
𝑥𝑦(𝑦𝑥 → ⊥)

Theorembj-axempty 9987* Axiom of the empty set from bounded separation. It is provable from bounded separation since the intuitionistic FOL used in iset.mm assumes a non-empty universe. See axnul 3882. (Contributed by BJ, 25-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 3883 instead. (New usage is discouraged.)
𝑥𝑦𝑥

Theorembj-axempty2 9988* Axiom of the empty set from bounded separation, alternate version to bj-axempty 9987. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 3883 instead. (New usage is discouraged.)
𝑥𝑦 ¬ 𝑦𝑥

Theorembj-nalset 9989* nalset 3887 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
¬ ∃𝑥𝑦 𝑦𝑥

Theorembj-vprc 9990 vprc 3888 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
¬ V ∈ V

Theorembj-nvel 9991 nvel 3889 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
¬ V ∈ 𝐴

Theorembj-vnex 9992 vnex 3890 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
¬ ∃𝑥 𝑥 = V

Theorembdinex1 9993 Bounded version of inex1 3891. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
BOUNDED 𝐵    &   𝐴 ∈ V       (𝐴𝐵) ∈ V

Theorembdinex2 9994 Bounded version of inex2 3892. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
BOUNDED 𝐵    &   𝐴 ∈ V       (𝐵𝐴) ∈ V

Theorembdinex1g 9995 Bounded version of inex1g 3893. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
BOUNDED 𝐵       (𝐴𝑉 → (𝐴𝐵) ∈ V)

Theorembdssex 9996 Bounded version of ssex 3894. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
BOUNDED 𝐴    &   𝐵 ∈ V       (𝐴𝐵𝐴 ∈ V)

Theorembdssexi 9997 Bounded version of ssexi 3895. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
BOUNDED 𝐴    &   𝐵 ∈ V    &   𝐴𝐵       𝐴 ∈ V

Theorembdssexg 9998 Bounded version of ssexg 3896. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
BOUNDED 𝐴       ((𝐴𝐵𝐵𝐶) → 𝐴 ∈ V)

Theorembdssexd 9999 Bounded version of ssexd 3897. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
(𝜑𝐵𝐶)    &   (𝜑𝐴𝐵)    &   BOUNDED 𝐴       (𝜑𝐴 ∈ V)

Theorembdrabexg 10000* Bounded version of rabexg 3900. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
BOUNDED 𝜑    &   BOUNDED 𝐴       (𝐴𝑉 → {𝑥𝐴𝜑} ∈ V)

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10097
 Copyright terms: Public domain < Previous  Next >