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

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

Proof of Theorem elxp6
StepHypRef Expression
1 elxp4 7769 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
2 1stval 7833 . . . . 5 (1st𝐴) = dom {𝐴}
3 2ndval 7834 . . . . 5 (2nd𝐴) = ran {𝐴}
42, 3opeq12i 4809 . . . 4 ⟨(1st𝐴), (2nd𝐴)⟩ = ⟨ dom {𝐴}, ran {𝐴}⟩
54eqeq2i 2751 . . 3 (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ↔ 𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩)
62eleq1i 2829 . . . 4 ((1st𝐴) ∈ 𝐵 dom {𝐴} ∈ 𝐵)
73eleq1i 2829 . . . 4 ((2nd𝐴) ∈ 𝐶 ran {𝐴} ∈ 𝐶)
86, 7anbi12i 627 . . 3 (((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶) ↔ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶))
95, 8anbi12i 627 . 2 ((𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
101, 9bitr4i 277 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1539  wcel 2106  {csn 4561  cop 4567   cuni 4839   × cxp 5587  dom cdm 5589  ran crn 5590  cfv 6433  1st c1st 7829  2nd c2nd 7830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fv 6441  df-1st 7831  df-2nd 7832
This theorem is referenced by:  elxp7  7866  eqopi  7867  1st2nd2  7870  eldju2ndl  9682  eldju2ndr  9683  r0weon  9768  qredeu  16363  qnumdencl  16443  setsstruct2  16875  tx1cn  22760  tx2cn  22761  txhaus  22798  psmetxrge0  23466  xppreima  30983  ofpreima2  31003  smatrcl  31746  1stmbfm  32227  2ndmbfm  32228  oddpwdcv  32322  prproropf1olem0  44954
  Copyright terms: Public domain W3C validator