Theorem nfra2 3367

Description: Similar to Lemma 24 of [Monk2] p. 114, except the quantification of the antecedent is restricted. Derived automatically from hbra2VD 45626. Usage of this theorem is discouraged because it depends on ax-13 2406. Use the weaker nfra2w 3303 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 2927	. 2 ⊢ Ⅎ𝑦𝐴
2		nfra1 3291	. 2 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 𝜑
3	1, 2	nfral 3365	1 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑

This proof depends on syntax axioms:  Ⅎwnf 1816  ∀wral 3081

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-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082

This theorem is used by:  ralcom2  3368