P. 453 of Theorem List - Metamath Proof Explorer

Type

Label

Description

Statement

Theorem

ee23an 45201

e23an 45200 without virtual deductions. (Contributed by Alan Sare, 14-Jul-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝜑 → (𝜓 → 𝜒))    &   ⊢ (𝜑 → (𝜓 → (𝜃 → 𝜏)))    &   ⊢ ((𝜒 ∧ 𝜏) → 𝜂)    ⇒   ⊢ (𝜑 → (𝜓 → (𝜃 → 𝜂)))

Theorem

e32 45202

A virtual deduction elimination rule. (Contributed by Alan Sare, 12-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   𝜑   ,   𝜓   ,   𝜒   ▶   𝜃   )    &   ⊢ (   𝜑   ,   𝜓   ▶   𝜏   )    &   ⊢ (𝜃 → (𝜏 → 𝜂))    ⇒   ⊢ (   𝜑   ,   𝜓   ,   𝜒   ▶   𝜂   )

Theorem

ee32 45203

e32 45202 without virtual deductions. (Contributed by Alan Sare, 18-Jul-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝜑 → (𝜓 → (𝜒 → 𝜃)))    &   ⊢ (𝜑 → (𝜓 → 𝜏))    &   ⊢ (𝜃 → (𝜏 → 𝜂))    ⇒   ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜂)))

Theorem

e32an 45204

A virtual deduction elimination rule. (Contributed by Alan Sare, 24-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   𝜑   ,   𝜓   ,   𝜒   ▶   𝜃   )    &   ⊢ (   𝜑   ,   𝜓   ▶   𝜏   )    &   ⊢ ((𝜃 ∧ 𝜏) → 𝜂)    ⇒   ⊢ (   𝜑   ,   𝜓   ,   𝜒   ▶   𝜂   )

Theorem

ee32an 45205

e33an 45179 without virtual deductions. (Contributed by Alan Sare, 14-Jul-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝜑 → (𝜓 → (𝜒 → 𝜃)))    &   ⊢ (𝜑 → (𝜓 → 𝜏))    &   ⊢ ((𝜃 ∧ 𝜏) → 𝜂)    ⇒   ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜂)))

Theorem

e123 45206

A virtual deduction elimination rule. (Contributed by Alan Sare, 12-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   𝜑   ▶   𝜓   )    &   ⊢ (   𝜑   ,   𝜒   ▶   𝜃   )    &   ⊢ (   𝜑   ,   𝜒   ,   𝜏   ▶   𝜂   )    &   ⊢ (𝜓 → (𝜃 → (𝜂 → 𝜁)))    ⇒   ⊢ (   𝜑   ,   𝜒   ,   𝜏   ▶   𝜁   )

Theorem

ee123 45207

e123 45206 without virtual deductions. (Contributed by Alan Sare, 25-Jul-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝜑 → 𝜓)    &   ⊢ (𝜑 → (𝜒 → 𝜃))    &   ⊢ (𝜑 → (𝜒 → (𝜏 → 𝜂)))    &   ⊢ (𝜓 → (𝜃 → (𝜂 → 𝜁)))    ⇒   ⊢ (𝜑 → (𝜒 → (𝜏 → 𝜁)))

Theorem

el123 45208

A virtual deduction elimination rule. (Contributed by Alan Sare, 13-Jun-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   𝜑   ▶   𝜓   )    &   ⊢ (   𝜒   ▶   𝜃   )    &   ⊢ (   𝜏   ▶   𝜂   )    &   ⊢ ((𝜓 ∧ 𝜃 ∧ 𝜂) → 𝜁)    ⇒   ⊢ (   (   𝜑   ,   𝜒   ,   𝜏   )   ▶   𝜁   )

Theorem

e233 45209

A virtual deduction elimination rule. (Contributed by Alan Sare, 29-Feb-2012.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   𝜑   ,   𝜓   ▶   𝜒   )    &   ⊢ (   𝜑   ,   𝜓   ,   𝜃   ▶   𝜏   )    &   ⊢ (   𝜑   ,   𝜓   ,   𝜃   ▶   𝜂   )    &   ⊢ (𝜒 → (𝜏 → (𝜂 → 𝜁)))    ⇒   ⊢ (   𝜑   ,   𝜓   ,   𝜃   ▶   𝜁   )

Theorem

e323 45210

A virtual deduction elimination rule. (Contributed by Alan Sare, 17-Apr-2012.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   𝜑   ,   𝜓   ,   𝜒   ▶   𝜃   )    &   ⊢ (   𝜑   ,   𝜓   ▶   𝜏   )    &   ⊢ (   𝜑   ,   𝜓   ,   𝜒   ▶   𝜂   )    &   ⊢ (𝜃 → (𝜏 → (𝜂 → 𝜁)))    ⇒   ⊢ (   𝜑   ,   𝜓   ,   𝜒   ▶   𝜁   )

Theorem

e000 45211

A virtual deduction elimination rule. The non-virtual deduction form of e000 45211 is the virtual deduction form. (Contributed by Alan Sare, 14-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ 𝜓    &   ⊢ 𝜒    &   ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜃)))    ⇒   ⊢ 𝜃

Theorem

e00 45212

Elimination rule identical to mp2 9. The non-virtual deduction form is the virtual deduction form, which is mp2 9. (Contributed by Alan Sare, 14-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ 𝜓    &   ⊢ (𝜑 → (𝜓 → 𝜒))    ⇒   ⊢ 𝜒

Theorem

e00an 45213

Elimination rule identical to mp2an 693. The non-virtual deduction form is the virtual deduction form, which is mp2an 693. (Contributed by Alan Sare, 15-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ 𝜓    &   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ 𝜒

Theorem

eel00cT 45214

An elimination deduction. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ 𝜓    &   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ (⊤ → 𝜒)

Theorem

eelTT 45215

An elimination deduction. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (⊤ → 𝜑)    &   ⊢ (⊤ → 𝜓)    &   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ 𝜒

Theorem

e0a 45216

Elimination rule identical to ax-mp 5. The non-virtual deduction form is the virtual deduction form, which is ax-mp 5. (Contributed by Alan Sare, 14-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ (𝜑 → 𝜓)    ⇒   ⊢ 𝜓

Theorem

eelT 45217

An elimination deduction. (Contributed by Alan Sare, 5-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (⊤ → 𝜑)    &   ⊢ (𝜑 → 𝜓)    ⇒   ⊢ 𝜓

Theorem

eel0cT 45218

An elimination deduction. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ (𝜑 → 𝜓)    ⇒   ⊢ (⊤ → 𝜓)

Theorem

eelT0 45219

An elimination deduction. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (⊤ → 𝜑)    &   ⊢ 𝜓    &   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ 𝜒

Theorem

e0bi 45220

Elimination rule identical to mpbi 230. The non-virtual deduction form is the virtual deduction form, which is mpbi 230. (Contributed by Alan Sare, 15-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ (𝜑 ↔ 𝜓)    ⇒   ⊢ 𝜓

Theorem

e0bir 45221

Elimination rule identical to mpbir 231. The non-virtual deduction form is the virtual deduction form, which is mpbir 231. (Contributed by Alan Sare, 15-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝜑    &   ⊢ (𝜓 ↔ 𝜑)    ⇒   ⊢ 𝜓

Theorem

uun0.1 45222

Convention notation form of un0.1 45223. (Contributed by Alan Sare, 23-Apr-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (⊤ → 𝜑)    &   ⊢ (𝜓 → 𝜒)    &   ⊢ ((⊤ ∧ 𝜓) → 𝜃)    ⇒   ⊢ (𝜓 → 𝜃)

Theorem

un0.1 45223

⊤ is the constant true, a tautology (see df-tru 1545). Kleene's "empty conjunction" is logically equivalent to ⊤. In a virtual deduction we shall interpret ⊤ to be the empty wff or the empty collection of virtual hypotheses. ⊤ in a virtual deduction translated into conventional notation we shall interpret to be Kleene's empty conjunction. If 𝜃 is true given the empty collection of virtual hypotheses and another collection of virtual hypotheses, then it is true given only the other collection of virtual hypotheses. (Contributed by Alan Sare, 23-Apr-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   ⊤   ▶   𝜑   )    &   ⊢ (   𝜓   ▶   𝜒   )    &   ⊢ (   (   ⊤   ,   𝜓   )   ▶   𝜃   )    ⇒   ⊢ (   𝜓   ▶   𝜃   )

Theorem

uunT1 45224

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 3-Dec-2015.) Proof was revised to accommodate a possible future version of df-tru 1545. (Revised by David A. Wheeler, 8-May-2019.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((⊤ ∧ 𝜑) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunT1p1 45225

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ ⊤) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunT21 45226

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 3-Dec-2015.) (Proof modification is discouraged.) (New usage is discouraged.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((⊤ ∧ (𝜑 ∧ 𝜓)) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uun121 45227

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ (𝜑 ∧ 𝜓)) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uun121p1 45228

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜑 ∧ 𝜓) ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uun132 45229

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ (𝜓 ∧ 𝜒)) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uun132p1 45230

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜓 ∧ 𝜒) ∧ 𝜑) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

anabss7p1 45231

A deduction unionizing a non-unionized collection of virtual hypotheses. This would have been named uun221 if the zeroth permutation did not exist in set.mm as anabss7 674. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜓 ∧ 𝜑) ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜓 ∧ 𝜑) → 𝜒)

Theorem

un10 45232

A unionizing deduction. (Contributed by Alan Sare, 28-Apr-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   (   𝜑   ,   ⊤   )   ▶   𝜓   )    ⇒   ⊢ (   𝜑   ▶   𝜓   )

Theorem

un01 45233

A unionizing deduction. (Contributed by Alan Sare, 28-Apr-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (   (   ⊤   ,   𝜑   )   ▶   𝜓   )    ⇒   ⊢ (   𝜑   ▶   𝜓   )

Theorem

un2122 45234

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 3-Dec-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜑 ∧ 𝜓) ∧ 𝜓 ∧ 𝜓) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uun2131 45235

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜑 ∧ 𝜓) ∧ (𝜑 ∧ 𝜒)) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uun2131p1 45236

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜑 ∧ 𝜒) ∧ (𝜑 ∧ 𝜓)) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uunTT1 45237

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((⊤ ∧ ⊤ ∧ 𝜑) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunTT1p1 45238

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((⊤ ∧ 𝜑 ∧ ⊤) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunTT1p2 45239

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ ⊤ ∧ ⊤) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunT11 45240

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((⊤ ∧ 𝜑 ∧ 𝜑) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunT11p1 45241

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ ⊤ ∧ 𝜑) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunT11p2 45242

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ 𝜑 ∧ ⊤) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

uunT12 45243

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((⊤ ∧ 𝜑 ∧ 𝜓) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uunT12p1 45244

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((⊤ ∧ 𝜓 ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uunT12p2 45245

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ ⊤ ∧ 𝜓) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uunT12p3 45246

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜓 ∧ ⊤ ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uunT12p4 45247

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ 𝜓 ∧ ⊤) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uunT12p5 45248

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜓 ∧ 𝜑 ∧ ⊤) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uun111 45249

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ 𝜑 ∧ 𝜑) → 𝜓)    ⇒   ⊢ (𝜑 → 𝜓)

Theorem

3anidm12p1 45250

A deduction unionizing a non-unionized collection of virtual hypotheses. 3anidm12 1422 denotes the deduction which would have been named uun112 if it did not pre-exist in set.mm. This second permutation's name is based on this pre-existing name. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ 𝜓 ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

3anidm12p2 45251

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜓 ∧ 𝜑 ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → 𝜒)

Theorem

uun123 45252

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ 𝜒 ∧ 𝜓) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uun123p1 45253

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜓 ∧ 𝜑 ∧ 𝜒) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uun123p2 45254

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜒 ∧ 𝜑 ∧ 𝜓) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uun123p3 45255

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜓 ∧ 𝜒 ∧ 𝜑) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uun123p4 45256

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜒 ∧ 𝜓 ∧ 𝜑) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Theorem

uun2221 45257

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 30-Dec-2016.) (Proof modification is discouraged.) (New usage is discouraged.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ 𝜑 ∧ (𝜓 ∧ 𝜑)) → 𝜒)    ⇒   ⊢ ((𝜓 ∧ 𝜑) → 𝜒)

Theorem

uun2221p1 45258

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ (𝜓 ∧ 𝜑) ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜓 ∧ 𝜑) → 𝜒)

Theorem

uun2221p2 45259

A deduction unionizing a non-unionized collection of virtual hypotheses. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜓 ∧ 𝜑) ∧ 𝜑 ∧ 𝜑) → 𝜒)    ⇒   ⊢ ((𝜓 ∧ 𝜑) → 𝜒)

Theorem

3impdirp1 45260

A deduction unionizing a non-unionized collection of virtual hypotheses. Commuted version of 3impdir 1353. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜒 ∧ 𝜓) ∧ (𝜑 ∧ 𝜓)) → 𝜃)    ⇒   ⊢ ((𝜑 ∧ 𝜒 ∧ 𝜓) → 𝜃)

Theorem

3impcombi 45261

A 1-hypothesis propositional calculus deduction. (Contributed by Alan Sare, 25-Sep-2017.)

⊢ ((𝜑 ∧ 𝜓 ∧ 𝜑) → (𝜒 ↔ 𝜃))    ⇒   ⊢ ((𝜓 ∧ 𝜑 ∧ 𝜒) → 𝜃)

21.41.6  Theorems proved using Virtual Deduction

Theorem

trsspwALT 45262

Virtual deduction proof of the left-to-right implication of dftr4 5199. A transitive class is a subset of its power class. This proof corresponds to the virtual deduction proof of dftr4 5199 without accumulating results. (Contributed by Alan Sare, 29-Apr-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → 𝐴 ⊆ 𝒫 𝐴)

Theorem

trsspwALT2 45263

Virtual deduction proof of trsspwALT 45262. This proof is the same as the proof of trsspwALT 45262 except each virtual deduction symbol is replaced by its non-virtual deduction symbol equivalent. A transitive class is a subset of its power class. (Contributed by Alan Sare, 23-Jul-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → 𝐴 ⊆ 𝒫 𝐴)

Theorem

trsspwALT3 45264

Short predicate calculus proof of the left-to-right implication of dftr4 5199. A transitive class is a subset of its power class. This proof was constructed by applying Metamath's minimize command to the proof of trsspwALT2 45263, which is the virtual deduction proof trsspwALT 45262 without virtual deductions. (Contributed by Alan Sare, 30-Apr-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → 𝐴 ⊆ 𝒫 𝐴)

Theorem

sspwtr 45265

Virtual deduction proof of the right-to-left implication of dftr4 5199. A class which is a subclass of its power class is transitive. This proof corresponds to the virtual deduction proof of sspwtr 45265 without accumulating results. (Contributed by Alan Sare, 2-May-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ⊆ 𝒫 𝐴 → Tr 𝐴)

Theorem

sspwtrALT 45266

Virtual deduction proof of sspwtr 45265. This proof is the same as the proof of sspwtr 45265 except each virtual deduction symbol is replaced by its non-virtual deduction symbol equivalent. A class which is a subclass of its power class is transitive. (Contributed by Alan Sare, 3-May-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ⊆ 𝒫 𝐴 → Tr 𝐴)

Theorem

sspwtrALT2 45267

Short predicate calculus proof of the right-to-left implication of dftr4 5199. A class which is a subclass of its power class is transitive. This proof was constructed by applying Metamath's minimize command to the proof of sspwtrALT 45266, which is the virtual deduction proof sspwtr 45265 without virtual deductions. (Contributed by Alan Sare, 3-May-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ⊆ 𝒫 𝐴 → Tr 𝐴)

Theorem

pwtrVD 45268

Virtual deduction proof of pwtr 5399; see pwtrrVD 45269 for the converse. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → Tr 𝒫 𝐴)

Theorem

pwtrrVD 45269

Virtual deduction proof of pwtr 5399; see pwtrVD 45268 for the converse. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝐴 ∈ V    ⇒   ⊢ (Tr 𝒫 𝐴 → Tr 𝐴)

Theorem

suctrALT 45270

The successor of a transitive class is transitive. The proof of https://us.metamath.org/other/completeusersproof/suctrvd.html is a Virtual Deduction proof verified by automatically transforming it into the Metamath proof of suctrALT 45270 using completeusersproof, which is verified by the Metamath program. The proof of https://us.metamath.org/other/completeusersproof/suctrro.html 45270 is a form of the completed proof which preserves the Virtual Deduction proof's step numbers and their ordering. See suctr 6405 for the original proof. (Contributed by Alan Sare, 11-Apr-2009.) (Revised by Alan Sare, 12-Jun-2018.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → Tr suc 𝐴)

Theorem

snssiALTVD 45271

Virtual deduction proof of snssiALT 45272. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)

Theorem

snssiALT 45272

If a class is an element of another class, then its singleton is a subclass of that other class. Alternate proof of snssi 4752. This theorem was automatically generated from snssiALTVD 45271 using a translation program. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)

Theorem

snsslVD 45273

Virtual deduction proof of snssl 45274. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝐴 ∈ V    ⇒   ⊢ ({𝐴} ⊆ 𝐵 → 𝐴 ∈ 𝐵)

Theorem

snssl 45274

If a singleton is a subclass of another class, then the singleton's element is an element of that other class. This theorem is the right-to-left implication of the biconditional snss 4729. The proof of this theorem was automatically generated from snsslVD 45273 using a tools command file, translateMWO.cmd, by translating the proof into its non-virtual deduction form and minimizing it. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝐴 ∈ V    ⇒   ⊢ ({𝐴} ⊆ 𝐵 → 𝐴 ∈ 𝐵)

Theorem

snelpwrVD 45275

Virtual deduction proof of snelpwi 5391. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → {𝐴} ∈ 𝒫 𝐵)

Theorem

unipwrVD 45276

Virtual deduction proof of unipwr 45277. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝐴 ⊆ ∪ 𝒫 𝐴

Theorem

unipwr 45277

A class is a subclass of the union of its power class. This theorem is the right-to-left subclass lemma of unipw 5397. The proof of this theorem was automatically generated from unipwrVD 45276 using a tools command file , translateMWO.cmd , by translating the proof into its non-virtual deduction form and minimizing it. (Contributed by Alan Sare, 25-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ 𝐴 ⊆ ∪ 𝒫 𝐴

Theorem

sstrALT2VD 45278

Virtual deduction proof of sstrALT2 45279. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶)

Theorem

sstrALT2 45279

Virtual deduction proof of sstr 3931, transitivity of subclasses, Theorem 6 of [Suppes] p. 23. This theorem was automatically generated from sstrALT2VD 45278 using the command file translate_without_overwriting.cmd . It was not minimized because the automated minimization excluding duplicates generates a minimized proof which, although not directly containing any duplicates, indirectly contains a duplicate. That is, the trace back of the minimized proof contains a duplicate. This is undesirable because some step(s) of the minimized proof use the proven theorem. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶)

Theorem

suctrALT2VD 45280

Virtual deduction proof of suctrALT2 45281. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → Tr suc 𝐴)

Theorem

suctrALT2 45281

Virtual deduction proof of suctr 6405. The successor of a transitive class is transitive. This proof was generated automatically from the virtual deduction proof suctrALT2VD 45280 using the tools command file translate_without_overwriting_minimize_excluding_duplicates.cmd . (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → Tr suc 𝐴)

Theorem

elex2VD 45282*

Virtual deduction proof of elex2 2814. (Contributed by Alan Sare, 25-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵)

Theorem

elex22VD 45283*

Virtual deduction proof of elex22 3455. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))

Theorem

eqsbc2VD 45284*

Virtual deduction proof of eqsbc2 3793. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥]𝐶 = 𝑥 ↔ 𝐶 = 𝐴))

Theorem

zfregs2VD 45285*

Virtual deduction proof of zfregs2 9645. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ≠ ∅ → ¬ ∀𝑥 ∈ 𝐴 ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥))

Theorem

tpid3gVD 45286

Virtual deduction proof of tpid3g 4717. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐶, 𝐷, 𝐴})

Theorem

en3lplem1VD 45287*

Virtual deduction proof of en3lplem1 9524. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 = 𝐴 → ∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥)))

Theorem

en3lplem2VD 45288*

Virtual deduction proof of en3lplem2 9525. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥)))

Theorem

en3lpVD 45289

Virtual deduction proof of en3lp 9526. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)

21.41.7  Theorems proved using Virtual Deduction with mmj2 assistance

Theorem

simplbi2VD 45290

Virtual deduction proof of simplbi2 500. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

h1::	⊢ (𝜑 ↔ (𝜓 ∧ 𝜒))
3:1,?: e0a 45216	⊢ ((𝜓 ∧ 𝜒) → 𝜑)
qed:3,?: e0a 45216	⊢ (𝜓 → (𝜒 → 𝜑))

The proof of simplbi2 500 was automatically derived from it. (Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝜑 ↔ (𝜓 ∧ 𝜒))    ⇒   ⊢ (𝜓 → (𝜒 → 𝜑))

Theorem

3ornot23VD 45291

Virtual deduction proof of 3ornot23 44954. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   (¬ 𝜑 ∧ ¬ 𝜓)   )
2::	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ,   (𝜒 ∨ 𝜑 ∨ 𝜓)   ▶   (𝜒 ∨ 𝜑 ∨ 𝜓)   )
3:1,?: e1a 45072	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ¬ 𝜑   )
4:1,?: e1a 45072	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ¬ 𝜓   )
5:3,4,?: e11 45133	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ¬ (𝜑 ∨ 𝜓)   )
6:2,?: e2 45076	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ,   (𝜒 ∨ 𝜑 ∨ 𝜓)   ▶   (𝜒 ∨ (𝜑 ∨ 𝜓))   )
7:5,6,?: e12 45168	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ,   (𝜒 ∨ 𝜑 ∨ 𝜓)   ▶   𝜒   )
8:7:	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ((𝜒 ∨ 𝜑 ∨ 𝜓) → 𝜒)   )
qed:8:	⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ((𝜒 ∨ 𝜑 ∨ 𝜓) → 𝜒))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ((𝜒 ∨ 𝜑 ∨ 𝜓) → 𝜒))

Theorem

orbi1rVD 45292

Virtual deduction proof of orbi1r 44955. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   (𝜑 ↔ 𝜓)   ▶   (𝜑 ↔ 𝜓)   )
2::	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜑)    ▶   (𝜒 ∨ 𝜑)   )
3:2,?: e2 45076	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜑)    ▶   (𝜑 ∨ 𝜒)   )
4:1,3,?: e12 45168	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜑)    ▶   (𝜓 ∨ 𝜒)   )
5:4,?: e2 45076	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜑)    ▶   (𝜒 ∨ 𝜓)   )
6:5:	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜒 ∨ 𝜑) → (𝜒 ∨ 𝜓))   )
7::	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜒 ∨ 𝜓)   )
8:7,?: e2 45076	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜓 ∨ 𝜒)   )
9:1,8,?: e12 45168	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜑 ∨ 𝜒)   )
10:9,?: e2 45076	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜒 ∨ 𝜑)   )
11:10:	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜒 ∨ 𝜓) → (𝜒 ∨ 𝜑))   )
12:6,11,?: e11 45133	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜒 ∨ 𝜑) ↔ (𝜒 ∨ 𝜓))   )
qed:12:	⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ∨ 𝜑) ↔ (𝜒 ∨ 𝜓)))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ∨ 𝜑) ↔ (𝜒 ∨ 𝜓)))

Theorem

bitr3VD 45293

Virtual deduction proof of bitr3 352. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   (𝜑 ↔ 𝜓)   ▶   (𝜑 ↔ 𝜓)   )
2:1,?: e1a 45072	⊢ (   (𝜑 ↔ 𝜓)   ▶   (𝜓 ↔ 𝜑)   )
3::	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜑 ↔ 𝜒)    ▶   (𝜑 ↔ 𝜒)   )
4:3,?: e2 45076	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜑 ↔ 𝜒)    ▶   (𝜒 ↔ 𝜑)   )
5:2,4,?: e12 45168	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜑 ↔ 𝜒)    ▶   (𝜓 ↔ 𝜒)   )
6:5:	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜑 ↔ 𝜒) → (𝜓 ↔ 𝜒))   )
qed:6:	⊢ ((𝜑 ↔ 𝜓) → ((𝜑 ↔ 𝜒) → (𝜓 ↔ 𝜒)))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ↔ 𝜓) → ((𝜑 ↔ 𝜒) → (𝜓 ↔ 𝜒)))

Theorem

3orbi123VD 45294

Virtual deduction proof of 3orbi123 44956. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   )
2:1,?: e1a 45072	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (𝜑 ↔ 𝜓)   )
3:1,?: e1a 45072	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (𝜒 ↔ 𝜃)   )
4:1,?: e1a 45072	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (𝜏 ↔ 𝜂)   )
5:2,3,?: e11 45133	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   ((𝜑 ∨ 𝜒) ↔ (𝜓 ∨ 𝜃))   )
6:5,4,?: e11 45133	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (((𝜑 ∨ 𝜒) ∨ 𝜏) ↔ ((𝜓 ∨ 𝜃) ∨ 𝜂))   )
7:?:	⊢ (((𝜑 ∨ 𝜒) ∨ 𝜏) ↔ (𝜑 ∨ 𝜒 ∨ 𝜏))
8:6,7,?: e10 45139	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ ((𝜓 ∨ 𝜃) ∨ 𝜂))   )
9:?:	⊢ (((𝜓 ∨ 𝜃) ∨ 𝜂) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂))
10:8,9,?: e10 45139	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂))   )
qed:10:	⊢ (((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂)) → ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂)))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂)) → ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂)))

Theorem

sbc3orgVD 45295

Virtual deduction proof of the analogue of sbcor 3780 with three disjuncts. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   𝐴 ∈ 𝐵   ▶   𝐴 ∈ 𝐵   )
2:1,?: e1a 45072	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥]((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ ([𝐴 / 𝑥](𝜑 ∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
3::	⊢ (((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒))
32:3:	⊢ ∀𝑥(((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒))
33:1,32,?: e10 45139	⊢ (   𝐴 ∈ 𝐵   ▶   [𝐴 / 𝑥](((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒))   )
4:1,33,?: e11 45133	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥]((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ [𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒))   )
5:2,4,?: e11 45133	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥](𝜑 ∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
6:1,?: e1a 45072	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓))   )
7:6,?: e1a 45072	⊢ (   𝐴 ∈ 𝐵   ▶   (([𝐴 / 𝑥](𝜑 ∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒) ↔ (([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
8:5,7,?: e11 45133	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
9:?:	⊢ ((([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓) ∨ [𝐴 / 𝑥]𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒))
10:8,9,?: e10 45139	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒))   )
qed:10:	⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒)))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒)))

Theorem

19.21a3con13vVD 45296*

Virtual deduction proof of alrim3con13v 44978. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   (𝜑 → ∀𝑥𝜑)    ▶   (𝜑 → ∀𝑥𝜑)   )
2::	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   (𝜓 ∧ 𝜑 ∧ 𝜒)   )
3:2,?: e2 45076	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   𝜓   )
4:2,?: e2 45076	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   𝜑   )
5:2,?: e2 45076	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   𝜒   )
6:1,4,?: e12 45168	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥𝜑   )
7:3,?: e2 45076	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥𝜓   )
8:5,?: e2 45076	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥𝜒   )
9:7,6,8,?: e222 45081	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   (∀𝑥𝜓 ∧ ∀𝑥𝜑 ∧ ∀𝑥𝜒)   )
10:9,?: e2 45076	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒)   )
11:10:in2	⊢ (   (𝜑 → ∀𝑥𝜑)   ▶   ((𝜓 ∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒))   )
qed:11:in1	⊢ ((𝜑 → ∀𝑥𝜑) → ((𝜓 ∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒)))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 → ∀𝑥𝜑) → ((𝜓 ∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒)))

Theorem

exbirVD 45297

Virtual deduction proof of exbir 44924. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))    ▶   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   )
2::	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,    (𝜑 ∧ 𝜓)   ▶   (𝜑 ∧ 𝜓)   )
3::	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ,    (𝜑 ∧ 𝜓), 𝜃   ▶   𝜃   )
5:1,2,?: e12 45168	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓)   ▶   (𝜒 ↔ 𝜃)   )
6:3,5,?: e32 45202	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓), 𝜃   ▶   𝜒   )
7:6:	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓)   ▶   (𝜃 → 𝜒)   )
8:7:	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))    ▶   ((𝜑 ∧ 𝜓) → (𝜃 → 𝜒))   )
9:8,?: e1a 45072	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ▶   (𝜑 → (𝜓 → (𝜃 → 𝜒)))   )
qed:9:	⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → (𝜑 → (𝜓 → (𝜃 → 𝜒))))

(Contributed by Alan Sare, 13-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → (𝜑 → (𝜓 → (𝜃 → 𝜒))))

Theorem

exbiriVD 45298

Virtual deduction proof of exbiri 811. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

h1::	⊢ ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))
2::	⊢ (   𝜑   ▶   𝜑   )
3::	⊢ (   𝜑   ,   𝜓   ▶   𝜓   )
4::	⊢ (   𝜑   ,   𝜓   ,   𝜃   ▶   𝜃   )
5:2,1,?: e10 45139	⊢ (   𝜑   ▶   (𝜓 → (𝜒 ↔ 𝜃))   )
6:3,5,?: e21 45174	⊢ (   𝜑   ,   𝜓   ▶   (𝜒 ↔ 𝜃)   )
7:4,6,?: e32 45202	⊢ (   𝜑   ,   𝜓   ,   𝜃   ▶   𝜒   )
8:7:	⊢ (   𝜑   ,   𝜓   ▶   (𝜃 → 𝜒)   )
9:8:	⊢ (   𝜑   ▶   (𝜓 → (𝜃 → 𝜒))   )
qed:9:	⊢ (𝜑 → (𝜓 → (𝜃 → 𝜒)))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))    ⇒   ⊢ (𝜑 → (𝜓 → (𝜃 → 𝜒)))

Theorem

rspsbc2VD 45299*

Virtual deduction proof of rspsbc2 44979. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   𝐴 ∈ 𝐵   ▶   𝐴 ∈ 𝐵   )
2::	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ▶   𝐶 ∈ 𝐷   )
3::	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ,   ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑   ▶   ∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑   )
4:1,3,?: e13 45192	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ,   ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑   ▶   [𝐴 / 𝑥]∀𝑦 ∈ 𝐷𝜑   )
5:1,4,?: e13 45192	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ,   ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑   ▶   ∀𝑦 ∈ 𝐷[𝐴 / 𝑥]𝜑   )
6:2,5,?: e23 45199	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ,   ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑   ▶   [𝐶 / 𝑦][𝐴 / 𝑥]𝜑   )
7:6:	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ▶   (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑)   )
8:7:	⊢ (   𝐴 ∈ 𝐵   ▶   (𝐶 ∈ 𝐷 → (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑))   )
qed:8:	⊢ (𝐴 ∈ 𝐵 → (𝐶 ∈ 𝐷 → (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑)))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ∈ 𝐵 → (𝐶 ∈ 𝐷 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷 𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑)))

Theorem

3impexpVD 45300

Virtual deduction proof of 3impexp 1360. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   ▶   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   )
2::	⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜓) ∧ 𝜒))
3:1,2,?: e10 45139	⊢ (   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   ▶   (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃)   )
4:3,?: e1a 45072	⊢ (   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   ▶   ((𝜑 ∧ 𝜓) → (𝜒 → 𝜃))   )
5:4,?: e1a 45072	⊢ (   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   ▶   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   )
6:5:	⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃) → (𝜑 → (𝜓 → (𝜒 → 𝜃))))
7::	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   )
8:7,?: e1a 45072	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   ((𝜑 ∧ 𝜓) → (𝜒 → 𝜃))   )
9:8,?: e1a 45072	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃)   )
10:2,9,?: e01 45136	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   )
11:10:	⊢ ((𝜑 → (𝜓 → (𝜒 → 𝜃))) → ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃))
qed:6,11,?: e00 45212	⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃) ↔ (𝜑 → (𝜓 → (𝜒 → 𝜃))))

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃) ↔ (𝜑 → (𝜓 → (𝜒 → 𝜃))))