Theorem nfra2 3365

Description: Similar to Lemma 24 of [Monk2] p. 114, except the quantification of the antecedent is restricted. Derived automatically from hbra2VD 45568. Usage of this theorem is discouraged because it depends on ax-13 2404. Use the weaker nfra2w 3301 when possible. (Contributed by Alan Sare, 31-Dec-2011.) (New usage is discouraged.)

Assertion

Ref	Expression
nfra2	⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑

Distinct variable group:   𝑦,𝐴

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

Proof of Theorem nfra2

Step	Hyp	Ref	Expression
1		nfcv 2925	. 2 ⊢ Ⅎ𝑦𝐴
2		nfra1 3289	. 2 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 𝜑
3	1, 2	nfral 3363	1 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑

Syntax hints:  Ⅎwnf 1813  ∀wral 3079

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-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080

This theorem is referenced by:  ralcom2  3366