ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oprcl GIF version

Theorem oprcl 3817
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.
StepHypRef Expression
1 elex2 2768 . 2 (𝐶 ∈ ⟨𝐴, 𝐵⟩ → ∃𝑦 𝑦 ∈ ⟨𝐴, 𝐵⟩)
2 df-op 3616 . . . . . . 7 𝐴, 𝐵⟩ = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}
32eleq2i 2256 . . . . . 6 (𝑦 ∈ ⟨𝐴, 𝐵⟩ ↔ 𝑦 ∈ {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})})
4 df-clab 2176 . . . . . 6 (𝑦 ∈ {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} ↔ [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))
53, 4bitri 184 . . . . 5 (𝑦 ∈ ⟨𝐴, 𝐵⟩ ↔ [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))
6 3simpa 996 . . . . . 6 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
76sbimi 1775 . . . . 5 ([𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) → [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V))
85, 7sylbi 121 . . . 4 (𝑦 ∈ ⟨𝐴, 𝐵⟩ → [𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V))
9 nfv 1539 . . . . 5 𝑥(𝐴 ∈ V ∧ 𝐵 ∈ V)
109sbf 1788 . . . 4 ([𝑦 / 𝑥](𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
118, 10sylib 122 . . 3 (𝑦 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))
1211exlimiv 1609 . 2 (∃𝑦 𝑦 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))
131, 12syl 14 1 (𝐶 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980  wex 1503  [wsb 1773  wcel 2160  {cab 2175  Vcvv 2752  {csn 3607  {cpr 3608  cop 3610
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 1458  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-3an 982  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-v 2754  df-op 3616
This theorem is referenced by:  opth1  4254  opth  4255  0nelop  4266
  Copyright terms: Public domain W3C validator