Metamath Proof Explorer


Theorem axc11r

Description: Same as axc11 but with reversed antecedent. Note the use of ax-12 (and not merely ax12v as in axc11rv ).

This theorem is mostly used to eliminate conditions requiring set variables be distinct (cf. cbvaev and aecom , for example) in proofs. In practice, theorems beyond elementary set theory do not really benefit from such eliminations. As of 2024, it is used in conjunction with ax-13 only, and like that, it should be applied only in niches where indispensable. (Contributed by NM, 25-Jul-2015)

Ref Expression
Assertion axc11r ⊢ ∀ y y = x → ∀ x φ → ∀ y φ

Proof

Step Hyp Ref Expression
1 ax-12 ⊢ y = x → ∀ x φ → ∀ y y = x → φ
2 1 sps ⊢ ∀ y y = x → ∀ x φ → ∀ y y = x → φ
3 pm2.27 ⊢ y = x → y = x → φ → φ
4 3 al2imi ⊢ ∀ y y = x → ∀ y y = x → φ → ∀ y φ
5 2 4 syld ⊢ ∀ y y = x → ∀ x φ → ∀ y φ