Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elxp8 Structured version   Visualization version   GIF version

Theorem elxp8 37366
Description: Membership in a Cartesian product. This version requires no quantifiers or dummy variables. See also elxp7 8006. (Contributed by ML, 19-Oct-2020.)
Assertion
Ref Expression
elxp8 (𝐴 ∈ (𝐵 × 𝐶) ↔ ((1st𝐴) ∈ 𝐵𝐴 ∈ (V × 𝐶)))

Proof of Theorem elxp8
StepHypRef Expression
1 xp1st 8003 . . 3 (𝐴 ∈ (𝐵 × 𝐶) → (1st𝐴) ∈ 𝐵)
2 ssv 3974 . . . . 5 𝐵 ⊆ V
3 ssid 3972 . . . . 5 𝐶𝐶
4 xpss12 5656 . . . . 5 ((𝐵 ⊆ V ∧ 𝐶𝐶) → (𝐵 × 𝐶) ⊆ (V × 𝐶))
52, 3, 4mp2an 692 . . . 4 (𝐵 × 𝐶) ⊆ (V × 𝐶)
65sseli 3945 . . 3 (𝐴 ∈ (𝐵 × 𝐶) → 𝐴 ∈ (V × 𝐶))
71, 6jca 511 . 2 (𝐴 ∈ (𝐵 × 𝐶) → ((1st𝐴) ∈ 𝐵𝐴 ∈ (V × 𝐶)))
8 xpss 5657 . . . . 5 (V × 𝐶) ⊆ (V × V)
98sseli 3945 . . . 4 (𝐴 ∈ (V × 𝐶) → 𝐴 ∈ (V × V))
109adantl 481 . . 3 (((1st𝐴) ∈ 𝐵𝐴 ∈ (V × 𝐶)) → 𝐴 ∈ (V × V))
11 xp2nd 8004 . . . 4 (𝐴 ∈ (V × 𝐶) → (2nd𝐴) ∈ 𝐶)
1211anim2i 617 . . 3 (((1st𝐴) ∈ 𝐵𝐴 ∈ (V × 𝐶)) → ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶))
13 elxp7 8006 . . 3 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))
1410, 12, 13sylanbrc 583 . 2 (((1st𝐴) ∈ 𝐵𝐴 ∈ (V × 𝐶)) → 𝐴 ∈ (𝐵 × 𝐶))
157, 14impbii 209 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ ((1st𝐴) ∈ 𝐵𝐴 ∈ (V × 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wcel 2109  Vcvv 3450  wss 3917   × cxp 5639  cfv 6514  1st c1st 7969  2nd c2nd 7970
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-iota 6467  df-fun 6516  df-fv 6522  df-1st 7971  df-2nd 7972
This theorem is referenced by:  finxpsuclem  37392
  Copyright terms: Public domain W3C validator