Theorem oprcl 3832

Description: If an ordered pair has an element, then its arguments are sets. (Contributed by Mario Carneiro, 26-Apr-2015.)

Assertion

Ref	Expression
oprcl	⊢ (𝐶 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Proof of Theorem oprcl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex2 2779	. 2 ⊢ (𝐶 ∈ ⟨𝐴, 𝐵⟩ → ∃𝑦 𝑦 ∈ ⟨𝐴, 𝐵⟩)
2		df-op 3631	. . . . . . 7 ⊢ ⟨𝐴, 𝐵⟩ = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}
3	2	eleq2i 2263	. . . . . 6 ⊢ (𝑦 ∈ ⟨𝐴, 𝐵⟩ ↔ 𝑦 ∈ {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})})
4		df-clab 2183	. . . . . 6 ⊢ (𝑦 ∈ {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} ↔ [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))
5	3, 4	bitri 184	. . . . 5 ⊢ (𝑦 ∈ ⟨𝐴, 𝐵⟩ ↔ [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))
6		3simpa 996	. . . . . 6 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
7	6	sbimi 1778	. . . . 5 ⊢ ([𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) → [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V))
8	5, 7	sylbi 121	. . . 4 ⊢ (𝑦 ∈ ⟨𝐴, 𝐵⟩ → [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V))
9		nfv 1542	. . . . 5 ⊢ Ⅎ𝑥(𝐴 ∈ V ∧ 𝐵 ∈ V)
10	9	sbf 1791	. . . 4 ⊢ ([𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
11	8, 10	sylib 122	. . 3 ⊢ (𝑦 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))
12	11	exlimiv 1612	. 2 ⊢ (∃𝑦 𝑦 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))
13	1, 12	syl 14	1 ⊢ (𝐶 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980  ∃wex 1506  [wsb 1776   ∈ wcel 2167  {cab 2182  Vcvv 2763  {csn 3622  {cpr 3623  ⟨cop 3625

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1461  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-3an 982  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-v 2765  df-op 3631

This theorem is referenced by:  opth1  4269  opth  4270  0nelop  4281