Metamath Proof Explorer


Theorem axsepg5

Description: A generalization of ax-sep that combines axsepg , axsepg2 , and axsepg3 into a single theorem scheme. Unlike ax-sep , this scheme lacks a distinct variable condition for ph and z , for x and z , and for y and z . Usage of this theorem is discouraged because it depends on ax-13 . (Contributed by BTernaryTau, 24-May-2026) (New usage is discouraged.)

Ref Expression
Assertion axsepg5 𝑦𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) )

Proof

Step Hyp Ref Expression
1 nfnae 𝑥 ¬ ∀ 𝑦 𝑦 = 𝑧
2 nfvd ( ¬ ∀ 𝑦 𝑦 = 𝑧 → Ⅎ 𝑦 𝑥𝑤 )
3 nfcvf ( ¬ ∀ 𝑦 𝑦 = 𝑧 𝑦 𝑧 )
4 3 nfcrd ( ¬ ∀ 𝑦 𝑦 = 𝑧 → Ⅎ 𝑦 𝑥𝑧 )
5 nfvd ( ¬ ∀ 𝑦 𝑦 = 𝑧 → Ⅎ 𝑦 𝜑 )
6 4 5 nfand ( ¬ ∀ 𝑦 𝑦 = 𝑧 → Ⅎ 𝑦 ( 𝑥𝑧𝜑 ) )
7 2 6 nfbid ( ¬ ∀ 𝑦 𝑦 = 𝑧 → Ⅎ 𝑦 ( 𝑥𝑤 ↔ ( 𝑥𝑧𝜑 ) ) )
8 1 7 nfald ( ¬ ∀ 𝑦 𝑦 = 𝑧 → Ⅎ 𝑦𝑥 ( 𝑥𝑤 ↔ ( 𝑥𝑧𝜑 ) ) )
9 nfvd ( ¬ ∀ 𝑦 𝑦 = 𝑧 → Ⅎ 𝑤𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) )
10 elequ2 ( 𝑤 = 𝑦 → ( 𝑥𝑤𝑥𝑦 ) )
11 10 bibi1d ( 𝑤 = 𝑦 → ( ( 𝑥𝑤 ↔ ( 𝑥𝑧𝜑 ) ) ↔ ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) )
12 11 albidv ( 𝑤 = 𝑦 → ( ∀ 𝑥 ( 𝑥𝑤 ↔ ( 𝑥𝑧𝜑 ) ) ↔ ∀ 𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) )
13 12 biimpd ( 𝑤 = 𝑦 → ( ∀ 𝑥 ( 𝑥𝑤 ↔ ( 𝑥𝑧𝜑 ) ) → ∀ 𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) )
14 13 a1i ( ¬ ∀ 𝑦 𝑦 = 𝑧 → ( 𝑤 = 𝑦 → ( ∀ 𝑥 ( 𝑥𝑤 ↔ ( 𝑥𝑧𝜑 ) ) → ∀ 𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) ) )
15 nfae 𝑥𝑦 𝑦 = 𝑧
16 elequ2 ( 𝑦 = 𝑧 → ( 𝑥𝑦𝑥𝑧 ) )
17 16 anbi1d ( 𝑦 = 𝑧 → ( ( 𝑥𝑦𝜑 ) ↔ ( 𝑥𝑧𝜑 ) ) )
18 17 bibi2d ( 𝑦 = 𝑧 → ( ( 𝑥𝑦 ↔ ( 𝑥𝑦𝜑 ) ) ↔ ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) )
19 18 biimpd ( 𝑦 = 𝑧 → ( ( 𝑥𝑦 ↔ ( 𝑥𝑦𝜑 ) ) → ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) )
20 19 sps ( ∀ 𝑦 𝑦 = 𝑧 → ( ( 𝑥𝑦 ↔ ( 𝑥𝑦𝜑 ) ) → ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) )
21 15 20 alimd ( ∀ 𝑦 𝑦 = 𝑧 → ( ∀ 𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑦𝜑 ) ) → ∀ 𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) ) ) )
22 axsepg4 𝑤𝑥 ( 𝑥𝑤 ↔ ( 𝑥𝑧𝜑 ) )
23 axsepg3 𝑦𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑦𝜑 ) )
24 8 9 14 21 22 23 dvelimexcasei 𝑦𝑥 ( 𝑥𝑦 ↔ ( 𝑥𝑧𝜑 ) )