Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ax8v | Structured version Visualization version GIF version |
Description: Weakened version of ax-8 2116, with a disjoint variable condition on 𝑥, 𝑦. This should be the only proof referencing ax-8 2116, and it should be referenced only by its two weakened versions ax8v1 2118 and ax8v2 2119, from which ax-8 2116 is then rederived as ax8 2120, which shows that either ax8v 2117 or the conjunction of ax8v1 2118 and ax8v2 2119 is sufficient. (Contributed by BJ, 7-Dec-2020.) Use ax8 2120 instead. (New usage is discouraged.) |
Ref | Expression |
---|---|
ax8v | ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-8 2116 | 1 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 |
This theorem was proved from axioms: ax-8 2116 |
This theorem is referenced by: ax8v1 2118 ax8v2 2119 |
Copyright terms: Public domain | W3C validator |