Theorem ssopab2dv 4233

Description: Inference of ordered pair abstraction subclass from implication. (Contributed by NM, 19-Jan-2014.) (Revised by Mario Carneiro, 24-Jun-2014.)

Hypothesis

Ref	Expression
ssopab2dv.1	⊢ (𝜑 → (𝜓 → 𝜒))

Assertion

Ref	Expression
ssopab2dv	⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜓} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜒})

Distinct variable groups:   𝜑,𝑥   𝜑,𝑦

Allowed substitution hints:   𝜓(𝑥,𝑦)   𝜒(𝑥,𝑦)

Proof of Theorem ssopab2dv

Step	Hyp	Ref	Expression
1		ssopab2dv.1	. . 3 ⊢ (𝜑 → (𝜓 → 𝜒))
2	1	alrimivv 1852	. 2 ⊢ (𝜑 → ∀𝑥∀𝑦(𝜓 → 𝜒))
3		ssopab2 4230	. 2 ⊢ (∀𝑥∀𝑦(𝜓 → 𝜒) → {⟨𝑥, 𝑦⟩ ∣ 𝜓} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜒})
4	2, 3	syl 14	1 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜓} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜒})

Syntax hints:   → wi 4  ∀wal 1330   ⊆ wss 3098  {copab 4020

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-ext 2136

This theorem depends on definitions:  df-bi 116  df-nf 1438  df-sb 1740  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-in 3104  df-ss 3111  df-opab 4022

This theorem is referenced by:  xpss12  4686  coss1  4734  coss2  4735  cnvss  4752  shftfvalg  10695  shftfval  10698  sslm  12586