MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elxp6 Structured version   Visualization version   GIF version

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

Proof of Theorem elxp6
StepHypRef Expression
1 elxp4 7945 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
2 1stval 8015 . . . . 5 (1st𝐴) = dom {𝐴}
3 2ndval 8016 . . . . 5 (2nd𝐴) = ran {𝐴}
42, 3opeq12i 4883 . . . 4 ⟨(1st𝐴), (2nd𝐴)⟩ = ⟨ dom {𝐴}, ran {𝐴}⟩
54eqeq2i 2748 . . 3 (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ↔ 𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩)
62eleq1i 2830 . . . 4 ((1st𝐴) ∈ 𝐵 dom {𝐴} ∈ 𝐵)
73eleq1i 2830 . . . 4 ((2nd𝐴) ∈ 𝐶 ran {𝐴} ∈ 𝐶)
86, 7anbi12i 628 . . 3 (((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶) ↔ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶))
95, 8anbi12i 628 . 2 ((𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
101, 9bitr4i 278 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1537  wcel 2106  {csn 4631  cop 4637   cuni 4912   × cxp 5687  dom cdm 5689  ran crn 5690  cfv 6563  1st c1st 8011  2nd c2nd 8012
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-iota 6516  df-fun 6565  df-fv 6571  df-1st 8013  df-2nd 8014
This theorem is referenced by:  elxp7  8048  eqopi  8049  1st2nd2  8052  eldju2ndl  9962  eldju2ndr  9963  r0weon  10050  qredeu  16692  qnumdencl  16773  setsstruct2  17208  tx1cn  23633  tx2cn  23634  txhaus  23671  psmetxrge0  24339  xppreima  32662  ofpreima2  32683  smatrcl  33757  1stmbfm  34242  2ndmbfm  34243  oddpwdcv  34337  prproropf1olem0  47427
  Copyright terms: Public domain W3C validator