Theorem ralcom3 3103

Description: A commutation law for restricted universal quantifiers that swaps the domains of the restriction. (Contributed by NM, 22-Feb-2004.) (Proof shortened by Wolf Lammen, 22-Dec-2024.)

Assertion

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

Proof of Theorem ralcom3

Step	Hyp	Ref	Expression
1		bi2.04 387	. 2 ⊢ ((𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐵 → 𝜑)) ↔ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐴 → 𝜑)))
2	1	ralbii2 3095	1 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 → 𝜑) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 → 𝜑))

Syntax hints:   → wi 4   ↔ wb 206   ∈ wcel 2108  ∀wral 3067

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807

This theorem depends on definitions:  df-bi 207  df-ral 3068

This theorem is referenced by:  tgss2  23015  ist1-3  23378  isreg2  23406