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

Theorem elxp6 5998
Description: Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 4962. (Contributed by NM, 9-Oct-2004.)
Assertion
Ref Expression
elxp6 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))

Proof of Theorem elxp6
StepHypRef Expression
1 elex 2652 . 2 (𝐴 ∈ (𝐵 × 𝐶) → 𝐴 ∈ V)
2 opexg 4088 . . . 4 (((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶) → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ V)
32adantl 273 . . 3 ((𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ V)
4 eleq1 2162 . . . 4 (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ → (𝐴 ∈ V ↔ ⟨(1st𝐴), (2nd𝐴)⟩ ∈ V))
54adantr 272 . . 3 ((𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) → (𝐴 ∈ V ↔ ⟨(1st𝐴), (2nd𝐴)⟩ ∈ V))
63, 5mpbird 166 . 2 ((𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) → 𝐴 ∈ V)
7 1stvalg 5971 . . . . . 6 (𝐴 ∈ V → (1st𝐴) = dom {𝐴})
8 2ndvalg 5972 . . . . . 6 (𝐴 ∈ V → (2nd𝐴) = ran {𝐴})
97, 8opeq12d 3660 . . . . 5 (𝐴 ∈ V → ⟨(1st𝐴), (2nd𝐴)⟩ = ⟨ dom {𝐴}, ran {𝐴}⟩)
109eqeq2d 2111 . . . 4 (𝐴 ∈ V → (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ↔ 𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩))
117eleq1d 2168 . . . . 5 (𝐴 ∈ V → ((1st𝐴) ∈ 𝐵 dom {𝐴} ∈ 𝐵))
128eleq1d 2168 . . . . 5 (𝐴 ∈ V → ((2nd𝐴) ∈ 𝐶 ran {𝐴} ∈ 𝐶))
1311, 12anbi12d 460 . . . 4 (𝐴 ∈ V → (((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶) ↔ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
1410, 13anbi12d 460 . . 3 (𝐴 ∈ V → ((𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶))))
15 elxp4 4962 . . 3 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
1614, 15syl6rbbr 198 . 2 (𝐴 ∈ V → (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶))))
171, 6, 16pm5.21nii 661 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))
Colors of variables: wff set class
Syntax hints:  wa 103  wb 104   = wceq 1299  wcel 1448  Vcvv 2641  {csn 3474  cop 3477   cuni 3683   × cxp 4475  dom cdm 4477  ran crn 4478  cfv 5059  1st c1st 5967  2nd c2nd 5968
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-sep 3986  ax-pow 4038  ax-pr 4069  ax-un 4293
This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-rex 2381  df-v 2643  df-sbc 2863  df-un 3025  df-in 3027  df-ss 3034  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-br 3876  df-opab 3930  df-mpt 3931  df-id 4153  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-iota 5024  df-fun 5061  df-fv 5067  df-1st 5969  df-2nd 5970
This theorem is referenced by:  elxp7  5999  eqopi  6000  1st2nd2  6003  eldju2ndl  6872  eldju2ndr  6873  qredeu  11571  qnumdencl  11657  tx1cn  12219  tx2cn  12220  psmetxrge0  12260
  Copyright terms: Public domain W3C validator