P. 452 of Theorem List - Metamath Proof Explorer

Type

Label

Description

Statement

Theorem

ee23an 45101

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

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

Theorem

e32 45102

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

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

Theorem

ee32 45103

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

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

Theorem

e32an 45104

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

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

Theorem

ee32an 45105

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

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

Theorem

e123 45106

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

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

Theorem

ee123 45107

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

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

Theorem

el123 45108

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

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

Theorem

e233 45109

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

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

Theorem

e323 45110

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

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

Theorem

e000 45111

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

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

Theorem

e00 45112

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 45113

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 45114

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

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

Theorem

eelTT 45115

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

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

Theorem

e0a 45116

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 45117

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

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

Theorem

eel0cT 45118

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

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

Theorem

eelT0 45119

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

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

Theorem

e0bi 45120

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 45121

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 45122

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

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

Theorem

un0.1 45123

⊤ 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 45124

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 45125

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 45126

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 45127

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 45128

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 45129

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 45130

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 45131

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 45132

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

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

Theorem

un01 45133

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

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

Theorem

un2122 45134

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 45135

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 45136

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 45137

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 45138

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 45139

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 45140

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 45141

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 45142

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 45143

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 45144

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 45145

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 45146

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 45147

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 45148

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 45149

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 45150

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 45151

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 45152

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 45153

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 45154

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 45155

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 45156

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 45157

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 45158

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 45159

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 45160

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 45161

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

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

21.41.6  Theorems proved using Virtual Deduction

Theorem

trsspwALT 45162

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

⊢ (Tr 𝐴 → 𝐴 ⊆ 𝒫 𝐴)

Theorem

trsspwALT2 45163

Virtual deduction proof of trsspwALT 45162. This proof is the same as the proof of trsspwALT 45162 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 45164

Short predicate calculus proof of the left-to-right implication of dftr4 5213. 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 45163, which is the virtual deduction proof trsspwALT 45162 without virtual deductions. (Contributed by Alan Sare, 30-Apr-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (Tr 𝐴 → 𝐴 ⊆ 𝒫 𝐴)

Theorem

sspwtr 45165

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

⊢ (𝐴 ⊆ 𝒫 𝐴 → Tr 𝐴)

Theorem

sspwtrALT 45166

Virtual deduction proof of sspwtr 45165. This proof is the same as the proof of sspwtr 45165 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 45167

Short predicate calculus proof of the right-to-left implication of dftr4 5213. 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 45166, which is the virtual deduction proof sspwtr 45165 without virtual deductions. (Contributed by Alan Sare, 3-May-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

⊢ (𝐴 ⊆ 𝒫 𝐴 → Tr 𝐴)

Theorem

pwtrVD 45168

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

⊢ (Tr 𝐴 → Tr 𝒫 𝐴)

Theorem

pwtrrVD 45169

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

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

Theorem

suctrALT 45170

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 45170 using completeusersproof, which is verified by the Metamath program. The proof of https://us.metamath.org/other/completeusersproof/suctrro.html 45170 is a form of the completed proof which preserves the Virtual Deduction proof's step numbers and their ordering. See suctr 6413 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 45171

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

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

Theorem

snssiALT 45172

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

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

Theorem

snsslVD 45173

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

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

Theorem

snssl 45174

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 4743. The proof of this theorem was automatically generated from snsslVD 45173 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 45175

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

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

Theorem

unipwrVD 45176

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

⊢ 𝐴 ⊆ ∪ 𝒫 𝐴

Theorem

unipwr 45177

A class is a subclass of the union of its power class. This theorem is the right-to-left subclass lemma of unipw 5405. The proof of this theorem was automatically generated from unipwrVD 45176 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 45178

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

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

Theorem

sstrALT2 45179

Virtual deduction proof of sstr 3944, transitivity of subclasses, Theorem 6 of [Suppes] p. 23. This theorem was automatically generated from sstrALT2VD 45178 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 45180

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

⊢ (Tr 𝐴 → Tr suc 𝐴)

Theorem

suctrALT2 45181

Virtual deduction proof of suctr 6413. The successor of a transitive class is transitive. This proof was generated automatically from the virtual deduction proof suctrALT2VD 45180 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 45182*

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

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

Theorem

elex22VD 45183*

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

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

Theorem

eqsbc2VD 45184*

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

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

Theorem

zfregs2VD 45185*

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

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

Theorem

tpid3gVD 45186

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

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

Theorem

en3lplem1VD 45187*

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

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

Theorem

en3lplem2VD 45188*

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

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

Theorem

en3lpVD 45189

Virtual deduction proof of en3lp 9535. (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 45190

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 45116	⊢ ((𝜓 ∧ 𝜒) → 𝜑)
qed:3,?: e0a 45116	⊢ (𝜓 → (𝜒 → 𝜑))

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 45191

Virtual deduction proof of 3ornot23 44854. 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 44972	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ¬ 𝜑   )
4:1,?: e1a 44972	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ¬ 𝜓   )
5:3,4,?: e11 45033	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ¬ (𝜑 ∨ 𝜓)   )
6:2,?: e2 44976	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ,   (𝜒 ∨ 𝜑 ∨ 𝜓)   ▶   (𝜒 ∨ (𝜑 ∨ 𝜓))   )
7:5,6,?: e12 45068	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ,   (𝜒 ∨ 𝜑 ∨ 𝜓)   ▶   𝜒   )
8:7:	⊢ (   (¬ 𝜑 ∧ ¬ 𝜓)   ▶   ((𝜒 ∨ 𝜑 ∨ 𝜓) → 𝜒)   )
qed:8:	⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ((𝜒 ∨ 𝜑 ∨ 𝜓) → 𝜒))

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

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

Theorem

orbi1rVD 45192

Virtual deduction proof of orbi1r 44855. 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 44976	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜑)    ▶   (𝜑 ∨ 𝜒)   )
4:1,3,?: e12 45068	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜑)    ▶   (𝜓 ∨ 𝜒)   )
5:4,?: e2 44976	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜑)    ▶   (𝜒 ∨ 𝜓)   )
6:5:	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜒 ∨ 𝜑) → (𝜒 ∨ 𝜓))   )
7::	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜒 ∨ 𝜓)   )
8:7,?: e2 44976	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜓 ∨ 𝜒)   )
9:1,8,?: e12 45068	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜑 ∨ 𝜒)   )
10:9,?: e2 44976	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜒 ∨ 𝜓)    ▶   (𝜒 ∨ 𝜑)   )
11:10:	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜒 ∨ 𝜓) → (𝜒 ∨ 𝜑))   )
12:6,11,?: e11 45033	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜒 ∨ 𝜑) ↔ (𝜒 ∨ 𝜓))   )
qed:12:	⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ∨ 𝜑) ↔ (𝜒 ∨ 𝜓)))

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

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

Theorem

bitr3VD 45193

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 44972	⊢ (   (𝜑 ↔ 𝜓)   ▶   (𝜓 ↔ 𝜑)   )
3::	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜑 ↔ 𝜒)    ▶   (𝜑 ↔ 𝜒)   )
4:3,?: e2 44976	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜑 ↔ 𝜒)    ▶   (𝜒 ↔ 𝜑)   )
5:2,4,?: e12 45068	⊢ (   (𝜑 ↔ 𝜓)   ,   (𝜑 ↔ 𝜒)    ▶   (𝜓 ↔ 𝜒)   )
6:5:	⊢ (   (𝜑 ↔ 𝜓)   ▶   ((𝜑 ↔ 𝜒) → (𝜓 ↔ 𝜒))   )
qed:6:	⊢ ((𝜑 ↔ 𝜓) → ((𝜑 ↔ 𝜒) → (𝜓 ↔ 𝜒)))

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

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

Theorem

3orbi123VD 45194

Virtual deduction proof of 3orbi123 44856. 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 44972	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (𝜑 ↔ 𝜓)   )
3:1,?: e1a 44972	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (𝜒 ↔ 𝜃)   )
4:1,?: e1a 44972	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (𝜏 ↔ 𝜂)   )
5:2,3,?: e11 45033	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   ((𝜑 ∨ 𝜒) ↔ (𝜓 ∨ 𝜃))   )
6:5,4,?: e11 45033	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   (((𝜑 ∨ 𝜒) ∨ 𝜏) ↔ ((𝜓 ∨ 𝜃) ∨ 𝜂))   )
7:?:	⊢ (((𝜑 ∨ 𝜒) ∨ 𝜏) ↔ (𝜑 ∨ 𝜒 ∨ 𝜏))
8:6,7,?: e10 45039	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ ((𝜓 ∨ 𝜃) ∨ 𝜂))   )
9:?:	⊢ (((𝜓 ∨ 𝜃) ∨ 𝜂) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂))
10:8,9,?: e10 45039	⊢ (   ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂))   ▶   ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂))   )
qed:10:	⊢ (((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂)) → ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂)))

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

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

Theorem

sbc3orgVD 45195

Virtual deduction proof of the analogue of sbcor 3793 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 44972	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥]((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ ([𝐴 / 𝑥](𝜑 ∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
3::	⊢ (((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒))
32:3:	⊢ ∀𝑥(((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒))
33:1,32,?: e10 45039	⊢ (   𝐴 ∈ 𝐵   ▶   [𝐴 / 𝑥](((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒))   )
4:1,33,?: e11 45033	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥]((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ [𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒))   )
5:2,4,?: e11 45033	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥](𝜑 ∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
6:1,?: e1a 44972	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓))   )
7:6,?: e1a 44972	⊢ (   𝐴 ∈ 𝐵   ▶   (([𝐴 / 𝑥](𝜑 ∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒) ↔ (([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
8:5,7,?: e11 45033	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓) ∨ [𝐴 / 𝑥]𝜒))   )
9:?:	⊢ ((([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓) ∨ [𝐴 / 𝑥]𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒))
10:8,9,?: e10 45039	⊢ (   𝐴 ∈ 𝐵   ▶   ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒))   )
qed:10:	⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒)))

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

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

Theorem

19.21a3con13vVD 45196*

Virtual deduction proof of alrim3con13v 44878. 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 44976	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   𝜓   )
4:2,?: e2 44976	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   𝜑   )
5:2,?: e2 44976	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   𝜒   )
6:1,4,?: e12 45068	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥𝜑   )
7:3,?: e2 44976	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥𝜓   )
8:5,?: e2 44976	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥𝜒   )
9:7,6,8,?: e222 44981	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   (∀𝑥𝜓 ∧ ∀𝑥𝜑 ∧ ∀𝑥𝜒)   )
10:9,?: e2 44976	⊢ (   (𝜑 → ∀𝑥𝜑)   ,   (𝜓 ∧ 𝜑 ∧ 𝜒)   ▶   ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒)   )
11:10:in2	⊢ (   (𝜑 → ∀𝑥𝜑)   ▶   ((𝜓 ∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒))   )
qed:11:in1	⊢ ((𝜑 → ∀𝑥𝜑) → ((𝜓 ∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒)))

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

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

Theorem

exbirVD 45197

Virtual deduction proof of exbir 44824. 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 45068	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓)   ▶   (𝜒 ↔ 𝜃)   )
6:3,5,?: e32 45102	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓), 𝜃   ▶   𝜒   )
7:6:	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)), (𝜑 ∧ 𝜓)   ▶   (𝜃 → 𝜒)   )
8:7:	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))    ▶   ((𝜑 ∧ 𝜓) → (𝜃 → 𝜒))   )
9:8,?: e1a 44972	⊢ (   ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))   ▶   (𝜑 → (𝜓 → (𝜃 → 𝜒)))   )
qed:9:	⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → (𝜑 → (𝜓 → (𝜃 → 𝜒))))

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

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

Theorem

exbiriVD 45198

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 45039	⊢ (   𝜑   ▶   (𝜓 → (𝜒 ↔ 𝜃))   )
6:3,5,?: e21 45074	⊢ (   𝜑   ,   𝜓   ▶   (𝜒 ↔ 𝜃)   )
7:4,6,?: e32 45102	⊢ (   𝜑   ,   𝜓   ,   𝜃   ▶   𝜒   )
8:7:	⊢ (   𝜑   ,   𝜓   ▶   (𝜃 → 𝜒)   )
9:8:	⊢ (   𝜑   ▶   (𝜓 → (𝜃 → 𝜒))   )
qed:9:	⊢ (𝜑 → (𝜓 → (𝜃 → 𝜒)))

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

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

Theorem

rspsbc2VD 45199*

Virtual deduction proof of rspsbc2 44879. 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 45092	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ,   ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑   ▶   [𝐴 / 𝑥]∀𝑦 ∈ 𝐷𝜑   )
5:1,4,?: e13 45092	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ,   ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑   ▶   ∀𝑦 ∈ 𝐷[𝐴 / 𝑥]𝜑   )
6:2,5,?: e23 45099	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ,   ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑   ▶   [𝐶 / 𝑦][𝐴 / 𝑥]𝜑   )
7:6:	⊢ (   𝐴 ∈ 𝐵   ,   𝐶 ∈ 𝐷   ▶   (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑)   )
8:7:	⊢ (   𝐴 ∈ 𝐵   ▶   (𝐶 ∈ 𝐷 → (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑))   )
qed:8:	⊢ (𝐴 ∈ 𝐵 → (𝐶 ∈ 𝐷 → (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑)))

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

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

Theorem

3impexpVD 45200

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 45039	⊢ (   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   ▶   (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃)   )
4:3,?: e1a 44972	⊢ (   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   ▶   ((𝜑 ∧ 𝜓) → (𝜒 → 𝜃))   )
5:4,?: e1a 44972	⊢ (   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   ▶   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   )
6:5:	⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃) → (𝜑 → (𝜓 → (𝜒 → 𝜃))))
7::	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   )
8:7,?: e1a 44972	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   ((𝜑 ∧ 𝜓) → (𝜒 → 𝜃))   )
9:8,?: e1a 44972	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃)   )
10:2,9,?: e01 45036	⊢ (   (𝜑 → (𝜓 → (𝜒 → 𝜃)))   ▶   ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)   )
11:10:	⊢ ((𝜑 → (𝜓 → (𝜒 → 𝜃))) → ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃))
qed:6,11,?: e00 45112	⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃) ↔ (𝜑 → (𝜓 → (𝜒 → 𝜃))))

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

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