MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  drnfc1 Structured version   Visualization version   GIF version

Theorem drnfc1 2944
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-8 2145, ax-11 2192. (Revised by Wolf Lammen, 22-Sep-2024.) (New usage is discouraged.)
Hypothesis
Ref Expression
drnfc1.1 (∀𝑥 𝑥 = 𝑦𝐴 = 𝐵)
Assertion
Ref Expression
drnfc1 (∀𝑥 𝑥 = 𝑦 → (𝑥𝐴𝑦𝐵))

Proof of Theorem drnfc1
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 drnfc1.1 . . . . 5 (∀𝑥 𝑥 = 𝑦𝐴 = 𝐵)
2 eleq2w2 2759 . . . . 5 (𝐴 = 𝐵 → (𝑤𝐴𝑤𝐵))
31, 2syl 18 . . . 4 (∀𝑥 𝑥 = 𝑦 → (𝑤𝐴𝑤𝐵))
43drnf1 2475 . . 3 (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥 𝑤𝐴 ↔ Ⅎ𝑦 𝑤𝐵))
54albidv 1950 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑤𝑥 𝑤𝐴 ↔ ∀𝑤𝑦 𝑤𝐵))
6 df-nfc 2912 . 2 (𝑥𝐴 ↔ ∀𝑤𝑥 𝑤𝐴)
7 df-nfc 2912 . 2 (𝑦𝐵 ↔ ∀𝑤𝑦 𝑤𝐵)
85, 6, 73bitr4g 317 1 (∀𝑥 𝑥 = 𝑦 → (𝑥𝐴𝑦𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wal 1568   = wceq 1570  wnf 1813  wcel 2143  wnfc 2910
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-9 2153  ax-10 2176  ax-12 2213  ax-13 2404  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1810  df-nf 1814  df-cleq 2755  df-nfc 2912
This theorem is referenced by:  nfabd2  2948  nfcvb  5349  nfriotad  7380  bj-nfcsym  37515
  Copyright terms: Public domain W3C validator