Theorem raldifeq 4453

Description: Equality theorem for restricted universal quantifier. (Contributed by Thierry Arnoux, 6-Jul-2019.)

Hypotheses

Ref	Expression
raldifeq.1	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
raldifeq.2	⊢ (𝜑 → ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝜓)

Assertion

Ref	Expression
raldifeq	⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜓))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem raldifeq

Step	Hyp	Ref	Expression
1		raldifeq.2	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝜓)
2	1	biantrud 540	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ (∀𝑥 ∈ 𝐴 𝜓 ∧ ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝜓)))
3		ralunb 4149	. . 3 ⊢ (∀𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴))𝜓 ↔ (∀𝑥 ∈ 𝐴 𝜓 ∧ ∀𝑥 ∈ (𝐵 ∖ 𝐴)𝜓))
4	2, 3	bitr4di 292	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴))𝜓))
5		raldifeq.1	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
6		undif 4442	. . . 4 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵)
7	5, 6	sylib 221	. . 3 ⊢ (𝜑 → (𝐴 ∪ (𝐵 ∖ 𝐴)) = 𝐵)
8	7	raleqdv 3322	. 2 ⊢ (𝜑 → (∀𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐴))𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜓))
9	4, 8	bitrd 282	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569  ∀wral 3078   ∖ cdif 3901   ∪ cun 3902   ⊆ wss 3904

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286

This theorem is used by:  cantnfrescl  9643  rrxmet  25578  ntrneiel2  44840  ntrneik4w  44854