Theorem drnfc2 2918

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Proof revision is marked as discouraged because the minimizer replaces albidv 1919 with dral2 2441, leading to a one byte longer proof. However feel free to manually edit it according to conventions. (TODO: dral2 2441 depends on ax-13 2375, hence its usage during minimizing is discouraged. Check in the long run whether this is a permanent restriction). Usage of this theorem is discouraged because it depends on ax-13 2375. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-8 2109. (Revised by Wolf Lammen, 22-Sep-2024.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
drnfc1.1	⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵)

Assertion

Ref	Expression
drnfc2	⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝐴 ↔ Ⅎ𝑧𝐵))

Proof of Theorem drnfc2

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		drnfc1.1	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵)
2		eleq2w2 2730	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐵))
3	1, 2	syl 17	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐵))
4	3	drnf2 2447	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧 𝑤 ∈ 𝐴 ↔ Ⅎ𝑧 𝑤 ∈ 𝐵))
5	4	albidv 1919	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐴 ↔ ∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐵))
6		df-nfc 2884	. 2 ⊢ (Ⅎ𝑧𝐴 ↔ ∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐴)
7		df-nfc 2884	. 2 ⊢ (Ⅎ𝑧𝐵 ↔ ∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐵)
8	5, 6, 7	3bitr4g 314	1 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝐴 ↔ Ⅎ𝑧𝐵))

Syntax hints:   → wi 4   ↔ wb 206  ∀wal 1537   = wceq 1539  Ⅎwnf 1782   ∈ wcel 2107  Ⅎwnfc 2882

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-13 2375  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1542  df-ex 1779  df-nf 1783  df-cleq 2726  df-nfc 2884

This theorem is referenced by: (None)