Metamath Proof Explorer


Theorem drnfc1

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Usage of this theorem is discouraged because it depends on ax-13 . (Contributed by Mario Carneiro, 8-Oct-2016) Avoid ax-8 , ax-11 . (Revised by Wolf Lammen, 22-Sep-2024) (New usage is discouraged.)

Ref Expression
Hypothesis drnfc1.1 ⊢ ( ∀ 𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵 )
Assertion drnfc1 ( ∀ 𝑥 𝑥 = 𝑦 → ( Ⅎ 𝑥 𝐴 ↔ Ⅎ 𝑦 𝐵 ) )

Proof

Step Hyp Ref Expression
1 drnfc1.1 ⊢ ( ∀ 𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵 )
2 eleq2w2 ⊢ ( 𝐴 = 𝐵 → ( 𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐵 ) )
3 1 2 syl ⊢ ( ∀ 𝑥 𝑥 = 𝑦 → ( 𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐵 ) )
4 3 drnf1 ⊢ ( ∀ 𝑥 𝑥 = 𝑦 → ( Ⅎ 𝑥 𝑤 ∈ 𝐴 ↔ Ⅎ 𝑦 𝑤 ∈ 𝐵 ) )
5 4 albidv ⊢ ( ∀ 𝑥 𝑥 = 𝑦 → ( ∀ 𝑤 Ⅎ 𝑥 𝑤 ∈ 𝐴 ↔ ∀ 𝑤 Ⅎ 𝑦 𝑤 ∈ 𝐵 ) )
6 df-nfc ⊢ ( Ⅎ 𝑥 𝐴 ↔ ∀ 𝑤 Ⅎ 𝑥 𝑤 ∈ 𝐴 )
7 df-nfc ⊢ ( Ⅎ 𝑦 𝐵 ↔ ∀ 𝑤 Ⅎ 𝑦 𝑤 ∈ 𝐵 )
8 5 6 7 3bitr4g ⊢ ( ∀ 𝑥 𝑥 = 𝑦 → ( Ⅎ 𝑥 𝐴 ↔ Ⅎ 𝑦 𝐵 ) )