Theorem hbra2VD 45601

Description: Virtual deduction proof of nfra2 3368. The following user's proof is completed by invoking mmj2's unify command and using mmj2's StepSelector to pick all remaining steps of the Metamath proof.

1::	⊢ (∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑 → ∀𝑦∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
2::	⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 ↔ ∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
3:1,2,?: e00 45509	⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 → ∀𝑦∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
4:2:	⊢ ∀𝑦(∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 ↔ ∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
5:4,?: e0a 45513	⊢ (∀𝑦∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 ↔ ∀𝑦∀𝑦 ∈ 𝐵∀𝑥 ∈ 𝐴𝜑)
qed:3,5,?: e00 45509	⊢ (∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑 → ∀𝑦∀𝑥 ∈ 𝐴∀𝑦 ∈ 𝐵𝜑)

(Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
hbra2VD	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 → ∀𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑)

Distinct variable groups:   𝑦,𝐴   𝑥,𝐵   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem hbra2VD

Step	Hyp	Ref	Expression
1		ralcom 3296	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑)
2		hbra1 3305	. 2 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑 → ∀𝑦∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑)
3	1, 2	hbxfrbi 1858	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 → ∀𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568  ∀wral 3082

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-11 2195  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-ral 3083

This theorem is used by: (None)