Theorem ssopab2dv 4015

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 1755	. 2 ⊢ (𝜑 → ∀𝑥∀𝑦(𝜓 → 𝜒))
3		ssopab2 4012	. 2 ⊢ (∀𝑥∀𝑦(𝜓 → 𝜒) → {⟨𝑥, 𝑦⟩ ∣ 𝜓} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜒})
4	2, 3	syl 14	1 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜓} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝜒})

Syntax hints:   → wi 4  ∀wal 1241   ⊆ wss 2917  {copab 3817

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-in 2924  df-ss 2931  df-opab 3819

This theorem is referenced by:  xpss12  4445  coss1  4491  coss2  4492  cnvss  4508  shftfvalg  9419  shftfval  9422