Metamath Proof Explorer

Theorem ssralv2VD

Description: Quantification restricted to a subclass for two quantifiers. ssralv for two quantifiers. The following User's Proof is a Virtual Deduction proof completed automatically by the tools program completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant. ssralv2 is ssralv2VD without virtual deductions and was automatically derived from ssralv2VD .

1:: |- (. ( A C_ B /\ C C_ D ) ->. ( A C_ B /\ C C_ D ) ).
2:: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph ->. A. x e. B A. y e. D ph ).
3:1: |- (. ( A C_ B /\ C C_ D ) ->. A C_ B ).
4:3,2: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph ->. A. x e. A A. y e. D ph ).
5:4: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph ->. A. x ( x e. A -> A. y e. D ph ) ).
6:5: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph ->. ( x e. A -> A. y e. D ph ) ).
7:: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph , x e. A ->. x e. A ).
8:7,6: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph , x e. A ->. A. y e. D ph ).
9:1: |- (. ( A C_ B /\ C C_ D ) ->. C C_ D ).
10:9,8: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph , x e. A ->. A. y e. C ph ).
11:10: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph ->. ( x e. A -> A. y e. C ph ) ).
12:: |- ( ( A C_ B /\ C C_ D ) -> A. x ( A C_ B /\ C C_ D ) )
13:: |- ( A. x e. B A. y e. D ph -> A. x A. x e. B A. y e. D ph )
14:12,13,11: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph ->. A. x ( x e. A -> A. y e. C ph ) ).
15:14: |- (. ( A C_ B /\ C C_ D ) ,. A. x e. B A. y e. D ph ->. A. x e. A A. y e. C ph ).
16:15: |- (. ( A C_ B /\ C C_ D ) ->. ( A. x e. B A. y e. D ph -> A. x e. A A. y e. C ph ) ).
qed:16: |- ( ( A C_ B /\ C C_ D ) -> ( A. x e. B A. y e. D ph -> A. x e. A A. y e. C ph ) )
(Contributed by Alan Sare, 10-Feb-2012) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion ssralv2VD ⊢ A ⊆ B ∧ C ⊆ D → ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∈ A ∀ y ∈ C φ

Proof

Step Hyp Ref Expression
1 ax-5 ⊢ A ⊆ B ∧ C ⊆ D → ∀ x A ⊆ B ∧ C ⊆ D
2 hbra1 ⊢ ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∀ x ∈ B ∀ y ∈ D φ
3 idn1 ⊢ A ⊆ B ∧ C ⊆ D → A ⊆ B ∧ C ⊆ D
4 simpr ⊢ A ⊆ B ∧ C ⊆ D → C ⊆ D
5 3 4 e1a ⊢ A ⊆ B ∧ C ⊆ D → C ⊆ D
6 idn3 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ , x ∈ A → x ∈ A
7 simpl ⊢ A ⊆ B ∧ C ⊆ D → A ⊆ B
8 3 7 e1a ⊢ A ⊆ B ∧ C ⊆ D → A ⊆ B
9 idn2 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∈ B ∀ y ∈ D φ
10 ssralv ⊢ A ⊆ B → ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∈ A ∀ y ∈ D φ
11 8 9 10 e12 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∈ A ∀ y ∈ D φ
12 df-ral ⊢ ∀ x ∈ A ∀ y ∈ D φ ↔ ∀ x x ∈ A → ∀ y ∈ D φ
13 12 biimpi ⊢ ∀ x ∈ A ∀ y ∈ D φ → ∀ x x ∈ A → ∀ y ∈ D φ
14 11 13 e2 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ → ∀ x x ∈ A → ∀ y ∈ D φ
15 sp ⊢ ∀ x x ∈ A → ∀ y ∈ D φ → x ∈ A → ∀ y ∈ D φ
16 14 15 e2 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ → x ∈ A → ∀ y ∈ D φ
17 pm2.27 ⊢ x ∈ A → x ∈ A → ∀ y ∈ D φ → ∀ y ∈ D φ
18 6 16 17 e32 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ , x ∈ A → ∀ y ∈ D φ
19 ssralv ⊢ C ⊆ D → ∀ y ∈ D φ → ∀ y ∈ C φ
20 5 18 19 e13 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ , x ∈ A → ∀ y ∈ C φ
21 20 in3 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ → x ∈ A → ∀ y ∈ C φ
22 1 2 21 gen21nv ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ → ∀ x x ∈ A → ∀ y ∈ C φ
23 df-ral ⊢ ∀ x ∈ A ∀ y ∈ C φ ↔ ∀ x x ∈ A → ∀ y ∈ C φ
24 23 biimpri ⊢ ∀ x x ∈ A → ∀ y ∈ C φ → ∀ x ∈ A ∀ y ∈ C φ
25 22 24 e2 ⊢ A ⊆ B ∧ C ⊆ D , ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∈ A ∀ y ∈ C φ
26 25 in2 ⊢ A ⊆ B ∧ C ⊆ D → ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∈ A ∀ y ∈ C φ
27 26 in1 ⊢ A ⊆ B ∧ C ⊆ D → ∀ x ∈ B ∀ y ∈ D φ → ∀ x ∈ A ∀ y ∈ C φ