Type | Label | Description |
Statement |
|
Theorem | uunT12p2 44301 |
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 44302 |
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 44303 |
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 44304 |
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 44305 |
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 44306 |
A deduction unionizing a non-unionized collection of virtual hypotheses.
3anidm12 1416 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 44307 |
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 44308 |
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 44309 |
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 44310 |
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 44311 |
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 44312 |
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 44313 |
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 44314 |
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 44315 |
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 44316 |
A deduction unionizing a non-unionized collection of virtual hypotheses.
Commuted version of 3impdir 1348. (Contributed by Alan Sare,
4-Feb-2017.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (((𝜒 ∧ 𝜓) ∧ (𝜑 ∧ 𝜓)) → 𝜃) ⇒ ⊢ ((𝜑 ∧ 𝜒 ∧ 𝜓) → 𝜃) |
|
Theorem | 3impcombi 44317 |
A 1-hypothesis propositional calculus deduction. (Contributed by Alan
Sare, 25-Sep-2017.)
|
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜑) → (𝜒 ↔ 𝜃)) ⇒ ⊢ ((𝜓 ∧ 𝜑 ∧ 𝜒) → 𝜃) |
|
21.39.6 Theorems proved using Virtual
Deduction
|
|
Theorem | trsspwALT 44318 |
Virtual deduction proof of the left-to-right implication of dftr4 5268. A
transitive class is a subset of its power class. This proof corresponds
to the virtual deduction proof of dftr4 5268 without accumulating results.
(Contributed by Alan Sare, 29-Apr-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (Tr 𝐴 → 𝐴 ⊆ 𝒫 𝐴) |
|
Theorem | trsspwALT2 44319 |
Virtual deduction proof of trsspwALT 44318. This proof is the same as the
proof of trsspwALT 44318 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 44320 |
Short predicate calculus proof of the left-to-right implication of
dftr4 5268. 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 44319, which is the virtual deduction proof trsspwALT 44318
without virtual deductions. (Contributed by Alan Sare, 30-Apr-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (Tr 𝐴 → 𝐴 ⊆ 𝒫 𝐴) |
|
Theorem | sspwtr 44321 |
Virtual deduction proof of the right-to-left implication of dftr4 5268. A
class which is a subclass of its power class is transitive. This proof
corresponds to the virtual deduction proof of sspwtr 44321 without
accumulating results. (Contributed by Alan Sare, 2-May-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ⊆ 𝒫 𝐴 → Tr 𝐴) |
|
Theorem | sspwtrALT 44322 |
Virtual deduction proof of sspwtr 44321. This proof is the same as the
proof of sspwtr 44321 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 44323 |
Short predicate calculus proof of the right-to-left implication of
dftr4 5268. 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 44322, which is the virtual deduction proof sspwtr 44321
without virtual deductions. (Contributed by Alan Sare, 3-May-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ⊆ 𝒫 𝐴 → Tr 𝐴) |
|
Theorem | pwtrVD 44324 |
Virtual deduction proof of pwtr 5449; see pwtrrVD 44325 for the converse.
(Contributed by Alan Sare, 25-Aug-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (Tr 𝐴 → Tr 𝒫 𝐴) |
|
Theorem | pwtrrVD 44325 |
Virtual deduction proof of pwtr 5449; see pwtrVD 44324 for the converse.
(Contributed by Alan Sare, 25-Aug-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ 𝐴 ∈
V ⇒ ⊢ (Tr 𝒫 𝐴 → Tr 𝐴) |
|
Theorem | suctrALT 44326 |
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 44326 using completeusersproof, which is
verified by the Metamath program. The proof of
https://us.metamath.org/other/completeusersproof/suctrro.html 44326 is a
form of the completed proof which preserves the Virtual Deduction
proof's step numbers and their ordering. See suctr 6451 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 44327 |
Virtual deduction proof of snssiALT 44328. (Contributed by Alan Sare,
11-Sep-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵) |
|
Theorem | snssiALT 44328 |
If a class is an element of another class, then its singleton is a
subclass of that other class. Alternate proof of snssi 4808. This
theorem was automatically generated from snssiALTVD 44327 using a
translation program. (Contributed by Alan Sare, 11-Sep-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵) |
|
Theorem | snsslVD 44329 |
Virtual deduction proof of snssl 44330. (Contributed by Alan Sare,
25-Aug-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ 𝐴 ∈
V ⇒ ⊢ ({𝐴} ⊆ 𝐵 → 𝐴 ∈ 𝐵) |
|
Theorem | snssl 44330 |
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 4786.
The proof of
this theorem was automatically generated from snsslVD 44329 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 44331 |
Virtual deduction proof of snelpwi 5440. (Contributed by Alan Sare,
25-Aug-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → {𝐴} ∈ 𝒫 𝐵) |
|
Theorem | unipwrVD 44332 |
Virtual deduction proof of unipwr 44333. (Contributed by Alan Sare,
25-Aug-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ 𝐴 ⊆ ∪ 𝒫 𝐴 |
|
Theorem | unipwr 44333 |
A class is a subclass of the union of its power class. This theorem is
the right-to-left subclass lemma of unipw 5447. The proof of this theorem
was automatically generated from unipwrVD 44332 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 44334 |
Virtual deduction proof of sstrALT2 44335. (Contributed by Alan Sare,
11-Sep-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶) |
|
Theorem | sstrALT2 44335 |
Virtual deduction proof of sstr 3982, transitivity of subclasses, Theorem
6 of [Suppes] p. 23. This theorem was
automatically generated from
sstrALT2VD 44334 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 44336 |
Virtual deduction proof of suctrALT2 44337. (Contributed by Alan Sare,
11-Sep-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (Tr 𝐴 → Tr suc 𝐴) |
|
Theorem | suctrALT2 44337 |
Virtual deduction proof of suctr 6451. The sucessor of a transitive class
is transitive. This proof was generated automatically from the virtual
deduction proof suctrALT2VD 44336 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 44338* |
Virtual deduction proof of elex2 2804. (Contributed by Alan Sare,
25-Sep-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
|
Theorem | elex22VD 44339* |
Virtual deduction proof of elex22 3487. (Contributed by Alan Sare,
24-Oct-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) |
|
Theorem | eqsbc2VD 44340* |
Virtual deduction proof of eqsbc2 3839. (Contributed by Alan Sare,
24-Oct-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥]𝐶 = 𝑥 ↔ 𝐶 = 𝐴)) |
|
Theorem | zfregs2VD 44341* |
Virtual deduction proof of zfregs2 9751. (Contributed by Alan Sare,
24-Oct-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (𝐴 ≠ ∅ → ¬
∀𝑥 ∈ 𝐴 ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) |
|
Theorem | tpid3gVD 44342 |
Virtual deduction proof of tpid3g 4773. (Contributed by Alan Sare,
24-Oct-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐶, 𝐷, 𝐴}) |
|
Theorem | en3lplem1VD 44343* |
Virtual deduction proof of en3lplem1 9630. (Contributed by Alan Sare,
24-Oct-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 = 𝐴 → ∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥))) |
|
Theorem | en3lplem2VD 44344* |
Virtual deduction proof of en3lplem2 9631. (Contributed by Alan Sare,
24-Oct-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥))) |
|
Theorem | en3lpVD 44345 |
Virtual deduction proof of en3lp 9632. (Contributed by Alan Sare,
24-Oct-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) |
|
21.39.7 Theorems proved using Virtual Deduction
with mmj2 assistance
|
|
Theorem | simplbi2VD 44346 |
Virtual deduction proof of simplbi2 499. 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 44272 | ⊢ ((𝜓 ∧ 𝜒) → 𝜑)
| qed:3,?: e0a 44272 | ⊢ (𝜓 → (𝜒 → 𝜑))
|
The proof of simplbi2 499 was automatically derived from it.
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝜑 ↔ (𝜓 ∧ 𝜒)) ⇒ ⊢ (𝜓 → (𝜒 → 𝜑)) |
|
Theorem | 3ornot23VD 44347 |
Virtual deduction proof of 3ornot23 44009. 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 44127 | ⊢ ( (¬ 𝜑 ∧ ¬ 𝜓) ▶ ¬ 𝜑 )
| 4:1,?: e1a 44127 | ⊢ ( (¬ 𝜑 ∧ ¬ 𝜓) ▶ ¬ 𝜓 )
| 5:3,4,?: e11 44188 | ⊢ ( (¬ 𝜑 ∧ ¬ 𝜓) ▶ ¬ (𝜑
∨ 𝜓) )
| 6:2,?: e2 44131 | ⊢ ( (¬ 𝜑 ∧ ¬ 𝜓) , (𝜒 ∨ 𝜑
∨ 𝜓) ▶ (𝜒 ∨ (𝜑 ∨ 𝜓)) )
| 7:5,6,?: e12 44224 | ⊢ ( (¬ 𝜑 ∧ ¬ 𝜓) , (𝜒 ∨ 𝜑
∨ 𝜓) ▶ 𝜒 )
| 8:7: | ⊢ ( (¬ 𝜑 ∧ ¬ 𝜓) ▶ ((𝜒
∨ 𝜑 ∨ 𝜓) → 𝜒) )
| qed:8: | ⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ((𝜒
∨ 𝜑 ∨ 𝜓) → 𝜒))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ ((¬ 𝜑 ∧ ¬ 𝜓) → ((𝜒 ∨ 𝜑 ∨ 𝜓) → 𝜒)) |
|
Theorem | orbi1rVD 44348 |
Virtual deduction proof of orbi1r 44010. 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 44131 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ∨ 𝜑)
▶ (𝜑 ∨ 𝜒) )
| 4:1,3,?: e12 44224 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ∨ 𝜑)
▶ (𝜓 ∨ 𝜒) )
| 5:4,?: e2 44131 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ∨ 𝜑)
▶ (𝜒 ∨ 𝜓) )
| 6:5: | ⊢ ( (𝜑 ↔ 𝜓) ▶ ((𝜒 ∨ 𝜑)
→ (𝜒 ∨ 𝜓)) )
| 7:: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ∨ 𝜓)
▶ (𝜒 ∨ 𝜓) )
| 8:7,?: e2 44131 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ∨ 𝜓)
▶ (𝜓 ∨ 𝜒) )
| 9:1,8,?: e12 44224 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ∨ 𝜓)
▶ (𝜑 ∨ 𝜒) )
| 10:9,?: e2 44131 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ∨ 𝜓)
▶ (𝜒 ∨ 𝜑) )
| 11:10: | ⊢ ( (𝜑 ↔ 𝜓) ▶ ((𝜒 ∨ 𝜓)
→ (𝜒 ∨ 𝜑)) )
| 12:6,11,?: e11 44188 | ⊢ ( (𝜑 ↔ 𝜓) ▶ ((𝜒
∨ 𝜑) ↔ (𝜒 ∨ 𝜓)) )
| qed:12: | ⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ∨ 𝜑)
↔ (𝜒 ∨ 𝜓)))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ∨ 𝜑) ↔ (𝜒 ∨ 𝜓))) |
|
Theorem | bitr3VD 44349 |
Virtual deduction proof of bitr3 351. 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 44127 | ⊢ ( (𝜑 ↔ 𝜓) ▶ (𝜓
↔ 𝜑) )
| 3:: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜑 ↔ 𝜒)
▶ (𝜑 ↔ 𝜒) )
| 4:3,?: e2 44131 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜑 ↔ 𝜒)
▶ (𝜒 ↔ 𝜑) )
| 5:2,4,?: e12 44224 | ⊢ ( (𝜑 ↔ 𝜓) , (𝜑 ↔ 𝜒)
▶ (𝜓 ↔ 𝜒) )
| 6:5: | ⊢ ( (𝜑 ↔ 𝜓) ▶ ((𝜑
↔ 𝜒) → (𝜓 ↔ 𝜒)) )
| qed:6: | ⊢ ((𝜑 ↔ 𝜓) → ((𝜑 ↔ 𝜒)
→ (𝜓 ↔ 𝜒)))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ↔ 𝜓) → ((𝜑 ↔ 𝜒) → (𝜓 ↔ 𝜒))) |
|
Theorem | 3orbi123VD 44350 |
Virtual deduction proof of 3orbi123 44011. 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 44127 | ⊢ ( ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃)
∧ (𝜏 ↔ 𝜂)) ▶ (𝜑 ↔ 𝜓) )
| 3:1,?: e1a 44127 | ⊢ ( ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃)
∧ (𝜏 ↔ 𝜂)) ▶ (𝜒 ↔ 𝜃) )
| 4:1,?: e1a 44127 | ⊢ ( ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃)
∧ (𝜏 ↔ 𝜂)) ▶ (𝜏 ↔ 𝜂) )
| 5:2,3,?: e11 44188 | ⊢ ( ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃)
∧ (𝜏 ↔ 𝜂)) ▶ ((𝜑 ∨ 𝜒) ↔ (𝜓 ∨ 𝜃)) )
| 6:5,4,?: e11 44188 | ⊢ ( ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃)
∧ (𝜏 ↔ 𝜂)) ▶ (((𝜑 ∨ 𝜒) ∨ 𝜏) ↔ ((𝜓 ∨ 𝜃)
∨ 𝜂)) )
| 7:?: | ⊢ (((𝜑 ∨ 𝜒) ∨ 𝜏) ↔ (𝜑
∨ 𝜒 ∨ 𝜏))
| 8:6,7,?: e10 44194 | ⊢ ( ((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃)
∧ (𝜏 ↔ 𝜂)) ▶ ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ ((𝜓 ∨ 𝜃)
∨ 𝜂)) )
| 9:?: | ⊢ (((𝜓 ∨ 𝜃) ∨ 𝜂) ↔
(𝜓 ∨ 𝜃 ∨ 𝜂))
| 10:8,9,?: e10 44194 | ⊢ ( ((𝜑 ↔ 𝜓) ∧ (𝜒
↔ 𝜃) ∧ (𝜏 ↔ 𝜂)) ▶ ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨
𝜃 ∨ 𝜂)) )
| qed:10: | ⊢ (((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃)
∧ (𝜏 ↔ 𝜂)) → ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨ 𝜃
∨ 𝜂)))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜃) ∧ (𝜏 ↔ 𝜂)) → ((𝜑 ∨ 𝜒 ∨ 𝜏) ↔ (𝜓 ∨ 𝜃 ∨ 𝜂))) |
|
Theorem | sbc3orgVD 44351 |
Virtual deduction proof of the analogue of sbcor 3824 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 44127 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]((𝜑
∨ 𝜓) ∨ 𝜒) ↔ ([𝐴 / 𝑥](𝜑 ∨ 𝜓)
∨ [𝐴 / 𝑥]𝜒)) )
| 3:: | ⊢ (((𝜑 ∨ 𝜓) ∨ 𝜒) ↔ (𝜑
∨ 𝜓 ∨ 𝜒))
| 32:3: | ⊢ ∀𝑥(((𝜑 ∨ 𝜓) ∨ 𝜒)
↔ (𝜑 ∨ 𝜓 ∨ 𝜒))
| 33:1,32,?: e10 44194 | ⊢ ( 𝐴 ∈ 𝐵 ▶ [𝐴 / 𝑥](((𝜑
∨ 𝜓) ∨ 𝜒) ↔ (𝜑 ∨ 𝜓 ∨ 𝜒)) )
| 4:1,33,?: e11 44188 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]((𝜑
∨ 𝜓) ∨ 𝜒) ↔ [𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒)) )
| 5:2,4,?: e11 44188 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜑
∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥](𝜑 ∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒)) )
| 6:1,?: e1a 44127 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜑
∨ 𝜓) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓)) )
| 7:6,?: e1a 44127 | ⊢ ( 𝐴 ∈ 𝐵 ▶ (([𝐴 / 𝑥](𝜑
∨ 𝜓) ∨ [𝐴 / 𝑥]𝜒) ↔ (([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓)
∨ [𝐴 / 𝑥]𝜒)) )
| 8:5,7,?: e11 44188 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜑
∨ 𝜓 ∨ 𝜒) ↔ (([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓)
∨ [𝐴 / 𝑥]𝜒)) )
| 9:?: | ⊢ ((([𝐴 / 𝑥]𝜑
∨ [𝐴 / 𝑥]𝜓) ∨ [𝐴 / 𝑥]𝜒) ↔ ([𝐴 / 𝑥]𝜑
∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒))
| 10:8,9,?: e10 44194 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜑
∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓
∨ [𝐴 / 𝑥]𝜒)) )
| qed:10: | ⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥](𝜑
∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓
∨ [𝐴 / 𝑥]𝜒)))
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥](𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ([𝐴 / 𝑥]𝜑 ∨ [𝐴 / 𝑥]𝜓 ∨ [𝐴 / 𝑥]𝜒))) |
|
Theorem | 19.21a3con13vVD 44352* |
Virtual deduction proof of alrim3con13v 44033. 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 44131 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ 𝜓 )
| 4:2,?: e2 44131 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ 𝜑 )
| 5:2,?: e2 44131 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ 𝜒 )
| 6:1,4,?: e12 44224 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ ∀𝑥𝜑 )
| 7:3,?: e2 44131 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ ∀𝑥𝜓 )
| 8:5,?: e2 44131 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ ∀𝑥𝜒 )
| 9:7,6,8,?: e222 44136 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ (∀𝑥𝜓 ∧ ∀𝑥𝜑 ∧ ∀𝑥𝜒) )
| 10:9,?: e2 44131 | ⊢ ( (𝜑 → ∀𝑥𝜑) , (𝜓
∧ 𝜑 ∧ 𝜒) ▶ ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒) )
| 11:10:in2 | ⊢ ( (𝜑 → ∀𝑥𝜑) ▶ ((𝜓
∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒)) )
| qed:11:in1 | ⊢ ((𝜑 → ∀𝑥𝜑) → ((𝜓
∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒)))
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 → ∀𝑥𝜑) → ((𝜓 ∧ 𝜑 ∧ 𝜒) → ∀𝑥(𝜓 ∧ 𝜑 ∧ 𝜒))) |
|
Theorem | exbirVD 44353 |
Virtual deduction proof of exbir 43978. 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 44224 | ⊢ ( ((𝜑 ∧ 𝜓) → (𝜒
↔ 𝜃)), (𝜑 ∧ 𝜓) ▶ (𝜒 ↔ 𝜃) )
| 6:3,5,?: e32 44258 | ⊢ ( ((𝜑 ∧ 𝜓) → (𝜒
↔ 𝜃)), (𝜑 ∧ 𝜓), 𝜃 ▶ 𝜒 )
| 7:6: | ⊢ ( ((𝜑 ∧ 𝜓) → (𝜒
↔ 𝜃)), (𝜑 ∧ 𝜓) ▶ (𝜃 → 𝜒) )
| 8:7: | ⊢ ( ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))
▶ ((𝜑 ∧ 𝜓) → (𝜃 → 𝜒)) )
| 9:8,?: e1a 44127 | ⊢ ( ((𝜑 ∧ 𝜓) → (𝜒
↔ 𝜃)) ▶ (𝜑 → (𝜓 → (𝜃 → 𝜒))) )
| qed:9: | ⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃))
→ (𝜑 → (𝜓 → (𝜃 → 𝜒))))
|
(Contributed by Alan Sare, 13-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) → (𝜑 → (𝜓 → (𝜃 → 𝜒)))) |
|
Theorem | exbiriVD 44354 |
Virtual deduction proof of exbiri 809. 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 44194 | ⊢ ( 𝜑 ▶ (𝜓 → (𝜒 ↔ 𝜃)) )
| 6:3,5,?: e21 44230 | ⊢ ( 𝜑 , 𝜓 ▶ (𝜒 ↔ 𝜃) )
| 7:4,6,?: e32 44258 | ⊢ ( 𝜑 , 𝜓 , 𝜃 ▶ 𝜒 )
| 8:7: | ⊢ ( 𝜑 , 𝜓 ▶ (𝜃 → 𝜒) )
| 9:8: | ⊢ ( 𝜑 ▶ (𝜓 → (𝜃 → 𝜒)) )
| qed:9: | ⊢ (𝜑 → (𝜓 → (𝜃 → 𝜒)))
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ∧ 𝜓) → (𝜒 ↔ 𝜃)) ⇒ ⊢ (𝜑 → (𝜓 → (𝜃 → 𝜒))) |
|
Theorem | rspsbc2VD 44355* |
Virtual deduction proof of rspsbc2 44034. 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 44248 | ⊢ ( 𝐴 ∈ 𝐵 , 𝐶 ∈ 𝐷 , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ [𝐴 / 𝑥]∀𝑦 ∈ 𝐷𝜑 )
| 5:1,4,?: e13 44248 | ⊢ ( 𝐴 ∈ 𝐵 , 𝐶 ∈ 𝐷 , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ ∀𝑦 ∈ 𝐷[𝐴 / 𝑥]𝜑 )
| 6:2,5,?: e23 44255 | ⊢ ( 𝐴 ∈ 𝐵 , 𝐶 ∈ 𝐷 , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ [𝐶 / 𝑦][𝐴 / 𝑥]𝜑 )
| 7:6: | ⊢ ( 𝐴 ∈ 𝐵 , 𝐶 ∈ 𝐷 ▶ (∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑) )
| 8:7: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (𝐶 ∈ 𝐷
→ (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑)) )
| qed:8: | ⊢ (𝐴 ∈ 𝐵 → (𝐶 ∈ 𝐷
→ (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑)))
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → (𝐶 ∈ 𝐷 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷 𝜑 → [𝐶 / 𝑦][𝐴 / 𝑥]𝜑))) |
|
Theorem | 3impexpVD 44356 |
Virtual deduction proof of 3impexp 1355. 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 44194 | ⊢ ( ((𝜑 ∧ 𝜓 ∧ 𝜒)
→ 𝜃) ▶ (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃) )
| 4:3,?: e1a 44127 | ⊢ ( ((𝜑 ∧ 𝜓 ∧ 𝜒)
→ 𝜃) ▶ ((𝜑 ∧ 𝜓) → (𝜒 → 𝜃)) )
| 5:4,?: e1a 44127 | ⊢ ( ((𝜑 ∧ 𝜓 ∧ 𝜒)
→ 𝜃) ▶ (𝜑 → (𝜓 → (𝜒 → 𝜃))) )
| 6:5: | ⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)
→ (𝜑 → (𝜓 → (𝜒 → 𝜃))))
| 7:: | ⊢ ( (𝜑 → (𝜓 → (𝜒
→ 𝜃))) ▶ (𝜑 → (𝜓 → (𝜒 → 𝜃))) )
| 8:7,?: e1a 44127 | ⊢ ( (𝜑 → (𝜓 → (𝜒
→ 𝜃))) ▶ ((𝜑 ∧ 𝜓) → (𝜒 → 𝜃)) )
| 9:8,?: e1a 44127 | ⊢ ( (𝜑 → (𝜓 → (𝜒
→ 𝜃))) ▶ (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃) )
| 10:2,9,?: e01 44191 | ⊢ ( (𝜑 → (𝜓 → (𝜒
→ 𝜃))) ▶ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃) )
| 11:10: | ⊢ ((𝜑 → (𝜓 → (𝜒
→ 𝜃))) → ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃))
| qed:6,11,?: e00 44268 | ⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒)
→ 𝜃) ↔ (𝜑 → (𝜓 → (𝜒 → 𝜃))))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃) ↔ (𝜑 → (𝜓 → (𝜒 → 𝜃)))) |
|
Theorem | 3impexpbicomVD 44357 |
Virtual deduction proof of 3impexpbicom 43979. 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 44194 | ⊢ ( ((𝜑 ∧ 𝜓 ∧ 𝜒)
→ (𝜃 ↔ 𝜏)) ▶ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜏 ↔ 𝜃)) )
| 4:3,?: e1a 44127 | ⊢ ( ((𝜑 ∧ 𝜓 ∧ 𝜒)
→ (𝜃 ↔ 𝜏)) ▶ (𝜑 → (𝜓 → (𝜒 → (𝜏
↔ 𝜃)))) )
| 5:4: | ⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒)
→ (𝜃 ↔ 𝜏)) → (𝜑 → (𝜓 → (𝜒 → (𝜏
↔ 𝜃)))))
| 6:: | ⊢ ( (𝜑 → (𝜓 → (𝜒
→ (𝜏 ↔ 𝜃)))) ▶ (𝜑 → (𝜓 → (𝜒 → (𝜏
↔ 𝜃)))) )
| 7:6,?: e1a 44127 | ⊢ ( (𝜑 → (𝜓 → (𝜒
→ (𝜏 ↔ 𝜃)))) ▶ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜏
↔ 𝜃)) )
| 8:7,2,?: e10 44194 | ⊢ ( (𝜑 → (𝜓 → (𝜒
→ (𝜏 ↔ 𝜃)))) ▶ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜃
↔ 𝜏)) )
| 9:8: | ⊢ ((𝜑 → (𝜓 → (𝜒
→ (𝜏 ↔ 𝜃)))) → ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜃
↔ 𝜏)))
| qed:5,9,?: e00 44268 | ⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒)
→ (𝜃 ↔ 𝜏)) ↔ (𝜑 → (𝜓 → (𝜒 → (𝜏
↔ 𝜃)))))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜃 ↔ 𝜏)) ↔ (𝜑 → (𝜓 → (𝜒 → (𝜏 ↔ 𝜃))))) |
|
Theorem | 3impexpbicomiVD 44358 |
Virtual deduction proof of 3impexpbicomi 43980. 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:: | ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜃
↔ 𝜏))
| qed:1,?: e0a 44272 | ⊢ (𝜑 → (𝜓 → (𝜒
→ (𝜏 ↔ 𝜃))))
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜃 ↔ 𝜏)) ⇒ ⊢ (𝜑 → (𝜓 → (𝜒 → (𝜏 ↔ 𝜃)))) |
|
Theorem | sbcoreleleqVD 44359* |
Virtual deduction proof of sbcoreleleq 44035. 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 44127 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑦]𝑥 ∈
𝑦 ↔ 𝑥 ∈ 𝐴) )
| 3:1,?: e1a 44127 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑦]𝑦 ∈
𝑥 ↔ 𝐴 ∈ 𝑥) )
| 4:1,?: e1a 44127 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑦]𝑥 =
𝑦 ↔ 𝑥 = 𝐴) )
| 5:2,3,4,?: e111 44174 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ((𝑥 ∈ 𝐴
∨ 𝐴 ∈ 𝑥 ∨ 𝑥 = 𝐴) ↔ ([𝐴 / 𝑦]𝑥 ∈ 𝑦 ∨ [𝐴 / 𝑦]𝑦 ∈ 𝑥
∨ [𝐴 / 𝑦]𝑥 = 𝑦)) )
| 6:1,?: e1a 44127 | ⊢ ( 𝐴 ∈ 𝐵
▶ ([𝐴 / 𝑦](𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ↔ ([𝐴 / 𝑦]𝑥
∈ 𝑦 ∨ [𝐴 / 𝑦]𝑦 ∈ 𝑥 ∨ [𝐴 / 𝑦]𝑥 = 𝑦)) )
| 7:5,6: e11 44188 | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑦](𝑥
∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 ∨ 𝐴 ∈ 𝑥 ∨ 𝑥 = 𝐴)) )
| qed:7: | ⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑦](𝑥 ∈ 𝑦
∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 ∨ 𝐴 ∈ 𝑥 ∨ 𝑥 = 𝐴)))
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑦](𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 ∨ 𝐴 ∈ 𝑥 ∨ 𝑥 = 𝐴))) |
|
Theorem | hbra2VD 44360* |
Virtual deduction proof of nfra2 3360. 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,?: e00 44268 | ⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 →
∀𝑦∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
| 4:2: | ⊢ ∀𝑦(∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 ↔
∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
| 5:4,?: e0a 44272 | ⊢ (∀𝑦∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 ↔
∀𝑦∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
| qed:3,5,?: e00 44268 | ⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 →
∀𝑦∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑)
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 → ∀𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑) |
|
Theorem | tratrbVD 44361* |
Virtual deduction proof of tratrb 44036. 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:: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴)
▶ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦)
∧ 𝐵 ∈ 𝐴) )
| 2:1,?: e1a 44127 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) ▶ Tr 𝐴 )
| 3:1,?: e1a 44127 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴)
▶ ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) )
| 4:1,?: e1a 44127 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) ▶ 𝐵 ∈ 𝐴 )
| 5:: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) )
| 6:5,?: e2 44131 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ 𝑥 ∈ 𝑦 )
| 7:5,?: e2 44131 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ 𝑦 ∈ 𝐵 )
| 8:2,7,4,?: e121 44156 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ 𝑦 ∈ 𝐴 )
| 9:2,6,8,?: e122 44153 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ 𝑥 ∈ 𝐴 )
| 10:: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵), 𝐵 ∈ 𝑥 ▶ 𝐵 ∈ 𝑥 )
| 11:6,7,10,?: e223 44135 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵), 𝐵 ∈ 𝑥 ▶ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵 ∧ 𝐵 ∈ 𝑥) )
| 12:11: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ (𝐵 ∈ 𝑥 → (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵 ∧ 𝐵 ∈ 𝑥)) )
| 13:: | ⊢ ¬ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵
∧ 𝐵 ∈ 𝑥)
| 14:12,13,?: e20 44227 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ ¬ 𝐵 ∈ 𝑥 )
| 15:: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵), 𝑥 = 𝐵 ▶ 𝑥 = 𝐵 )
| 16:7,15,?: e23 44255 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵), 𝑥 = 𝐵 ▶ 𝑦 ∈ 𝑥 )
| 17:6,16,?: e23 44255 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵), 𝑥 = 𝐵 ▶ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) )
| 18:17: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ (𝑥 = 𝐵 → (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥)) )
| 19:: | ⊢ ¬ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥)
| 20:18,19,?: e20 44227 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ ¬ 𝑥 = 𝐵 )
| 21:3,?: e1a 44127 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) ▶ ∀𝑦 ∈ 𝐴
∀𝑥 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) )
| 22:21,9,4,?: e121 44156 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ [𝑥 / 𝑥][𝐵 / 𝑦](𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥
∨ 𝑥 = 𝑦) )
| 23:22,?: e2 44131 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ [𝐵 / 𝑦](𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) )
| 24:4,23,?: e12 44224 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ (𝑥 ∈ 𝐵 ∨ 𝐵 ∈ 𝑥 ∨ 𝑥 = 𝐵) )
| 25:14,20,24,?: e222 44136 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴), (𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) ▶ 𝑥 ∈ 𝐵 )
| 26:25: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) ▶ ((𝑥 ∈ 𝑦
∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐵) )
| 27:: | ⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦
∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) → ∀𝑦∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨
𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 28:27,?: e0a 44272 | ⊢ ((Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴)
→ ∀𝑦(Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥
∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴))
| 29:28,26: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴)
▶ ∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐵) )
| 30:: | ⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦
∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) → ∀𝑥∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦
∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 31:30,?: e0a 44272 | ⊢ ((Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) → ∀𝑥(Tr 𝐴
∧ ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴))
| 32:31,29: | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) ▶ ∀𝑥
∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐵) )
| 33:32,?: e1a 44127 | ⊢ ( (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) ▶ Tr 𝐵 )
| qed:33: | ⊢ ((Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) → Tr 𝐵)
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) ∧ 𝐵 ∈ 𝐴) → Tr 𝐵) |
|
Theorem | al2imVD 44362 |
Virtual deduction proof of al2im 1808. 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 44127 | ⊢ ( ∀𝑥(𝜑 → (𝜓 → 𝜒))
▶ (∀𝑥𝜑 → ∀𝑥(𝜓 → 𝜒)) )
| 3:: | ⊢ (∀𝑥(𝜓 → 𝜒) → (∀𝑥𝜓
→ ∀𝑥𝜒))
| 4:2,3,?: e10 44194 | ⊢ ( ∀𝑥(𝜑 → (𝜓 → 𝜒))
▶ (∀𝑥𝜑 → (∀𝑥𝜓 → ∀𝑥𝜒)) )
| qed:4: | ⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒))
→ (∀𝑥𝜑 → (∀𝑥𝜓 → ∀𝑥𝜒)))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → (∀𝑥𝜑 → (∀𝑥𝜓 → ∀𝑥𝜒))) |
|
Theorem | syl5impVD 44363 |
Virtual deduction proof of syl5imp 44012. 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 44127 | ⊢ ( (𝜑 → (𝜓 → 𝜒)) ▶ (𝜓
→ (𝜑 → 𝜒)) )
| 3:: | ⊢ ( (𝜑 → (𝜓 → 𝜒)) , (𝜃
→ 𝜓) ▶ (𝜃 → 𝜓) )
| 4:3,2,?: e21 44230 | ⊢ ( (𝜑 → (𝜓 → 𝜒)) , (𝜃
→ 𝜓) ▶ (𝜃 → (𝜑 → 𝜒)) )
| 5:4,?: e2 44131 | ⊢ ( (𝜑 → (𝜓 → 𝜒)) , (𝜃
→ 𝜓) ▶ (𝜑 → (𝜃 → 𝜒)) )
| 6:5: | ⊢ ( (𝜑 → (𝜓 → 𝜒)) ▶ ((𝜃
→ 𝜓) → (𝜑 → (𝜃 → 𝜒))) )
| qed:6: | ⊢ ((𝜑 → (𝜓 → 𝜒)) → ((𝜃
→ 𝜓) → (𝜑 → (𝜃 → 𝜒))))
|
(Contributed by Alan Sare, 31-Dec-2011.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 → (𝜓 → 𝜒)) → ((𝜃 → 𝜓) → (𝜑 → (𝜃 → 𝜒)))) |
|
Theorem | idiVD 44364 |
Virtual deduction proof of idiALT 43977. 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:: | ⊢ 𝜑
| qed:1,?: e0a 44272 | ⊢ 𝜑
|
(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ 𝜑 ⇒ ⊢ 𝜑 |
|
Theorem | ancomstVD 44365 |
Closed form of ancoms 457. 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:: | ⊢ ((𝜑 ∧ 𝜓) ↔ (𝜓 ∧ 𝜑))
| qed:1,?: e0a 44272 | ⊢ (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜓
∧ 𝜑) → 𝜒))
|
The proof of ancomst 463 is derived automatically from it.
(Contributed by
Alan Sare, 25-Dec-2011.) (Proof modification is discouraged.)
(New usage is discouraged.)
|
⊢ (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜓 ∧ 𝜑) → 𝜒)) |
|
Theorem | ssralv2VD 44366* |
Quantification restricted to a subclass for two quantifiers. ssralv 4042
for two quantifiers. The following User's Proof is a Virtual Deduction
proof completed automatically by the tools program
completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm
Megill's Metamath Proof Assistant. ssralv2 44031 is ssralv2VD 44366 without
virtual deductions and was automatically derived from ssralv2VD 44366.
1:: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) ▶ (𝐴 ⊆ 𝐵
∧ 𝐶 ⊆ 𝐷) )
| 2:: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ ∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 )
| 3:1: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) ▶ 𝐴 ⊆ 𝐵 )
| 4:3,2: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐷𝜑 )
| 5:4: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐷𝜑) )
| 6:5: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐷𝜑) )
| 7:: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑, 𝑥 ∈ 𝐴 ▶ 𝑥 ∈ 𝐴 )
| 8:7,6: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑, 𝑥 ∈ 𝐴 ▶ ∀𝑦 ∈ 𝐷𝜑 )
| 9:1: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) ▶ 𝐶 ⊆ 𝐷 )
| 10:9,8: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑, 𝑥 ∈ 𝐴 ▶ ∀𝑦 ∈ 𝐶𝜑 )
| 11:10: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐶𝜑) )
| 12:: | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)
→ ∀𝑥(𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷))
| 13:: | ⊢ (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑
→ ∀𝑥∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑)
| 14:12,13,11: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐶𝜑) )
| 15:14: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) , ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐷𝜑 ▶ ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐶𝜑 )
| 16:15: | ⊢ ( (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)
▶ (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐶𝜑) )
| qed:16: | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)
→ (∀𝑥 ∈ 𝐵∀𝑦 ∈ 𝐷𝜑 → ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐶𝜑))
|
(Contributed by Alan Sare, 10-Feb-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐷 𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝜑)) |
|
Theorem | ordelordALTVD 44367 |
An element of an ordinal class is ordinal. Proposition 7.6 of
[TakeutiZaring] p. 36. This is an alternate proof of ordelord 6387 using
the Axiom of Regularity indirectly through dford2 9638. dford2 is a
weaker definition of ordinal number. Given the Axiom of Regularity, it
need not be assumed that E Fr 𝐴 because this is inferred by the
Axiom of Regularity. The following User's Proof is a Virtual Deduction
proof completed automatically by the tools program
completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm
Megill's Metamath Proof Assistant. ordelordALT 44037 is ordelordALTVD 44367
without virtual deductions and was automatically derived from
ordelordALTVD 44367 using the tools program
translate..without..overwriting.cmd and the Metamath program "MM-PA>
MINIMIZE_WITH *" command.
1:: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ (Ord 𝐴
∧ 𝐵 ∈ 𝐴) )
| 2:1: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ Ord 𝐴 )
| 3:1: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ 𝐵 ∈ 𝐴 )
| 4:2: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ Tr 𝐴 )
| 5:2: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥) )
| 6:4,3: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ 𝐵 ⊆ 𝐴 )
| 7:6,6,5: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ ∀𝑥 ∈ 𝐵
∀𝑦 ∈ 𝐵(𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥) )
| 8:: | ⊢ ((𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)
↔ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 9:8: | ⊢ ∀𝑦((𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥)
↔ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 10:9: | ⊢ ∀𝑦 ∈ 𝐴((𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦
∨ 𝑦 ∈ 𝑥) ↔ (𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 11:10: | ⊢ (∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦
∨ 𝑦 ∈ 𝑥) ↔ ∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 12:11: | ⊢ ∀𝑥(∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦
∨ 𝑦 ∈ 𝑥) ↔ ∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 13:12: | ⊢ ∀𝑥 ∈ 𝐴(∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦
∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥) ↔ ∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦))
| 14:13: | ⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦
∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥) ↔ ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥
∨ 𝑥 = 𝑦))
| 15:14,5: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑦 ∈ 𝑥 ∨ 𝑥 = 𝑦) )
| 16:4,15,3: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ Tr 𝐵 )
| 17:16,7: | ⊢ ( (Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ▶ Ord 𝐵 )
| qed:17: | ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵)
|
(Contributed by Alan Sare, 12-Feb-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → Ord 𝐵) |
|
Theorem | equncomVD 44368 |
If a class equals the union of two other classes, then it equals the union
of those two classes commuted. The following User's Proof is a Virtual
Deduction proof completed automatically by the tools program
completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm
Megill's Metamath Proof Assistant. equncom 4148 is equncomVD 44368 without
virtual deductions and was automatically derived from equncomVD 44368.
1:: | ⊢ ( 𝐴 = (𝐵 ∪ 𝐶) ▶ 𝐴 = (𝐵 ∪ 𝐶) )
| 2:: | ⊢ (𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵)
| 3:1,2: | ⊢ ( 𝐴 = (𝐵 ∪ 𝐶) ▶ 𝐴 = (𝐶 ∪ 𝐵) )
| 4:3: | ⊢ (𝐴 = (𝐵 ∪ 𝐶) → 𝐴 = (𝐶 ∪ 𝐵))
| 5:: | ⊢ ( 𝐴 = (𝐶 ∪ 𝐵) ▶ 𝐴 = (𝐶 ∪ 𝐵) )
| 6:5,2: | ⊢ ( 𝐴 = (𝐶 ∪ 𝐵) ▶ 𝐴 = (𝐵 ∪ 𝐶) )
| 7:6: | ⊢ (𝐴 = (𝐶 ∪ 𝐵) → 𝐴 = (𝐵 ∪ 𝐶))
| 8:4,7: | ⊢ (𝐴 = (𝐵 ∪ 𝐶) ↔ 𝐴 = (𝐶 ∪ 𝐵))
|
(Contributed by Alan Sare, 17-Feb-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 = (𝐵 ∪ 𝐶) ↔ 𝐴 = (𝐶 ∪ 𝐵)) |
|
Theorem | equncomiVD 44369 |
Inference form of equncom 4148. The following User's Proof is a
Virtual Deduction proof completed automatically by the tools program
completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm
Megill's Metamath Proof Assistant. equncomi 4149 is equncomiVD 44369 without
virtual deductions and was automatically derived from equncomiVD 44369.
h1:: | ⊢ 𝐴 = (𝐵 ∪ 𝐶)
| qed:1: | ⊢ 𝐴 = (𝐶 ∪ 𝐵)
|
(Contributed by Alan Sare, 18-Feb-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ 𝐴 = (𝐵 ∪ 𝐶) ⇒ ⊢ 𝐴 = (𝐶 ∪ 𝐵) |
|
Theorem | sucidALTVD 44370 |
A set belongs to its successor. Alternate proof of sucid 6447.
The following User's Proof is a Virtual Deduction proof
completed automatically by the tools program
completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm
Megill's Metamath Proof Assistant. sucidALT 44371 is sucidALTVD 44370
without virtual deductions and was automatically derived from
sucidALTVD 44370. This proof illustrates that
completeusersproof.cmd will generate a Metamath proof from any
User's Proof which is "conventional" in the sense that no step
is a virtual deduction, provided that all necessary unification
theorems and transformation deductions are in set.mm.
completeusersproof.cmd automatically converts such a
conventional proof into a Virtual Deduction proof for which each
step happens to be a 0-virtual hypothesis virtual deduction.
The user does not need to search for reference theorem labels or
deduction labels nor does he(she) need to use theorems and
deductions which unify with reference theorems and deductions in
set.mm. All that is necessary is that each theorem or deduction
of the User's Proof unifies with some reference theorem or
deduction in set.mm or is a semantic variation of some theorem
or deduction which unifies with some reference theorem or
deduction in set.mm. The definition of "semantic variation" has
not been precisely defined. If it is obvious that a theorem or
deduction has the same meaning as another theorem or deduction,
then it is a semantic variation of the latter theorem or
deduction. For example, step 4 of the User's Proof is a
semantic variation of the definition (axiom)
suc 𝐴 = (𝐴 ∪ {𝐴}), which unifies with df-suc 6371, a
reference definition (axiom) in set.mm. Also, a theorem or
deduction is said to be a semantic variation of another
theorem or deduction if it is obvious upon cursory inspection
that it has the same meaning as a weaker form of the latter
theorem or deduction. For example, the deduction Ord 𝐴
infers ∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥) is a
semantic variation of the theorem (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥 ∈ 𝐴
∀𝑦 ∈ 𝐴(𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))), which unifies with
the set.mm reference definition (axiom) dford2 9638.
h1:: | ⊢ 𝐴 ∈ V
| 2:1: | ⊢ 𝐴 ∈ {𝐴}
| 3:2: | ⊢ 𝐴 ∈ ({𝐴} ∪ 𝐴)
| 4:: | ⊢ suc 𝐴 = ({𝐴} ∪ 𝐴)
| qed:3,4: | ⊢ 𝐴 ∈ suc 𝐴
|
(Contributed by Alan Sare, 18-Feb-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ 𝐴 ∈
V ⇒ ⊢ 𝐴 ∈ suc 𝐴 |
|
Theorem | sucidALT 44371 |
A set belongs to its successor. This proof was automatically derived
from sucidALTVD 44370 using translate_without_overwriting.cmd and
minimizing. (Contributed by Alan Sare, 18-Feb-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ 𝐴 ∈
V ⇒ ⊢ 𝐴 ∈ suc 𝐴 |
|
Theorem | sucidVD 44372 |
A set belongs to its successor. The following User's Proof is a
Virtual Deduction proof completed automatically by the tools
program completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2
and Norm Megill's Metamath Proof Assistant.
sucid 6447 is sucidVD 44372 without virtual deductions and was automatically
derived from sucidVD 44372.
h1:: | ⊢ 𝐴 ∈ V
| 2:1: | ⊢ 𝐴 ∈ {𝐴}
| 3:2: | ⊢ 𝐴 ∈ (𝐴 ∪ {𝐴})
| 4:: | ⊢ suc 𝐴 = (𝐴 ∪ {𝐴})
| qed:3,4: | ⊢ 𝐴 ∈ suc 𝐴
|
(Contributed by Alan Sare, 18-Feb-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ 𝐴 ∈
V ⇒ ⊢ 𝐴 ∈ suc 𝐴 |
|
Theorem | imbi12VD 44373 |
Implication form of imbi12i 349. The following User's Proof is a Virtual
Deduction proof completed automatically by the tools program
completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm
Megill's Metamath Proof Assistant. imbi12 345 is imbi12VD 44373 without virtual
deductions and was automatically derived from imbi12VD 44373.
1:: | ⊢ ( (𝜑 ↔ 𝜓) ▶ (𝜑 ↔ 𝜓) )
| 2:: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃)
▶ (𝜒 ↔ 𝜃) )
| 3:: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜑
→ 𝜒) ▶ (𝜑 → 𝜒) )
| 4:1,3: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜑
→ 𝜒) ▶ (𝜓 → 𝜒) )
| 5:2,4: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜑
→ 𝜒) ▶ (𝜓 → 𝜃) )
| 6:5: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃)
▶ ((𝜑 → 𝜒) → (𝜓 → 𝜃)) )
| 7:: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜓
→ 𝜃) ▶ (𝜓 → 𝜃) )
| 8:1,7: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜓
→ 𝜃) ▶ (𝜑 → 𝜃) )
| 9:2,8: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜓
→ 𝜃) ▶ (𝜑 → 𝜒) )
| 10:9: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃)
▶ ((𝜓 → 𝜃) → (𝜑 → 𝜒)) )
| 11:6,10: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃)
▶ ((𝜑 → 𝜒) ↔ (𝜓 → 𝜃)) )
| 12:11: | ⊢ ( (𝜑 ↔ 𝜓) ▶ ((𝜒 ↔ 𝜃)
→ ((𝜑 → 𝜒) ↔ (𝜓 → 𝜃))) )
| qed:12: | ⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ↔ 𝜃)
→ ((𝜑 → 𝜒) ↔ (𝜓 → 𝜃))))
|
(Contributed by Alan Sare, 18-Mar-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ↔ 𝜃) → ((𝜑 → 𝜒) ↔ (𝜓 → 𝜃)))) |
|
Theorem | imbi13VD 44374 |
Join three logical equivalences to form equivalence of implications. The
following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant. imbi13 44020
is imbi13VD 44374 without virtual deductions and was automatically derived
from imbi13VD 44374.
1:: | ⊢ ( (𝜑 ↔ 𝜓) ▶ (𝜑 ↔ 𝜓) )
| 2:: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃)
▶ (𝜒 ↔ 𝜃) )
| 3:: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜏
↔ 𝜂) ▶ (𝜏 ↔ 𝜂) )
| 4:2,3: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜏
↔ 𝜂) ▶ ((𝜒 → 𝜏) ↔ (𝜃 → 𝜂)) )
| 5:1,4: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃) , (𝜏
↔ 𝜂) ▶ ((𝜑 → (𝜒 → 𝜏)) ↔ (𝜓 → (𝜃 → 𝜂))) )
| 6:5: | ⊢ ( (𝜑 ↔ 𝜓) , (𝜒 ↔ 𝜃)
▶ ((𝜏 ↔ 𝜂) → ((𝜑 → (𝜒 → 𝜏)) ↔ (𝜓 → (𝜃
→ 𝜂)))) )
| 7:6: | ⊢ ( (𝜑 ↔ 𝜓) ▶ ((𝜒 ↔ 𝜃)
→ ((𝜏 ↔ 𝜂) → ((𝜑 → (𝜒 → 𝜏)) ↔ (𝜓 → (𝜃
→ 𝜂))))) )
| qed:7: | ⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ↔ 𝜃)
→ ((𝜏 ↔ 𝜂) → ((𝜑 → (𝜒 → 𝜏)) ↔ (𝜓 → (𝜃
→ 𝜂))))))
|
(Contributed by Alan Sare, 18-Mar-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ↔ 𝜓) → ((𝜒 ↔ 𝜃) → ((𝜏 ↔ 𝜂) → ((𝜑 → (𝜒 → 𝜏)) ↔ (𝜓 → (𝜃 → 𝜂)))))) |
|
Theorem | sbcim2gVD 44375 |
Distribution of class substitution over a left-nested implication.
Similar to sbcimg 3822.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
sbcim2g 44038 is sbcim2gVD 44375 without virtual deductions and was automatically
derived from sbcim2gVD 44375.
1:: | ⊢ ( 𝐴 ∈ 𝐵 ▶ 𝐴 ∈ 𝐵 )
| 2:: | ⊢ ( 𝐴 ∈ 𝐵 , [𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒)) ▶ [𝐴 / 𝑥](𝜑 → (𝜓 → 𝜒)) )
| 3:1,2: | ⊢ ( 𝐴 ∈ 𝐵 , [𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒)) ▶ ([𝐴 / 𝑥]𝜑 → [𝐴 / 𝑥](𝜓 → 𝜒)) )
| 4:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜓 → 𝜒)
↔ ([𝐴 / 𝑥]𝜓 → [𝐴 / 𝑥]𝜒)) )
| 5:3,4: | ⊢ ( 𝐴 ∈ 𝐵 , [𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒)) ▶ ([𝐴 / 𝑥]𝜑 → ([𝐴 / 𝑥]𝜓
→ [𝐴 / 𝑥]𝜒)) )
| 6:5: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒)) → ([𝐴 / 𝑥]𝜑 → ([𝐴 / 𝑥]𝜓
→ [𝐴 / 𝑥]𝜒))) )
| 7:: | ⊢ ( 𝐴 ∈ 𝐵 , ([𝐴 / 𝑥]𝜑
→ ([𝐴 / 𝑥]𝜓 → [𝐴 / 𝑥]𝜒)) ▶ ([𝐴 / 𝑥]𝜑
→ ([𝐴 / 𝑥]𝜓 → [𝐴 / 𝑥]𝜒)) )
| 8:4,7: | ⊢ ( 𝐴 ∈ 𝐵 , ([𝐴 / 𝑥]𝜑
→ ([𝐴 / 𝑥]𝜓 → [𝐴 / 𝑥]𝜒)) ▶ ([𝐴 / 𝑥]𝜑
→ [𝐴 / 𝑥](𝜓 → 𝜒)) )
| 9:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒)) ↔ ([𝐴 / 𝑥]𝜑 → [𝐴 / 𝑥](𝜓 → 𝜒))) )
| 10:8,9: | ⊢ ( 𝐴 ∈ 𝐵 , ([𝐴 / 𝑥]𝜑
→ ([𝐴 / 𝑥]𝜓 → [𝐴 / 𝑥]𝜒)) ▶ [𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒)) )
| 11:10: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (([𝐴 / 𝑥]𝜑
→ ([𝐴 / 𝑥]𝜓 → [𝐴 / 𝑥]𝜒)) → [𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒))) )
| 12:6,11: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝜑
→ (𝜓 → 𝜒)) ↔ ([𝐴 / 𝑥]𝜑 → ([𝐴 / 𝑥]𝜓
→ [𝐴 / 𝑥]𝜒))) )
| qed:12: | ⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥](𝜑 → (𝜓
→ 𝜒)) ↔ ([𝐴 / 𝑥]𝜑 → ([𝐴 / 𝑥]𝜓
→ [𝐴 / 𝑥]𝜒))))
|
(Contributed by Alan Sare, 18-Mar-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥](𝜑 → (𝜓 → 𝜒)) ↔ ([𝐴 / 𝑥]𝜑 → ([𝐴 / 𝑥]𝜓 → [𝐴 / 𝑥]𝜒)))) |
|
Theorem | sbcbiVD 44376 |
Implication form of sbcbii 3831.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
sbcbi 44039 is sbcbiVD 44376 without virtual deductions and was automatically
derived from sbcbiVD 44376.
1:: | ⊢ ( 𝐴 ∈ 𝐵 ▶ 𝐴 ∈ 𝐵 )
| 2:: | ⊢ ( 𝐴 ∈ 𝐵 , ∀𝑥(𝜑 ↔ 𝜓)
▶ ∀𝑥(𝜑 ↔ 𝜓) )
| 3:1,2: | ⊢ ( 𝐴 ∈ 𝐵 , ∀𝑥(𝜑 ↔ 𝜓)
▶ [𝐴 / 𝑥](𝜑 ↔ 𝜓) )
| 4:1,3: | ⊢ ( 𝐴 ∈ 𝐵 , ∀𝑥(𝜑 ↔ 𝜓)
▶ ([𝐴 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜓) )
| 5:4: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (∀𝑥(𝜑 ↔ 𝜓)
→ ([𝐴 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜓)) )
| qed:5: | ⊢ (𝐴 ∈ 𝐵 → (∀𝑥(𝜑 ↔ 𝜓)
→ ([𝐴 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜓)))
|
(Contributed by Alan Sare, 18-Mar-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → (∀𝑥(𝜑 ↔ 𝜓) → ([𝐴 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜓))) |
|
Theorem | trsbcVD 44377* |
Formula-building inference rule for class substitution, substituting a
class variable for the setvar variable of the transitivity predicate.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
trsbc 44040 is trsbcVD 44377 without virtual deductions and was automatically
derived from trsbcVD 44377.
1:: | ⊢ ( 𝐴 ∈ 𝐵 ▶ 𝐴 ∈ 𝐵 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝑧 ∈ 𝑦
↔ 𝑧 ∈ 𝑦) )
| 3:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝑥
↔ 𝑦 ∈ 𝐴) )
| 4:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝑧 ∈ 𝑥
↔ 𝑧 ∈ 𝐴) )
| 5:1,2,3,4: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (([𝐴 / 𝑥]𝑧 ∈ 𝑦
→ ([𝐴 / 𝑥]𝑦 ∈ 𝑥 → [𝐴 / 𝑥]𝑧 ∈ 𝑥)) ↔ (𝑧 ∈ 𝑦
→ (𝑦 ∈ 𝐴 → 𝑧 ∈ 𝐴))) )
| 6:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑧 ∈ 𝑦
→ (𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑥)) ↔ ([𝐴 / 𝑥]𝑧 ∈ 𝑦 →
([𝐴 / 𝑥]𝑦 ∈ 𝑥 → [𝐴 / 𝑥]𝑧 ∈ 𝑥))) )
| 7:5,6: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑧 ∈ 𝑦
→ (𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑥)) ↔ (𝑧 ∈ 𝑦 → (𝑦 ∈ 𝐴
→ 𝑧 ∈ 𝐴))) )
| 8:: | ⊢ ((𝑧 ∈ 𝑦 → (𝑦 ∈ 𝐴
→ 𝑧 ∈ 𝐴)) ↔ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴))
| 9:7,8: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑧 ∈ 𝑦
→ (𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑥)) ↔ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)
→ 𝑧 ∈ 𝐴)) )
| 10:: | ⊢ ((𝑧 ∈ 𝑦 → (𝑦 ∈ 𝑥
→ 𝑧 ∈ 𝑥)) ↔ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥))
| 11:10: | ⊢ ∀𝑥((𝑧 ∈ 𝑦 → (𝑦 ∈ 𝑥
→ 𝑧 ∈ 𝑥)) ↔ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥))
| 12:1,11: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑧 ∈ 𝑦
→ (𝑦 ∈ 𝑥 → 𝑧 ∈ 𝑥)) ↔ [𝐴 / 𝑥]((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥)
→ 𝑧 ∈ 𝑥)) )
| 13:9,12: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]((𝑧 ∈ 𝑦
∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)
→ 𝑧 ∈ 𝐴)) )
| 14:13: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ∀𝑦([𝐴 / 𝑥]((𝑧
∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)
→ 𝑧 ∈ 𝐴)) )
| 15:14: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (∀𝑦[𝐴 / 𝑥]((𝑧
∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)
→ 𝑧 ∈ 𝐴)) )
| 16:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]∀𝑦((𝑧
∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ∀𝑦[𝐴 / 𝑥]((𝑧 ∈ 𝑦
∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥)) )
| 17:15,16: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]∀𝑦((𝑧
∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)
→ 𝑧 ∈ 𝐴)) )
| 18:17: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ∀𝑧([𝐴 / 𝑥]∀𝑦((
𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)
→ 𝑧 ∈ 𝐴)) )
| 19:18: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (∀𝑧[𝐴 / 𝑥]∀𝑦((
𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦
∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴)) )
| 20:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]∀𝑧∀𝑦((
𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ∀𝑧[𝐴 / 𝑥]∀𝑦((𝑧
∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥)) )
| 21:19,20: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]∀𝑧∀𝑦((
𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦
∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴)) )
| 22:: | ⊢ (Tr 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦
∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴))
| 23:21,22: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]∀𝑧∀𝑦((
𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥) ↔ Tr 𝐴) )
| 24:: | ⊢ (Tr 𝑥 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦
∈ 𝑥) → 𝑧 ∈ 𝑥))
| 25:24: | ⊢ ∀𝑥(Tr 𝑥 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦
∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥))
| 26:1,25: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]Tr 𝑥
↔ [𝐴 / 𝑥]∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝑥) → 𝑧 ∈ 𝑥)) )
| 27:23,26: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]Tr 𝑥
↔ Tr 𝐴) )
| qed:27: | ⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥]Tr 𝑥
↔ Tr 𝐴))
|
(Contributed by Alan Sare, 18-Mar-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥]Tr 𝑥 ↔ Tr 𝐴)) |
|
Theorem | truniALTVD 44378* |
The union of a class of transitive sets is transitive.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
truniALT 44041 is truniALTVD 44378 without virtual deductions and was
automatically derived from truniALTVD 44378.
1:: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 ▶ ∀𝑥 ∈ 𝐴
Tr 𝑥 )
| 2:: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∪ 𝐴) )
| 3:2: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ 𝑧 ∈ 𝑦 )
| 4:2: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ 𝑦 ∈ ∪ 𝐴 )
| 5:4: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ ∃𝑞(𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) )
| 6:: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴), (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) ▶ (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) )
| 7:6: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴), (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) ▶ 𝑦 ∈ 𝑞 )
| 8:6: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴), (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) ▶ 𝑞 ∈ 𝐴 )
| 9:1,8: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴), (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) ▶ [𝑞 / 𝑥]Tr 𝑥 )
| 10:8,9: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴), (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) ▶ Tr 𝑞 )
| 11:3,7,10: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴), (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) ▶ 𝑧 ∈ 𝑞 )
| 12:11,8: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴), (𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) ▶ 𝑧 ∈ ∪ 𝐴 )
| 13:12: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ ((𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) → 𝑧 ∈ ∪ 𝐴) )
| 14:13: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ ∀𝑞((𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) → 𝑧 ∈ ∪ 𝐴) )
| 15:14: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ (∃𝑞(𝑦 ∈ 𝑞 ∧ 𝑞 ∈ 𝐴) → 𝑧 ∈ ∪ 𝐴) )
| 16:5,15: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) ▶ 𝑧 ∈ ∪ 𝐴 )
| 17:16: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 ▶ ((𝑧 ∈ 𝑦
∧ 𝑦 ∈ ∪ 𝐴) → 𝑧 ∈ ∪ 𝐴) )
| 18:17: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥
▶ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∪ 𝐴) → 𝑧 ∈ ∪ 𝐴) )
| 19:18: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 ▶ Tr ∪ 𝐴 )
| qed:19: | ⊢ (∀𝑥 ∈ 𝐴Tr 𝑥 → Tr ∪ 𝐴)
|
(Contributed by Alan Sare, 18-Mar-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∪
𝐴) |
|
Theorem | ee33VD 44379 |
Non-virtual deduction form of e33 44234.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
ee33 44021 is ee33VD 44379 without virtual deductions and was automatically
derived from ee33VD 44379.
h1:: | ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜃)))
| h2:: | ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜏)))
| h3:: | ⊢ (𝜃 → (𝜏 → 𝜂))
| 4:1,3: | ⊢ (𝜑 → (𝜓 → (𝜒 → (𝜏 → 𝜂))))
| 5:4: | ⊢ (𝜏 → (𝜑 → (𝜓 → (𝜒 → 𝜂))))
| 6:2,5: | ⊢ (𝜑 → (𝜓 → (𝜒 → (𝜑 → (𝜓
→ (𝜒 → 𝜂))))))
| 7:6: | ⊢ (𝜓 → (𝜒 → (𝜑 → (𝜓 → (𝜒
→ 𝜂)))))
| 8:7: | ⊢ (𝜒 → (𝜑 → (𝜓 → (𝜒 → 𝜂))))
| qed:8: | ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜂)))
|
(Contributed by Alan Sare, 18-Mar-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (𝜑 → (𝜓 → (𝜒 → 𝜃))) & ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜏))) & ⊢ (𝜃 → (𝜏 → 𝜂)) ⇒ ⊢ (𝜑 → (𝜓 → (𝜒 → 𝜂))) |
|
Theorem | trintALTVD 44380* |
The intersection of a class of transitive sets is transitive. Virtual
deduction proof of trintALT 44381.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
trintALT 44381 is trintALTVD 44380 without virtual deductions and was
automatically derived from trintALTVD 44380.
1:: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 ▶ ∀𝑥 ∈ 𝐴Tr 𝑥 )
| 2:: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) )
| 3:2: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ 𝑧 ∈ 𝑦 )
| 4:2: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ 𝑦 ∈ ∩ 𝐴 )
| 5:4: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ ∀𝑞 ∈ 𝐴𝑦 ∈ 𝑞 )
| 6:5: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ (𝑞 ∈ 𝐴 → 𝑦 ∈ 𝑞) )
| 7:: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴), 𝑞 ∈ 𝐴 ▶ 𝑞 ∈ 𝐴 )
| 8:7,6: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴), 𝑞 ∈ 𝐴 ▶ 𝑦 ∈ 𝑞 )
| 9:7,1: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴), 𝑞 ∈ 𝐴 ▶ [𝑞 / 𝑥]Tr 𝑥 )
| 10:7,9: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴), 𝑞 ∈ 𝐴 ▶ Tr 𝑞 )
| 11:10,3,8: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴), 𝑞 ∈ 𝐴 ▶ 𝑧 ∈ 𝑞 )
| 12:11: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ (𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞) )
| 13:12: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ ∀𝑞(𝑞 ∈ 𝐴 → 𝑧 ∈ 𝑞) )
| 14:13: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ ∀𝑞 ∈ 𝐴𝑧 ∈ 𝑞 )
| 15:3,14: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 , (𝑧 ∈ 𝑦 ∧ 𝑦 ∈
∩ 𝐴) ▶ 𝑧 ∈ ∩ 𝐴 )
| 16:15: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 ▶ ((𝑧 ∈ 𝑦 ∧ 𝑦
∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴) )
| 17:16: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 ▶ ∀𝑧∀𝑦((𝑧
∈ 𝑦 ∧ 𝑦 ∈ ∩ 𝐴) → 𝑧 ∈ ∩ 𝐴) )
| 18:17: | ⊢ ( ∀𝑥 ∈ 𝐴Tr 𝑥 ▶ Tr ∩ 𝐴 )
| qed:18: | ⊢ (∀𝑥 ∈ 𝐴Tr 𝑥 → Tr ∩ 𝐴)
|
(Contributed by Alan Sare, 17-Apr-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩
𝐴) |
|
Theorem | trintALT 44381* |
The intersection of a class of transitive sets is transitive. Exercise
5(b) of [Enderton] p. 73. trintALT 44381 is an alternate proof of trint 5279.
trintALT 44381 is trintALTVD 44380 without virtual deductions and was
automatically derived from trintALTVD 44380 using the tools program
translate..without..overwriting.cmd and the Metamath program
"MM-PA>
MINIMIZE_WITH *" command. (Contributed by Alan Sare, 17-Apr-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩
𝐴) |
|
Theorem | undif3VD 44382 |
The first equality of Exercise 13 of [TakeutiZaring] p. 22. Virtual
deduction proof of undif3 4286.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
undif3 4286 is undif3VD 44382 without virtual deductions and was automatically
derived from undif3VD 44382.
1:: | ⊢ (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ 𝐴
∨ 𝑥 ∈ (𝐵 ∖ 𝐶)))
| 2:: | ⊢ (𝑥 ∈ (𝐵 ∖ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈
𝐶))
| 3:2: | ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)) ↔ (𝑥
∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 4:1,3: | ⊢ (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ 𝐴
∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 5:: | ⊢ ( 𝑥 ∈ 𝐴 ▶ 𝑥 ∈ 𝐴 )
| 6:5: | ⊢ ( 𝑥 ∈ 𝐴 ▶ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) )
| 7:5: | ⊢ ( 𝑥 ∈ 𝐴 ▶ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴) )
| 8:6,7: | ⊢ ( 𝑥 ∈ 𝐴 ▶ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧
(¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)) )
| 9:8: | ⊢ (𝑥 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (
¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)))
| 10:: | ⊢ ( (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ▶ (𝑥 ∈ 𝐵
∧ ¬ 𝑥 ∈ 𝐶) )
| 11:10: | ⊢ ( (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ▶ 𝑥 ∈ 𝐵 )
| 12:10: | ⊢ ( (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ▶ ¬ 𝑥 ∈ 𝐶
)
| 13:11: | ⊢ ( (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ▶ (𝑥 ∈ 𝐴
∨ 𝑥 ∈ 𝐵) )
| 14:12: | ⊢ ( (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ▶ (¬ 𝑥 ∈
𝐶 ∨ 𝑥 ∈ 𝐴) )
| 15:13,14: | ⊢ ( (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ▶ ((𝑥 ∈
𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)) )
| 16:15: | ⊢ ((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴
∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)))
| 17:9,16: | ⊢ ((𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶))
→ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)))
| 18:: | ⊢ ( (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) ▶ (𝑥 ∈ 𝐴
∧ ¬ 𝑥 ∈ 𝐶) )
| 19:18: | ⊢ ( (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) ▶ 𝑥 ∈ 𝐴 )
| 20:18: | ⊢ ( (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) ▶ ¬ 𝑥 ∈ 𝐶
)
| 21:18: | ⊢ ( (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) ▶ (𝑥 ∈ 𝐴
∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)) )
| 22:21: | ⊢ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 ∨
(𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 23:: | ⊢ ( (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ▶ (𝑥 ∈ 𝐴 ∧
𝑥 ∈ 𝐴) )
| 24:23: | ⊢ ( (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ▶ 𝑥 ∈ 𝐴 )
| 25:24: | ⊢ ( (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ▶ (𝑥 ∈ 𝐴 ∨
(𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)) )
| 26:25: | ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐴 ∨ (
𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 27:10: | ⊢ ( (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ▶ (𝑥 ∈ 𝐴
∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)) )
| 28:27: | ⊢ ((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 ∨
(𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 29:: | ⊢ ( (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ▶ (𝑥 ∈ 𝐵 ∧
𝑥 ∈ 𝐴) )
| 30:29: | ⊢ ( (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ▶ 𝑥 ∈ 𝐴 )
| 31:30: | ⊢ ( (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) ▶ (𝑥 ∈ 𝐴 ∨
(𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)) )
| 32:31: | ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐴 ∨ (
𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 33:22,26: | ⊢ (((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) ∨ (𝑥 ∈ 𝐴
∧ 𝑥 ∈ 𝐴)) → (𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 34:28,32: | ⊢ (((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵
∧ 𝑥 ∈ 𝐴)) → (𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 35:33,34: | ⊢ ((((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) ∨ (𝑥 ∈
𝐴 ∧ 𝑥 ∈ 𝐴)) ∨ ((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴)))
→ (𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 36:: | ⊢ ((((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐶) ∨ (𝑥 ∈
𝐴 ∧ 𝑥 ∈ 𝐴)) ∨ ((𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶) ∨ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴)))
↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)))
| 37:36,35: | ⊢ (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶
∨ 𝑥 ∈ 𝐴)) → (𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
| 38:17,37: | ⊢ ((𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶))
↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)))
| 39:: | ⊢ (𝑥 ∈ (𝐶 ∖ 𝐴) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈
𝐴))
| 40:39: | ⊢ (¬ 𝑥 ∈ (𝐶 ∖ 𝐴) ↔ ¬ (𝑥 ∈ 𝐶 ∧
¬ 𝑥 ∈ 𝐴))
| 41:: | ⊢ (¬ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐴) ↔ (¬ 𝑥
∈ 𝐶 ∨ 𝑥 ∈ 𝐴))
| 42:40,41: | ⊢ (¬ 𝑥 ∈ (𝐶 ∖ 𝐴) ↔ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥
∈ 𝐴))
| 43:: | ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵
))
| 44:43,42: | ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ (𝐶 ∖ 𝐴)
) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∧ 𝑥 ∈ 𝐴)))
| 45:: | ⊢ (𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ (𝐶 ∖ 𝐴)) ↔ (
𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ (𝐶 ∖ 𝐴)))
| 46:45,44: | ⊢ (𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ (𝐶 ∖ 𝐴)) ↔ (
(𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)))
| 47:4,38: | ⊢ (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ ((𝑥 ∈ 𝐴
∨ 𝑥 ∈ 𝐵) ∧ (¬ 𝑥 ∈ 𝐶 ∨ 𝑥 ∈ 𝐴)))
| 48:46,47: | ⊢ (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈ ((𝐴
∪ 𝐵) ∖ (𝐶 ∖ 𝐴)))
| 49:48: | ⊢ ∀𝑥(𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈
((𝐴 ∪ 𝐵) ∖ (𝐶 ∖ 𝐴)))
| qed:49: | ⊢ (𝐴 ∪ (𝐵 ∖ 𝐶)) = ((𝐴 ∪ 𝐵) ∖ (𝐶
∖ 𝐴))
|
(Contributed by Alan Sare, 17-Apr-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∪ (𝐵 ∖ 𝐶)) = ((𝐴 ∪ 𝐵) ∖ (𝐶 ∖ 𝐴)) |
|
Theorem | sbcssgVD 44383 |
Virtual deduction proof of sbcssg 4520.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
sbcssg 4520 is sbcssgVD 44383 without virtual deductions and was automatically
derived from sbcssgVD 44383.
1:: | ⊢ ( 𝐴 ∈ 𝐵 ▶ 𝐴 ∈ 𝐵 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔ 𝑦
∈ ⦋𝐴 / 𝑥⦌𝐶) )
| 3:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝐷 ↔ 𝑦
∈ ⦋𝐴 / 𝑥⦌𝐷) )
| 4:2,3: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (([𝐴 / 𝑥]𝑦 ∈ 𝐶 →
[𝐴 / 𝑥]𝑦 ∈ 𝐷) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 → 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷
)) )
| 5:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑦 ∈ 𝐶 →
𝑦 ∈ 𝐷) ↔ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 → [𝐴 / 𝑥]𝑦 ∈ 𝐷)) )
| 6:4,5: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑦 ∈ 𝐶 →
𝑦 ∈ 𝐷) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 → 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)) )
| 7:6: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ∀𝑦([𝐴 / 𝑥](𝑦 ∈
𝐶 → 𝑦 ∈ 𝐷) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 → 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)) )
| 8:7: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (∀𝑦[𝐴 / 𝑥](𝑦 ∈
𝐶 → 𝑦 ∈ 𝐷) ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 → 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)
) )
| 9:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]∀𝑦(𝑦 ∈
𝐶 → 𝑦 ∈ 𝐷) ↔ ∀𝑦[𝐴 / 𝑥](𝑦 ∈ 𝐶 → 𝑦 ∈ 𝐷)) )
| 10:8,9: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]∀𝑦(𝑦 ∈
𝐶 → 𝑦 ∈ 𝐷) ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 → 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)
) )
| 11:: | ⊢ (𝐶 ⊆ 𝐷 ↔ ∀𝑦(𝑦 ∈ 𝐶 → 𝑦 ∈ 𝐷))
| 110:11: | ⊢ ∀𝑥(𝐶 ⊆ 𝐷 ↔ ∀𝑦(𝑦 ∈ 𝐶 → 𝑦 ∈
𝐷))
| 12:1,110: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝐶 ⊆ 𝐷 ↔
[𝐴 / 𝑥]∀𝑦(𝑦 ∈ 𝐶 → 𝑦 ∈ 𝐷)) )
| 13:10,12: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝐶 ⊆ 𝐷 ↔
∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 → 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)) )
| 14:: | ⊢ (⦋𝐴 / 𝑥⦌𝐶 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ↔ ∀
𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 → 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷))
| 15:13,14: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝐶 ⊆ 𝐷 ↔
⦋𝐴 / 𝑥⦌𝐶 ⊆ ⦋𝐴 / 𝑥⦌𝐷) )
| qed:15: | ⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥]𝐶 ⊆ 𝐷 ↔ ⦋
𝐴 / 𝑥⦌𝐶 ⊆ ⦋𝐴 / 𝑥⦌𝐷))
|
(Contributed by Alan Sare, 22-Jul-2012.)
(Proof modification is discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥]𝐶 ⊆ 𝐷 ↔ ⦋𝐴 / 𝑥⦌𝐶 ⊆ ⦋𝐴 / 𝑥⦌𝐷)) |
|
Theorem | csbingVD 44384 |
Virtual deduction proof of csbin 4436.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbin 4436 is csbingVD 44384 without virtual deductions and was
automatically derived from csbingVD 44384.
1:: | ⊢ ( 𝐴 ∈ 𝐵 ▶ 𝐴 ∈ 𝐵 )
| 2:: | ⊢ (𝐶 ∩ 𝐷) = {𝑦 ∣ (𝑦 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)
}
| 20:2: | ⊢ ∀𝑥(𝐶 ∩ 𝐷) = {𝑦 ∣ (𝑦 ∈ 𝐶 ∧ 𝑦
∈ 𝐷)}
| 30:1,20: | ⊢ ( 𝐴 ∈ 𝐵 ▶ [𝐴 / 𝑥](𝐶 ∩ 𝐷) =
{𝑦 ∣ (𝑦 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)} )
| 3:1,30: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ⦋𝐴 / 𝑥⦌(𝐶 ∩ 𝐷) =
⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑦 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)} )
| 4:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝑦 ∈ 𝐶
∧ 𝑦 ∈ 𝐷)} = {𝑦 ∣ [𝐴 / 𝑥](𝑦 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)} )
| 5:3,4: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ⦋𝐴 / 𝑥⦌(𝐶 ∩ 𝐷) =
{𝑦 ∣ [𝐴 / 𝑥](𝑦 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)} )
| 6:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔ 𝑦
∈ ⦋𝐴 / 𝑥⦌𝐶) )
| 7:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝐷 ↔ 𝑦
∈ ⦋𝐴 / 𝑥⦌𝐷) )
| 8:6,7: | ⊢ ( 𝐴 ∈ 𝐵 ▶ (([𝐴 / 𝑥]𝑦 ∈ 𝐶 ∧
[𝐴 / 𝑥]𝑦 ∈ 𝐷) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷
)) )
| 9:1: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑦 ∈ 𝐶 ∧
𝑦 ∈ 𝐷) ↔ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ∧ [𝐴 / 𝑥]𝑦 ∈ 𝐷)) )
| 10:9,8: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ([𝐴 / 𝑥](𝑦 ∈ 𝐶 ∧
𝑦 ∈ 𝐷) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)) )
| 11:10: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ∀𝑦([𝐴 / 𝑥](𝑦 ∈
𝐶 ∧ 𝑦 ∈ 𝐷) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)) )
| 12:11: | ⊢ ( 𝐴 ∈ 𝐵 ▶ {𝑦 ∣ [𝐴 / 𝑥](𝑦 ∈ 𝐶
∧ 𝑦 ∈ 𝐷)} = {𝑦 ∣ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)} )
| 13:5,12: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ⦋𝐴 / 𝑥⦌(𝐶 ∩ 𝐷) =
{𝑦 ∣ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)} )
| 14:: | ⊢ (⦋𝐴 / 𝑥⦌𝐶 ∩ ⦋𝐴 / 𝑥⦌𝐷) = {
𝑦 ∣ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐷)}
| 15:13,14: | ⊢ ( 𝐴 ∈ 𝐵 ▶ ⦋𝐴 / 𝑥⦌(𝐶 ∩ 𝐷) =
(⦋𝐴 / 𝑥⦌𝐶 ∩ ⦋𝐴 / 𝑥⦌𝐷) )
| qed:15: | ⊢ (𝐴 ∈ 𝐵 → ⦋𝐴 / 𝑥⦌(𝐶 ∩ 𝐷) = (
⦋𝐴 / 𝑥⦌𝐶 ∩ ⦋𝐴 / 𝑥⦌𝐷))
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐵 → ⦋𝐴 / 𝑥⦌(𝐶 ∩ 𝐷) = (⦋𝐴 / 𝑥⦌𝐶 ∩ ⦋𝐴 / 𝑥⦌𝐷)) |
|
Theorem | onfrALTlem5VD 44385* |
Virtual deduction proof of onfrALTlem5 44042.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
onfrALTlem5 44042 is onfrALTlem5VD 44385 without virtual deductions and was
automatically derived from onfrALTlem5VD 44385.
1:: | ⊢ 𝑎 ∈ V
| 2:1: | ⊢ (𝑎 ∩ 𝑥) ∈ V
| 3:2: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]𝑏 = ∅ ↔ (𝑎
∩ 𝑥) = ∅)
| 4:3: | ⊢ (¬ [(𝑎 ∩ 𝑥) / 𝑏]𝑏 = ∅ ↔
¬ (𝑎 ∩ 𝑥) = ∅)
| 5:: | ⊢ ((𝑎 ∩ 𝑥) ≠ ∅ ↔ ¬ (𝑎 ∩ 𝑥
) = ∅)
| 6:4,5: | ⊢ (¬ [(𝑎 ∩ 𝑥) / 𝑏]𝑏 = ∅ ↔
(𝑎 ∩ 𝑥) ≠ ∅)
| 7:2: | ⊢ (¬ [(𝑎 ∩ 𝑥) / 𝑏]𝑏 = ∅ ↔
[(𝑎 ∩ 𝑥) / 𝑏]¬ 𝑏 = ∅)
| 8:: | ⊢ (𝑏 ≠ ∅ ↔ ¬ 𝑏 = ∅)
| 9:8: | ⊢ ∀𝑏(𝑏 ≠ ∅ ↔ ¬ 𝑏 = ∅)
| 10:2,9: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]𝑏 ≠ ∅ ↔
[(𝑎 ∩ 𝑥) / 𝑏]¬ 𝑏 = ∅)
| 11:7,10: | ⊢ (¬ [(𝑎 ∩ 𝑥) / 𝑏]𝑏 = ∅ ↔
[(𝑎 ∩ 𝑥) / 𝑏]𝑏 ≠ ∅)
| 12:6,11: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]𝑏 ≠ ∅ ↔ (
𝑎 ∩ 𝑥) ≠ ∅)
| 13:2: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]𝑏 ⊆ (𝑎 ∩ 𝑥
) ↔ (𝑎 ∩ 𝑥) ⊆ (𝑎 ∩ 𝑥))
| 14:12,13: | ⊢ (([(𝑎 ∩ 𝑥) / 𝑏]𝑏 ⊆ (𝑎 ∩
𝑥) ∧ [(𝑎 ∩ 𝑥) / 𝑏]𝑏 ≠ ∅) ↔ ((𝑎 ∩ 𝑥) ⊆ (𝑎
∩ 𝑥) ∧ (𝑎 ∩ 𝑥) ≠ ∅))
| 15:2: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏](𝑏 ⊆ (𝑎 ∩
𝑥) ∧ 𝑏 ≠ ∅) ↔ ([(𝑎 ∩ 𝑥) / 𝑏]𝑏 ⊆ (𝑎 ∩ 𝑥) ∧
[(𝑎 ∩ 𝑥) / 𝑏]𝑏 ≠ ∅))
| 16:15,14: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏](𝑏 ⊆ (𝑎 ∩
𝑥) ∧ 𝑏 ≠ ∅) ↔ ((𝑎 ∩ 𝑥) ⊆ (𝑎 ∩ 𝑥) ∧ (𝑎 ∩ 𝑥)
≠ ∅))
| 17:2: | ⊢ ⦋(𝑎 ∩ 𝑥) / 𝑏⦌(𝑏 ∩ 𝑦) = (
⦋(𝑎 ∩ 𝑥) / 𝑏⦌𝑏 ∩ ⦋(𝑎 ∩ 𝑥) / 𝑏⦌𝑦)
| 18:2: | ⊢ ⦋(𝑎 ∩ 𝑥) / 𝑏⦌𝑏 = (𝑎 ∩ 𝑥)
| 19:2: | ⊢ ⦋(𝑎 ∩ 𝑥) / 𝑏⦌𝑦 = 𝑦
| 20:18,19: | ⊢ (⦋(𝑎 ∩ 𝑥) / 𝑏⦌𝑏 ∩ ⦋(𝑎
∩ 𝑥) / 𝑏⦌𝑦) = ((𝑎 ∩ 𝑥) ∩ 𝑦)
| 21:17,20: | ⊢ ⦋(𝑎 ∩ 𝑥) / 𝑏⦌(𝑏 ∩ 𝑦) = ((
𝑎 ∩ 𝑥) ∩ 𝑦)
| 22:2: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏](𝑏 ∩ 𝑦) =
∅ ↔ ⦋(𝑎 ∩ 𝑥) / 𝑏⦌(𝑏 ∩ 𝑦) = ⦋(𝑎 ∩ 𝑥) / 𝑏⦌
∅)
| 23:2: | ⊢ ⦋(𝑎 ∩ 𝑥) / 𝑏⦌∅ = ∅
| 24:21,23: | ⊢ (⦋(𝑎 ∩ 𝑥) / 𝑏⦌(𝑏 ∩ 𝑦) =
⦋(𝑎 ∩ 𝑥) / 𝑏⦌∅ ↔ ((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅)
| 25:22,24: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏](𝑏 ∩ 𝑦) =
∅ ↔ ((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅)
| 26:2: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]𝑦 ∈ 𝑏 ↔ 𝑦 ∈
(𝑎 ∩ 𝑥))
| 27:25,26: | ⊢ (([(𝑎 ∩ 𝑥) / 𝑏]𝑦 ∈ 𝑏 ∧ [
(𝑎 ∩ 𝑥) / 𝑏](𝑏 ∩ 𝑦) = ∅) ↔ (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((
𝑎 ∩ 𝑥) ∩ 𝑦) = ∅))
| 28:2: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏](𝑦 ∈ 𝑏 ∧ (𝑏
∩ 𝑦) = ∅) ↔ ([(𝑎 ∩ 𝑥) / 𝑏]𝑦 ∈ 𝑏 ∧ [(𝑎 ∩ 𝑥)
/ 𝑏](𝑏 ∩ 𝑦) = ∅))
| 29:27,28: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏](𝑦 ∈ 𝑏 ∧ (𝑏
∩ 𝑦) = ∅) ↔ (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦) =
∅))
| 30:29: | ⊢ ∀𝑦([(𝑎 ∩ 𝑥) / 𝑏](𝑦 ∈ 𝑏
∧ (𝑏 ∩ 𝑦) = ∅) ↔ (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅))
| 31:30: | ⊢ (∃𝑦[(𝑎 ∩ 𝑥) / 𝑏](𝑦 ∈ 𝑏
∧ (𝑏 ∩ 𝑦) = ∅) ↔ ∃𝑦(𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥)
∩ 𝑦) = ∅))
| 32:: | ⊢ (∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩
𝑦) = ∅ ↔ ∃𝑦(𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅
))
| 33:31,32: | ⊢ (∃𝑦[(𝑎 ∩ 𝑥) / 𝑏](𝑦 ∈ 𝑏
∧ (𝑏 ∩ 𝑦) = ∅) ↔ ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦)
= ∅)
| 34:2: | ⊢ (∃𝑦[(𝑎 ∩ 𝑥) / 𝑏](𝑦 ∈ 𝑏
∧ (𝑏 ∩ 𝑦) = ∅) ↔ [(𝑎 ∩ 𝑥) / 𝑏]∃𝑦(𝑦 ∈ 𝑏 ∧ (
𝑏 ∩ 𝑦) = ∅))
| 35:33,34: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]∃𝑦(𝑦 ∈ 𝑏
∧ (𝑏 ∩ 𝑦) = ∅) ↔ ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅)
| 36:: | ⊢ (∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅ ↔ ∃𝑦
(𝑦 ∈ 𝑏 ∧ (𝑏 ∩ 𝑦) = ∅))
| 37:36: | ⊢ ∀𝑏(∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅ ↔
∃𝑦(𝑦 ∈ 𝑏 ∧ (𝑏 ∩ 𝑦) = ∅))
| 38:2,37: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]∃𝑦 ∈ 𝑏(𝑏
∩ 𝑦) = ∅ ↔ [(𝑎 ∩ 𝑥) / 𝑏]∃𝑦(𝑦 ∈ 𝑏 ∧ (𝑏 ∩ 𝑦)
= ∅))
| 39:35,38: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]∃𝑦 ∈ 𝑏(𝑏
∩ 𝑦) = ∅ ↔ ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅)
| 40:16,39: | ⊢ (([(𝑎 ∩ 𝑥) / 𝑏](𝑏 ⊆ (𝑎
∩ 𝑥) ∧ 𝑏 ≠ ∅) → [(𝑎 ∩ 𝑥) / 𝑏]∃𝑦 ∈ 𝑏(𝑏 ∩
𝑦) = ∅) ↔ (((𝑎 ∩ 𝑥) ⊆ (𝑎 ∩ 𝑥) ∧ (𝑎 ∩ 𝑥) ≠
∅) → ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅))
| 41:2: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]((𝑏 ⊆ (𝑎
∩ 𝑥) ∧ 𝑏 ≠ ∅) → ∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅) ↔ ([(𝑎
∩ 𝑥) / 𝑏](𝑏 ⊆ (𝑎 ∩ 𝑥) ∧ 𝑏 ≠ ∅) → [(𝑎 ∩ 𝑥) /
𝑏]∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅))
| qed:40,41: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]((𝑏 ⊆ (𝑎
∩ 𝑥) ∧ 𝑏 ≠ ∅) → ∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅) ↔ (((𝑎
∩ 𝑥) ⊆ (𝑎 ∩ 𝑥) ∧ (𝑎 ∩ 𝑥) ≠ ∅) → ∃𝑦 ∈ (𝑎 ∩ 𝑥
)((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅))
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢
([(𝑎 ∩
𝑥) / 𝑏]((𝑏 ⊆ (𝑎 ∩ 𝑥) ∧ 𝑏 ≠ ∅) → ∃𝑦 ∈ 𝑏 (𝑏 ∩ 𝑦) = ∅) ↔ (((𝑎 ∩ 𝑥) ⊆ (𝑎 ∩ 𝑥) ∧ (𝑎 ∩ 𝑥) ≠ ∅) → ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅)) |
|
Theorem | onfrALTlem4VD 44386* |
Virtual deduction proof of onfrALTlem4 44043.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
onfrALTlem4 44043 is onfrALTlem4VD 44386 without virtual deductions and was
automatically derived from onfrALTlem4VD 44386.
1:: | ⊢ 𝑦 ∈ V
| 2:1: | ⊢ ([𝑦 / 𝑥](𝑎 ∩ 𝑥) = ∅ ↔ ⦋
𝑦 / 𝑥⦌(𝑎 ∩ 𝑥) = ⦋𝑦 / 𝑥⦌∅)
| 3:1: | ⊢ ⦋𝑦 / 𝑥⦌(𝑎 ∩ 𝑥) = (⦋𝑦 / 𝑥⦌
𝑎 ∩ ⦋𝑦 / 𝑥⦌𝑥)
| 4:1: | ⊢ ⦋𝑦 / 𝑥⦌𝑎 = 𝑎
| 5:1: | ⊢ ⦋𝑦 / 𝑥⦌𝑥 = 𝑦
| 6:4,5: | ⊢ (⦋𝑦 / 𝑥⦌𝑎 ∩ ⦋𝑦 / 𝑥⦌𝑥) = (
𝑎 ∩ 𝑦)
| 7:3,6: | ⊢ ⦋𝑦 / 𝑥⦌(𝑎 ∩ 𝑥) = (𝑎 ∩ 𝑦)
| 8:1: | ⊢ ⦋𝑦 / 𝑥⦌∅ = ∅
| 9:7,8: | ⊢ (⦋𝑦 / 𝑥⦌(𝑎 ∩ 𝑥) = ⦋𝑦 / 𝑥⦌
∅ ↔ (𝑎 ∩ 𝑦) = ∅)
| 10:2,9: | ⊢ ([𝑦 / 𝑥](𝑎 ∩ 𝑥) = ∅ ↔ (𝑎
∩ 𝑦) = ∅)
| 11:1: | ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝑎 ↔ 𝑦 ∈ 𝑎)
| 12:11,10: | ⊢ (([𝑦 / 𝑥]𝑥 ∈ 𝑎 ∧ [𝑦 / 𝑥](
𝑎 ∩ 𝑥) = ∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅))
| 13:1: | ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) =
∅) ↔ ([𝑦 / 𝑥]𝑥 ∈ 𝑎 ∧ [𝑦 / 𝑥](𝑎 ∩ 𝑥) = ∅))
| qed:13,12: | ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) =
∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅))
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) |
|
Theorem | onfrALTlem3VD 44387* |
Virtual deduction proof of onfrALTlem3 44044.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
onfrALTlem3 44044 is onfrALTlem3VD 44387 without virtual deductions and was
automatically derived from onfrALTlem3VD 44387.
1:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ (𝑎
⊆ On ∧ 𝑎 ≠ ∅) )
| 2:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ (𝑥 ∈ 𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) )
| 3:2: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ 𝑥 ∈ 𝑎 )
| 4:1: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ 𝑎 ⊆
On )
| 5:3,4: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ 𝑥 ∈ On )
| 6:5: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ Ord 𝑥 )
| 7:6: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ E We 𝑥 )
| 8:: | ⊢ (𝑎 ∩ 𝑥) ⊆ 𝑥
| 9:7,8: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ E We (𝑎 ∩ 𝑥) )
| 10:9: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ E Fr (𝑎 ∩ 𝑥) )
| 11:10: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∀𝑏((𝑏 ⊆ (𝑎 ∩ 𝑥) ∧ 𝑏 ≠
∅) → ∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅) )
| 12:: | ⊢ 𝑥 ∈ V
| 13:12,8: | ⊢ (𝑎 ∩ 𝑥) ∈ V
| 14:13,11: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ [(𝑎 ∩ 𝑥) / 𝑏]((𝑏 ⊆ (𝑎
∩ 𝑥) ∧ 𝑏 ≠ ∅) → ∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅) )
| 15:: | ⊢ ([(𝑎 ∩ 𝑥) / 𝑏]((𝑏 ⊆ (𝑎
∩ 𝑥) ∧ 𝑏 ≠ ∅) → ∃𝑦 ∈ 𝑏(𝑏 ∩ 𝑦) = ∅) ↔ (((𝑎 ∩
𝑥) ⊆ (𝑎 ∩ 𝑥) ∧ (𝑎 ∩ 𝑥) ≠ ∅) → ∃𝑦 ∈ (𝑎 ∩ 𝑥)(
(𝑎 ∩ 𝑥) ∩ 𝑦) = ∅))
| 16:14,15: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ (((𝑎 ∩ 𝑥) ⊆ (𝑎 ∩ 𝑥) ∧ (
𝑎 ∩ 𝑥) ≠ ∅) → ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦) =
∅) )
| 17:: | ⊢ (𝑎 ∩ 𝑥) ⊆ (𝑎 ∩ 𝑥)
| 18:2: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ¬ (𝑎 ∩ 𝑥) = ∅ )
| 19:18: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ (𝑎 ∩ 𝑥) ≠ ∅ )
| 20:17,19: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ((𝑎 ∩ 𝑥) ⊆ (𝑎 ∩ 𝑥) ∧ (𝑎 ∩
𝑥) ≠ ∅) )
| qed:16,20: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅ )
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅ ) |
|
Theorem | simplbi2comtVD 44388 |
Virtual deduction proof of simplbi2comt 500.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
simplbi2comt 500 is simplbi2comtVD 44388 without virtual deductions and was
automatically derived from simplbi2comtVD 44388.
1:: | ⊢ ( (𝜑 ↔ (𝜓 ∧ 𝜒)) ▶ (𝜑 ↔ (
𝜓 ∧ 𝜒)) )
| 2:1: | ⊢ ( (𝜑 ↔ (𝜓 ∧ 𝜒)) ▶ ((𝜓 ∧ 𝜒
) → 𝜑) )
| 3:2: | ⊢ ( (𝜑 ↔ (𝜓 ∧ 𝜒)) ▶ (𝜓 → (𝜒
→ 𝜑)) )
| 4:3: | ⊢ ( (𝜑 ↔ (𝜓 ∧ 𝜒)) ▶ (𝜒 → (𝜓
→ 𝜑)) )
| qed:4: | ⊢ ((𝜑 ↔ (𝜓 ∧ 𝜒)) → (𝜒 → (𝜓
→ 𝜑)))
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ↔ (𝜓 ∧ 𝜒)) → (𝜒 → (𝜓 → 𝜑))) |
|
Theorem | onfrALTlem2VD 44389* |
Virtual deduction proof of onfrALTlem2 44046.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
onfrALTlem2 44046 is onfrALTlem2VD 44389 without virtual deductions and was
automatically derived from onfrALTlem2VD 44389.
1:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩
𝑥) ∩ 𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) )
| 2:1: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑧 ∈ (𝑎 ∩ 𝑦) )
| 3:2: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑧 ∈ 𝑎 )
| 4:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ (𝑎
⊆ On ∧ 𝑎 ≠ ∅) )
| 5:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ (𝑥 ∈ 𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) )
| 6:5: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ 𝑥 ∈ 𝑎 )
| 7:4: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ 𝑎 ⊆
On )
| 8:6,7: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ 𝑥 ∈ On )
| 9:8: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ Ord 𝑥 )
| 10:9: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ Tr 𝑥 )
| 11:1: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑦 ∈ (𝑎 ∩ 𝑥) )
| 12:11: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑦 ∈ 𝑥 )
| 13:2: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑧 ∈ 𝑦 )
| 14:10,12,13: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑧 ∈ 𝑥 )
| 15:3,14: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑧 ∈ (𝑎 ∩ 𝑥) )
| 16:13,15: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩
𝑦) = ∅) ∧ 𝑧 ∈ (𝑎 ∩ 𝑦)) ▶ 𝑧 ∈ ((𝑎 ∩ 𝑥) ∩ 𝑦) )
| 17:16: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ (𝑧 ∈ (𝑎 ∩ 𝑦) → 𝑧 ∈ ((𝑎 ∩ 𝑥) ∩ 𝑦)) )
| 18:17: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ ∀𝑧(𝑧 ∈ (𝑎 ∩ 𝑦) → 𝑧 ∈ ((𝑎 ∩ 𝑥) ∩ 𝑦)) )
| 19:18: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ (𝑎 ∩ 𝑦) ⊆ ((𝑎 ∩ 𝑥) ∩ 𝑦) )
| 20:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅) )
| 21:20: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ ((𝑎 ∩ 𝑥) ∩ 𝑦) = ∅ )
| 22:19,21: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ (𝑎 ∩ 𝑦) = ∅ )
| 23:20: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ 𝑦 ∈ (𝑎 ∩ 𝑥) )
| 24:23: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ 𝑦 ∈ 𝑎 )
| 25:22,24: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅), (𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅) ▶ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅) )
| 26:25: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥)
∩ 𝑦) = ∅) → (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) )
| 27:26: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∀𝑦((𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥
) ∩ 𝑦) = ∅) → (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) )
| 28:27: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ (∃𝑦(𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥
) ∩ 𝑦) = ∅) → ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅)) )
| 29:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ (𝑎 ∩ 𝑥)((𝑎 ∩ 𝑥) ∩ 𝑦
) = ∅ )
| 30:29: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦(𝑦 ∈ (𝑎 ∩ 𝑥) ∧ ((𝑎 ∩ 𝑥)
∩ 𝑦) = ∅) )
| 31:28,30: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅) )
| qed:31: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈
𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅ )
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅ ) |
|
Theorem | onfrALTlem1VD 44390* |
Virtual deduction proof of onfrALTlem1 44048.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
onfrALTlem1 44048 is onfrALTlem1VD 44390 without virtual deductions and was
automatically derived from onfrALTlem1VD 44390.
1:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧
(𝑎 ∩ 𝑥) = ∅) ▶ (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) )
| 2:1: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧
(𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑥(𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) )
| 3:2: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧
(𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦[𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅)
)
| 4:: | ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅
) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅))
| 5:4: | ⊢ ∀𝑦([𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥)
= ∅) ↔ (𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅))
| 6:5: | ⊢ (∃𝑦[𝑦 / 𝑥](𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥)
= ∅) ↔ ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅))
| 7:3,6: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧
(𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦(𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅) )
| 8:: | ⊢ (∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅ ↔ ∃𝑦(
𝑦 ∈ 𝑎 ∧ (𝑎 ∩ 𝑦) = ∅))
| qed:7,8: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧
(𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅ )
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎 ∧ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎 (𝑎 ∩ 𝑦) = ∅ ) |
|
Theorem | onfrALTVD 44391 |
Virtual deduction proof of onfrALT 44049.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
onfrALT 44049 is onfrALTVD 44391 without virtual deductions and was
automatically derived from onfrALTVD 44391.
1:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎
∧ ¬ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅ )
| 2:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , (𝑥 ∈ 𝑎
∧ (𝑎 ∩ 𝑥) = ∅) ▶ ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅ )
| 3:1: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , 𝑥 ∈ 𝑎 ▶
(¬ (𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅) )
| 4:2: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , 𝑥 ∈ 𝑎 ▶
((𝑎 ∩ 𝑥) = ∅ → ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅) )
| 5:: | ⊢ ((𝑎 ∩ 𝑥) = ∅ ∨ ¬ (𝑎 ∩ 𝑥) =
∅)
| 6:5,4,3: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) , 𝑥 ∈ 𝑎 ▶
∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅ )
| 7:6: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ (𝑥 ∈ 𝑎
→ ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅) )
| 8:7: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ ∀𝑥(𝑥
∈ 𝑎 → ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅) )
| 9:8: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ (∃𝑥𝑥
∈ 𝑎 → ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅) )
| 10:: | ⊢ (𝑎 ≠ ∅ ↔ ∃𝑥𝑥 ∈ 𝑎)
| 11:9,10: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ (𝑎 ≠
∅ → ∃𝑦 ∈ 𝑎(𝑎 ∩ 𝑦) = ∅) )
| 12:: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ (𝑎 ⊆
On ∧ 𝑎 ≠ ∅) )
| 13:12: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ 𝑎 ≠
∅ )
| 14:13,11: | ⊢ ( (𝑎 ⊆ On ∧ 𝑎 ≠ ∅) ▶ ∃𝑦 ∈
𝑎(𝑎 ∩ 𝑦) = ∅ )
| 15:14: | ⊢ ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦 ∈ 𝑎
(𝑎 ∩ 𝑦) = ∅)
| 16:15: | ⊢ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦
∈ 𝑎(𝑎 ∩ 𝑦) = ∅)
| qed:16: | ⊢ E Fr On
|
(Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ E Fr
On |
|
Theorem | csbeq2gVD 44392 |
Virtual deduction proof of csbeq2 3891.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbeq2 3891 is csbeq2gVD 44392 without virtual deductions and was
automatically derived from csbeq2gVD 44392.
1:: | ⊢ ( 𝐴 ∈ 𝑉 ▶ 𝐴 ∈ 𝑉 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (∀𝑥𝐵 = 𝐶 → [𝐴 / 𝑥]
𝐵 = 𝐶) )
| 3:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ⦋𝐴
/ 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶) )
| 4:2,3: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (∀𝑥𝐵 = 𝐶 → ⦋𝐴 / 𝑥
⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶) )
| qed:4: | ⊢ (𝐴 ∈ 𝑉 → (∀𝑥𝐵 = 𝐶 → ⦋𝐴 / 𝑥⦌
𝐵 = ⦋𝐴 / 𝑥⦌𝐶))
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝑉 → (∀𝑥 𝐵 = 𝐶 → ⦋𝐴 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶)) |
|
Theorem | csbsngVD 44393 |
Virtual deduction proof of csbsng 4709.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbsng 4709 is csbsngVD 44393 without virtual deductions and was automatically
derived from csbsngVD 44393.
1:: | ⊢ ( 𝐴 ∈ 𝑉 ▶ 𝐴 ∈ 𝑉 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑦 = 𝐵
↔ ⦋𝐴 / 𝑥⦌𝑦 = ⦋𝐴 / 𝑥⦌𝐵) )
| 3:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌𝑦 = 𝑦 )
| 4:3: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (⦋𝐴 / 𝑥⦌𝑦 = ⦋𝐴
/ 𝑥⦌𝐵 ↔ 𝑦 = ⦋𝐴 / 𝑥⦌𝐵) )
| 5:2,4: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑦 = 𝐵
↔ 𝑦 = ⦋𝐴 / 𝑥⦌𝐵) )
| 6:5: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑦([𝐴 / 𝑥]𝑦
= 𝐵 ↔ 𝑦 = ⦋𝐴 / 𝑥⦌𝐵) )
| 7:6: | ⊢ ( 𝐴 ∈ 𝑉 ▶ {𝑦 ∣ [𝐴 / 𝑥]𝑦 =
𝐵} = {𝑦 ∣ 𝑦 = ⦋𝐴 / 𝑥⦌𝐵} )
| 8:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ {𝑦 ∣ [𝐴 / 𝑥]𝑦 =
𝐵} = ⦋𝐴 / 𝑥⦌{𝑦 ∣ 𝑦 = 𝐵} )
| 9:7,8: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝑦 ∣ 𝑦
= 𝐵} = {𝑦 ∣ 𝑦 = ⦋𝐴 / 𝑥⦌𝐵} )
| 10:: | ⊢ {𝐵} = {𝑦 ∣ 𝑦 = 𝐵}
| 11:10: | ⊢ ∀𝑥{𝐵} = {𝑦 ∣ 𝑦 = 𝐵}
| 12:1,11: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝐵} = ⦋
𝐴 / 𝑥⦌{𝑦 ∣ 𝑦 = 𝐵} )
| 13:9,12: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝐵} = {
𝑦 ∣ 𝑦 = ⦋𝐴 / 𝑥⦌𝐵} )
| 14:: | ⊢ {⦋𝐴 / 𝑥⦌𝐵} = {𝑦 ∣ 𝑦 = ⦋𝐴
/ 𝑥⦌𝐵}
| 15:13,14: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝐵} = {
⦋𝐴 / 𝑥⦌𝐵} )
| qed:15: | ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌{𝐵} = {⦋
𝐴 / 𝑥⦌𝐵})
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌{𝐵} = {⦋𝐴 / 𝑥⦌𝐵}) |
|
Theorem | csbxpgVD 44394 |
Virtual deduction proof of csbxp 5772.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbxp 5772 is csbxpgVD 44394 without virtual deductions and was
automatically derived from csbxpgVD 44394.
1:: | ⊢ ( 𝐴 ∈ 𝑉 ▶ 𝐴 ∈ 𝑉 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑤 ∈ 𝐵 ↔
⦋𝐴 / 𝑥⦌𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 3:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌𝑤 = 𝑤 )
| 4:3: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (⦋𝐴 / 𝑥⦌𝑤 ∈ ⦋𝐴 /
𝑥⦌𝐵 ↔ 𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 5:2,4: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑤 ∈ 𝐵 ↔ 𝑤
∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 6:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔
⦋𝐴 / 𝑥⦌𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶) )
| 7:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌𝑦 = 𝑦 )
| 8:7: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (⦋𝐴 / 𝑥⦌𝑦 ∈ ⦋𝐴 /
𝑥⦌𝐶 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶) )
| 9:6,8: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔ 𝑦
∈ ⦋𝐴 / 𝑥⦌𝐶) )
| 10:5,9: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (([𝐴 / 𝑥]𝑤 ∈ 𝐵 ∧
[𝐴 / 𝑥]𝑦 ∈ 𝐶) ↔ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧
𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)) )
| 11:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥](𝑤 ∈ 𝐵 ∧
𝑦 ∈ 𝐶) ↔ ([𝐴 / 𝑥]𝑤 ∈ 𝐵 ∧ [𝐴 / 𝑥]𝑦 ∈ 𝐶)) )
| 12:10,11: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥](𝑤 ∈ 𝐵 ∧
𝑦 ∈ 𝐶) ↔ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)) )
| 13:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑧 = ⟨𝑤 ,
𝑦⟩ ↔ 𝑧 = ⟨𝑤, 𝑦⟩) )
| 14:12,13: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (([𝐴 / 𝑥]𝑧 = ⟨𝑤
, 𝑦⟩ ∧ [𝐴 / 𝑥](𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑧 = ⟨𝑤, 𝑦⟩
∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 15:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥](𝑧 = ⟨𝑤
, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ([𝐴 / 𝑥]𝑧 = ⟨𝑤, 𝑦⟩
∧ [𝐴 / 𝑥](𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) )
| 16:14,15: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥](𝑧 = ⟨𝑤
, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧
(𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 17:16: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑦([𝐴 / 𝑥](𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑧 = ⟨𝑤, 𝑦⟩ ∧
(𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 18:17: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (∃𝑦[𝐴 / 𝑥](𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧
(𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 19:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]∃𝑦(𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑦[𝐴 / 𝑥](𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) )
| 20:18,19: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]∃𝑦(𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧
(𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 21:20: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑤([𝐴 / 𝑥]∃𝑦(
𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑦(𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 22:21: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (∃𝑤[𝐴 / 𝑥]∃𝑦(
𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑤∃𝑦(𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 23:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]∃𝑤∃𝑦(
𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑤[𝐴 / 𝑥]∃𝑦
(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) )
| 24:22,23: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]∃𝑤∃𝑦(
𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑤∃𝑦(𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 25:24: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑧([𝐴 / 𝑥]∃𝑤∃
𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑤∃𝑦(𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))) )
| 26:25: | ⊢ ( 𝐴 ∈ 𝑉 ▶ {𝑧 ∣ [𝐴 / 𝑥]∃𝑤∃
𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} = {𝑧 ∣ ∃𝑤∃𝑦(
𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))}
)
| 27:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝑧 ∣ ∃𝑤∃
𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} = {𝑧 ∣ [𝐴 / 𝑥]
∃𝑤∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} )
| 28:26,27: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝑧 ∣ ∃𝑤∃
𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))} = {𝑧 ∣ ∃𝑤∃𝑦(
𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))}
)
| 29:: | ⊢ {⟨𝑤 , 𝑦⟩ ∣ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)}
= {𝑧 ∣ ∃𝑤∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))}
| 30:: | ⊢ (𝐵 × 𝐶) = {⟨𝑤 , 𝑦⟩ ∣ (𝑤 ∈ 𝐵
∧ 𝑦 ∈ 𝐶)}
| 31:29,30: | ⊢ (𝐵 × 𝐶) = {𝑧 ∣ ∃𝑤∃𝑦(𝑧 = ⟨𝑤
, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))}
| 32:31: | ⊢ ∀𝑥(𝐵 × 𝐶) = {𝑧 ∣ ∃𝑤∃𝑦(𝑧 =
⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))}
| 33:1,32: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 × 𝐶) =
⦋𝐴 / 𝑥⦌{𝑧 ∣ ∃𝑤∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ 𝐵 ∧
𝑦 ∈ 𝐶))} )
| 34:28,33: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 × 𝐶) =
{𝑧 ∣ ∃𝑤∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧
𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))} )
| 35:: | ⊢ {⟨𝑤 , 𝑦⟩ ∣ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧
𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)} = {𝑧 ∣ ∃𝑤∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧
(𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))}
| 36:: | ⊢ (⦋𝐴 / 𝑥⦌𝐵 × ⦋𝐴 / 𝑥⦌𝐶) = {
⟨𝑤, 𝑦⟩ ∣ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)}
| 37:35,36: | ⊢ (⦋𝐴 / 𝑥⦌𝐵 × ⦋𝐴 / 𝑥⦌𝐶) = {𝑧
∣ ∃𝑤∃𝑦(𝑧 = ⟨𝑤, 𝑦⟩ ∧ (𝑤 ∈ ⦋𝐴 / 𝑥⦌𝐵 ∧
𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))}
| 38:34,37: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 × 𝐶) =
(⦋𝐴 / 𝑥⦌𝐵 × ⦋𝐴 / 𝑥⦌𝐶) )
| qed:38: | ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝐵 × 𝐶) = (
⦋𝐴 / 𝑥⦌𝐵 × ⦋𝐴 / 𝑥⦌𝐶))
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝐵 × 𝐶) = (⦋𝐴 / 𝑥⦌𝐵 × ⦋𝐴 / 𝑥⦌𝐶)) |
|
Theorem | csbresgVD 44395 |
Virtual deduction proof of csbres 5983.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbres 5983 is csbresgVD 44395 without virtual deductions and was
automatically derived from csbresgVD 44395.
1:: | ⊢ ( 𝐴 ∈ 𝑉 ▶ 𝐴 ∈ 𝑉 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌V = V )
| 3:2: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (⦋𝐴 / 𝑥⦌𝐶 × ⦋𝐴 /
𝑥⦌V) = (⦋𝐴 / 𝑥⦌𝐶 × V) )
| 4:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐶 × V) =
(⦋𝐴 / 𝑥⦌𝐶 × ⦋𝐴 / 𝑥⦌V) )
| 5:3,4: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐶 × V) =
(⦋𝐴 / 𝑥⦌𝐶 × V) )
| 6:5: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (⦋𝐴 / 𝑥⦌𝐵 ∩ ⦋𝐴 /
𝑥⦌(𝐶 × V)) =
(⦋𝐴 / 𝑥⦌𝐵 ∩ (⦋𝐴 / 𝑥⦌𝐶 × V)) )
| 7:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 ∩ (𝐶 ×
V)) = (⦋𝐴 / 𝑥⦌𝐵 ∩ ⦋𝐴 / 𝑥⦌(𝐶 × V)) )
| 8:6,7: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 ∩ (𝐶 ×
V)) = (⦋𝐴 / 𝑥⦌𝐵 ∩ (⦋𝐴 / 𝑥⦌𝐶 × V)) )
| 9:: | ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V))
| 10:9: | ⊢ ∀𝑥(𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V))
| 11:1,10: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 ↾ 𝐶) =
⦋𝐴 / 𝑥⦌(𝐵 ∩ (𝐶 × V)) )
| 12:8,11: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 ↾ 𝐶)
= (
⦋𝐴 / 𝑥⦌𝐵 ∩ (⦋𝐴 / 𝑥⦌𝐶 × V)) )
| 13:: | ⊢ (⦋𝐴 / 𝑥⦌𝐵 ↾ ⦋𝐴 / 𝑥⦌𝐶) = (
⦋𝐴 / 𝑥⦌𝐵 ∩ (⦋𝐴 / 𝑥⦌𝐶 × V))
| 14:12,13: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌(𝐵 ↾ 𝐶) =
(
⦋𝐴 / 𝑥⦌𝐵 ↾ ⦋𝐴 / 𝑥⦌𝐶) )
| qed:14: | ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝐵 ↾ 𝐶) = (
⦋𝐴 / 𝑥⦌𝐵 ↾ ⦋𝐴 / 𝑥⦌𝐶))
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝐵 ↾ 𝐶) = (⦋𝐴 / 𝑥⦌𝐵 ↾ ⦋𝐴 / 𝑥⦌𝐶)) |
|
Theorem | csbrngVD 44396 |
Virtual deduction proof of csbrn 6203.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbrn 6203 is csbrngVD 44396 without virtual deductions and was
automatically derived from csbrngVD 44396.
1:: | ⊢ ( 𝐴 ∈ 𝑉 ▶ 𝐴 ∈ 𝑉 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]⟨𝑤 , 𝑦⟩
∈ 𝐵 ↔ ⦋𝐴 / 𝑥⦌⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 3:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌⟨𝑤 , 𝑦⟩ =
⟨𝑤, 𝑦⟩ )
| 4:3: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (⦋𝐴 / 𝑥⦌⟨𝑤 , 𝑦⟩
∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ ⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 5:2,4: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]⟨𝑤 , 𝑦⟩
∈ 𝐵 ↔ ⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 6:5: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑤([𝐴 / 𝑥]⟨𝑤 ,
𝑦⟩ ∈ 𝐵 ↔ ⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 7:6: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (∃𝑤[𝐴 / 𝑥]⟨𝑤 ,
𝑦⟩ ∈ 𝐵 ↔ ∃𝑤⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 8:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (∃𝑤[𝐴 / 𝑥]⟨𝑤 ,
𝑦⟩ ∈ 𝐵 ↔ [𝐴 / 𝑥]∃𝑤⟨𝑤, 𝑦⟩ ∈ 𝐵) )
| 9:7,8: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]∃𝑤⟨𝑤
, 𝑦⟩ ∈ 𝐵 ↔ ∃𝑤⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 10:9: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑦([𝐴 / 𝑥]∃𝑤
⟨𝑤, 𝑦⟩ ∈ 𝐵 ↔ ∃𝑤⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 11:10: | ⊢ ( 𝐴 ∈ 𝑉 ▶ {𝑦 ∣ [𝐴 / 𝑥]∃𝑤⟨
𝑤, 𝑦⟩ ∈ 𝐵} = {𝑦 ∣ ∃𝑤⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵} )
| 12:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝑦 ∣ ∃𝑤
⟨𝑤, 𝑦⟩ ∈ 𝐵} = {𝑦 ∣ [𝐴 / 𝑥]∃𝑤⟨𝑤, 𝑦⟩ ∈ 𝐵} )
| 13:11,12: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝑦 ∣ ∃𝑤
⟨𝑤, 𝑦⟩ ∈ 𝐵} = {𝑦 ∣ ∃𝑤⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵} )
| 14:: | ⊢ ran 𝐵 = {𝑦 ∣ ∃𝑤⟨𝑤 , 𝑦⟩ ∈ 𝐵}
| 15:14: | ⊢ ∀𝑥ran 𝐵 = {𝑦 ∣ ∃𝑤⟨𝑤 , 𝑦⟩
∈ 𝐵}
| 16:1,15: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌ran 𝐵 = ⦋𝐴 /
𝑥⦌{𝑦 ∣ ∃𝑤⟨𝑤, 𝑦⟩ ∈ 𝐵} )
| 17:13,16: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌ran 𝐵 = {𝑦 ∣
∃𝑤⟨𝑤, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵} )
| 18:: | ⊢ ran ⦋𝐴 / 𝑥⦌𝐵 = {𝑦 ∣ ∃𝑤⟨𝑤
, 𝑦⟩ ∈ ⦋𝐴 / 𝑥⦌𝐵}
| 19:17,18: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌ran 𝐵 = ran ⦋
𝐴 / 𝑥⦌𝐵 )
| qed:19: | ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌ran 𝐵 = ran ⦋𝐴
/ 𝑥⦌𝐵)
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌ran 𝐵 = ran ⦋𝐴 / 𝑥⦌𝐵) |
|
Theorem | csbima12gALTVD 44397 |
Virtual deduction proof of csbima12 6078.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbima12 6078 is csbima12gALTVD 44397 without virtual deductions and was
automatically derived from csbima12gALTVD 44397.
1:: | ⊢ ( 𝐴 ∈ 𝐶 ▶ 𝐴 ∈ 𝐶 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹 ↾ 𝐵) =
(
⦋𝐴 / 𝑥⦌𝐹 ↾ ⦋𝐴 / 𝑥⦌𝐵) )
| 3:2: | ⊢ ( 𝐴 ∈ 𝐶 ▶
ran ⦋𝐴 / 𝑥⦌(𝐹 ↾ 𝐵)
= ran (⦋𝐴 / 𝑥⦌𝐹 ↾ ⦋𝐴 / 𝑥⦌𝐵) )
| 4:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶
⦋𝐴 / 𝑥⦌ran (𝐹 ↾ 𝐵)
= ran ⦋𝐴 / 𝑥⦌(𝐹 ↾ 𝐵) )
| 5:3,4: | ⊢ ( 𝐴 ∈ 𝐶 ▶
⦋𝐴 / 𝑥⦌ran (𝐹 ↾ 𝐵)
= ran (⦋𝐴 / 𝑥⦌𝐹 ↾ ⦋𝐴 / 𝑥⦌𝐵) )
| 6:: | ⊢ (𝐹 “ 𝐵) = ran (𝐹 ↾ 𝐵)
| 7:6: | ⊢ ∀𝑥(𝐹 “ 𝐵) = ran (𝐹 ↾ 𝐵)
| 8:1,7: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹 “ 𝐵) = ⦋
𝐴 / 𝑥⦌ran (𝐹 ↾ 𝐵) )
| 9:5,8: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹 “ 𝐵) =
ran (⦋𝐴 / 𝑥⦌𝐹 ↾ ⦋𝐴 / 𝑥⦌𝐵) )
| 10:: | ⊢ (⦋𝐴 / 𝑥⦌𝐹 “ ⦋𝐴 / 𝑥⦌𝐵) = ran
(⦋𝐴 / 𝑥⦌𝐹 ↾ ⦋𝐴 / 𝑥⦌𝐵)
| 11:9,10: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹 “ 𝐵) = (
⦋𝐴 / 𝑥⦌𝐹 “ ⦋𝐴 / 𝑥⦌𝐵) )
| qed:11: | ⊢ (𝐴 ∈ 𝐶 → ⦋𝐴 / 𝑥⦌(𝐹 “ 𝐵) = (⦋
𝐴 / 𝑥⦌𝐹 “ ⦋𝐴 / 𝑥⦌𝐵))
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐶 → ⦋𝐴 / 𝑥⦌(𝐹 “ 𝐵) = (⦋𝐴 / 𝑥⦌𝐹 “ ⦋𝐴 / 𝑥⦌𝐵)) |
|
Theorem | csbunigVD 44398 |
Virtual deduction proof of csbuni 4935.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbuni 4935 is csbunigVD 44398 without virtual deductions and was
automatically derived from csbunigVD 44398.
1:: | ⊢ ( 𝐴 ∈ 𝑉 ▶ 𝐴 ∈ 𝑉 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑧 ∈ 𝑦 ↔ 𝑧
∈ 𝑦) )
| 3:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ 𝑦
∈ ⦋𝐴 / 𝑥⦌𝐵) )
| 4:2,3: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (([𝐴 / 𝑥]𝑧 ∈ 𝑦 ∧
[𝐴 / 𝑥]𝑦 ∈ 𝐵) ↔ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)) )
| 5:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥](𝑧 ∈ 𝑦 ∧
𝑦 ∈ 𝐵) ↔ ([𝐴 / 𝑥]𝑧 ∈ 𝑦 ∧ [𝐴 / 𝑥]𝑦 ∈ 𝐵)) )
| 6:4,5: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥](𝑧 ∈ 𝑦 ∧
𝑦 ∈ 𝐵) ↔ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)) )
| 7:6: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑦([𝐴 / 𝑥](𝑧 ∈
𝑦 ∧ 𝑦 ∈ 𝐵) ↔ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)) )
| 8:7: | ⊢ ( 𝐴 ∈ 𝑉 ▶ (∃𝑦[𝐴 / 𝑥](𝑧 ∈
𝑦 ∧ 𝑦 ∈ 𝐵) ↔ ∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)) )
| 9:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]∃𝑦(𝑧 ∈
𝑦 ∧ 𝑦 ∈ 𝐵) ↔ ∃𝑦[𝐴 / 𝑥](𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)) )
| 10:8,9: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ([𝐴 / 𝑥]∃𝑦(𝑧 ∈
𝑦 ∧ 𝑦 ∈ 𝐵) ↔ ∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)) )
| 11:10: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ∀𝑧([𝐴 / 𝑥]∃𝑦(
𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) ↔ ∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)) )
| 12:11: | ⊢ ( 𝐴 ∈ 𝑉 ▶ {𝑧 ∣ [𝐴 / 𝑥]∃𝑦(
𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)} = {𝑧 ∣ ∃𝑦(𝑧 ∈ 𝑦 ∧
𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)} )
| 13:1: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝑧 ∣ ∃𝑦(𝑧
∈ 𝑦 ∧ 𝑦 ∈ 𝐵)} = {𝑧 ∣ [𝐴 / 𝑥]∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)}
)
| 14:12,13: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌{𝑧 ∣ ∃𝑦(𝑧
∈ 𝑦 ∧ 𝑦 ∈ 𝐵)} = {𝑧 ∣ ∃𝑦(𝑧 ∈ 𝑦 ∧
𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)} )
| 15:: | ⊢ ∪ 𝐵 = {𝑧 ∣ ∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)}
| 16:15: | ⊢ ∀𝑥∪ 𝐵 = {𝑧 ∣ ∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈
𝐵)}
| 17:1,16: | ⊢ ( 𝐴 ∈ 𝑉 ▶ [𝐴 / 𝑥]∪ 𝐵 = {𝑧 ∣
∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)} )
| 18:1,17: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌∪ 𝐵 = ⦋𝐴 /
𝑥⦌{𝑧 ∣ ∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)} )
| 19:14,18: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌∪ 𝐵 = {𝑧 ∣
∃𝑦(𝑧 ∈ 𝑦 ∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)} )
| 20:: | ⊢ ∪ ⦋𝐴 / 𝑥⦌𝐵 = {𝑧 ∣ ∃𝑦(𝑧 ∈ 𝑦
∧ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)}
| 21:19,20: | ⊢ ( 𝐴 ∈ 𝑉 ▶ ⦋𝐴 / 𝑥⦌∪ 𝐵 = ∪ ⦋𝐴
/ 𝑥⦌𝐵 )
| qed:21: | ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌∪ 𝐵 = ∪ ⦋𝐴 /
𝑥⦌𝐵)
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌∪
𝐵 = ∪ ⦋𝐴 / 𝑥⦌𝐵) |
|
Theorem | csbfv12gALTVD 44399 |
Virtual deduction proof of csbfv12 6938.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
csbfv12 6938 is csbfv12gALTVD 44399 without virtual deductions and was
automatically derived from csbfv12gALTVD 44399.
1:: | ⊢ ( 𝐴 ∈ 𝐶 ▶ 𝐴 ∈ 𝐶 )
| 2:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌{𝑦} = {
𝑦} )
| 3:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹 “ {𝐵
}) = (⦋𝐴 / 𝑥⦌𝐹 “ ⦋𝐴 / 𝑥⦌{𝐵}) )
| 4:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌{𝐵} = {
⦋𝐴 / 𝑥⦌𝐵} )
| 5:4: | ⊢ ( 𝐴 ∈ 𝐶 ▶ (⦋𝐴 / 𝑥⦌𝐹 “ ⦋𝐴
/ 𝑥⦌{𝐵}) = (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) )
| 6:3,5: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹 “ {𝐵
}) = (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) )
| 7:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ([𝐴 / 𝑥](𝐹 “ {
𝐵}) = {𝑦} ↔ ⦋𝐴 / 𝑥⦌(𝐹 “ {𝐵}) = ⦋𝐴 / 𝑥⦌{𝑦}) )
| 8:6,2: | ⊢ ( 𝐴 ∈ 𝐶 ▶ (⦋𝐴 / 𝑥⦌(𝐹 “ {
𝐵}) = ⦋𝐴 / 𝑥⦌{𝑦} ↔ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵})
= {𝑦}) )
| 9:7,8: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ([𝐴 / 𝑥](𝐹 “ {
𝐵}) = {𝑦} ↔ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) = {𝑦})
)
| 10:9: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ∀𝑦([𝐴 / 𝑥](𝐹
“ {𝐵}) = {𝑦} ↔ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) =
{𝑦}) )
| 11:10: | ⊢ ( 𝐴 ∈ 𝐶 ▶ {𝑦 ∣ [𝐴 / 𝑥](𝐹
“ {𝐵}) = {𝑦}} = {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) =
{𝑦}} )
| 12:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝐹
“ {𝐵}) = {𝑦}} = {𝑦 ∣ [𝐴 / 𝑥](𝐹 “ {𝐵}) = {𝑦}} )
| 13:11,12: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝐹
“ {𝐵}) = {𝑦}} = {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) =
{𝑦
}} )
| 14:13: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ∪ ⦋𝐴 / 𝑥⦌{𝑦 ∣ (
𝐹 “ {𝐵}) = {𝑦}} = ∪ {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝐹 “
{⦋𝐴 / 𝑥⦌𝐵}) =
{𝑦}} )
| 15:1: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌∪ {𝑦 ∣ (
𝐹 “ {𝐵}) = {𝑦}} = ∪ ⦋𝐴 / 𝑥⦌{𝑦 ∣ (𝐹 “ {𝐵}) =
{𝑦}} )
| 16:14,15: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌∪ {𝑦 ∣ (
𝐹 “ {𝐵}) = {𝑦}} =
∪ {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) =
{𝑦}} )
| 17:: | ⊢ (𝐹‘𝐵) =
∪ {𝑦 ∣ (𝐹 “ {𝐵}) =
{𝑦}}
| 18:17: | ⊢ ∀𝑥(𝐹‘𝐵) = ∪ {𝑦 ∣ (𝐹 “ {𝐵
}) = {𝑦}}
| 19:1,18: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹‘𝐵)
= ⦋𝐴 / 𝑥⦌∪ {𝑦 ∣ (𝐹 “ {𝐵}) = {𝑦}} )
| 20:16,19: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹‘𝐵)
= ∪ {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) = {𝑦}} )
| 21:: | ⊢ (⦋𝐴 / 𝑥⦌𝐹‘⦋𝐴 / 𝑥⦌𝐵) =
∪ {𝑦 ∣ (⦋𝐴 / 𝑥⦌𝐹 “ {⦋𝐴 / 𝑥⦌𝐵}) = {𝑦}}
| 22:20,21: | ⊢ ( 𝐴 ∈ 𝐶 ▶ ⦋𝐴 / 𝑥⦌(𝐹‘𝐵)
= (⦋𝐴 / 𝑥⦌𝐹‘⦋𝐴 / 𝑥⦌𝐵) )
| qed:22: | ⊢ (𝐴 ∈ 𝐶 → ⦋𝐴 / 𝑥⦌(𝐹‘𝐵) =
(⦋𝐴 / 𝑥⦌𝐹‘⦋𝐴 / 𝑥⦌𝐵))
|
(Contributed by Alan Sare, 10-Nov-2012.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ (𝐴 ∈ 𝐶 → ⦋𝐴 / 𝑥⦌(𝐹‘𝐵) = (⦋𝐴 / 𝑥⦌𝐹‘⦋𝐴 / 𝑥⦌𝐵)) |
|
Theorem | con5VD 44400 |
Virtual deduction proof of con5 44022.
The following User's Proof is a Virtual Deduction proof completed
automatically by the tools program completeusersproof.cmd, which invokes
Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant.
con5 44022 is con5VD 44400 without virtual deductions and was automatically
derived from con5VD 44400.
1:: | ⊢ ( (𝜑 ↔ ¬ 𝜓) ▶ (𝜑 ↔ ¬ 𝜓) )
| 2:1: | ⊢ ( (𝜑 ↔ ¬ 𝜓) ▶ (¬ 𝜓 → 𝜑) )
| 3:2: | ⊢ ( (𝜑 ↔ ¬ 𝜓) ▶ (¬ 𝜑 → ¬ ¬ 𝜓
) )
| 4:: | ⊢ (𝜓 ↔ ¬ ¬ 𝜓)
| 5:3,4: | ⊢ ( (𝜑 ↔ ¬ 𝜓) ▶ (¬ 𝜑 → 𝜓) )
| qed:5: | ⊢ ((𝜑 ↔ ¬ 𝜓) → (¬ 𝜑 → 𝜓))
|
(Contributed by Alan Sare, 21-Apr-2013.) (Proof modification is
discouraged.) (New usage is discouraged.)
|
⊢ ((𝜑 ↔ ¬ 𝜓) → (¬ 𝜑 → 𝜓)) |