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

Theorem elopabi 5848
 Description: A consequence of membership in an ordered-pair class abstraction, using ordered pair extractors. (Contributed by NM, 29-Aug-2006.)
Hypotheses
Ref Expression
elopabi.1 (𝑥 = (1st𝐴) → (𝜑𝜓))
elopabi.2 (𝑦 = (2nd𝐴) → (𝜓𝜒))
Assertion
Ref Expression
elopabi (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → 𝜒)
Distinct variable groups:   𝑥,𝑦,𝐴   𝜒,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem elopabi
StepHypRef Expression
1 relopab 4491 . . . 4 Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑}
2 1st2nd 5834 . . . 4 ((Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑} ∧ 𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
31, 2mpan 408 . . 3 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
4 id 19 . . 3 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → 𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
53, 4eqeltrrd 2131 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
6 1stexg 5821 . . 3 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → (1st𝐴) ∈ V)
7 2ndexg 5822 . . 3 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → (2nd𝐴) ∈ V)
8 elopabi.1 . . . 4 (𝑥 = (1st𝐴) → (𝜑𝜓))
9 elopabi.2 . . . 4 (𝑦 = (2nd𝐴) → (𝜓𝜒))
108, 9opelopabg 4032 . . 3 (((1st𝐴) ∈ V ∧ (2nd𝐴) ∈ V) → (⟨(1st𝐴), (2nd𝐴)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))
116, 7, 10syl2anc 397 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → (⟨(1st𝐴), (2nd𝐴)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒))
125, 11mpbid 139 1 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → 𝜒)
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 102   = wceq 1259   ∈ wcel 1409  Vcvv 2574  ⟨cop 3405  {copab 3844  Rel wrel 4377  ‘cfv 4929  1st c1st 5792  2nd c2nd 5793 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-sbc 2787  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-br 3792  df-opab 3846  df-mpt 3847  df-id 4057  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-fo 4935  df-fv 4937  df-1st 5794  df-2nd 5795 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator