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

Theorem elxp5 7264
Description: Membership in a Cartesian product requiring no quantifiers or dummy variables. Provides a slightly shorter version of elxp4 7263 when the double intersection does not create class existence problems (caused by int0 4630). (Contributed by NM, 1-Aug-2004.)
Assertion
Ref Expression
elxp5 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ 𝐴, ran {𝐴}⟩ ∧ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶)))

Proof of Theorem elxp5
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxp 5276 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)))
2 sneq 4319 . . . . . . . . . . . 12 (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
32rneqd 5496 . . . . . . . . . . 11 (𝐴 = ⟨𝑥, 𝑦⟩ → ran {𝐴} = ran {⟨𝑥, 𝑦⟩})
43unieqd 4586 . . . . . . . . . 10 (𝐴 = ⟨𝑥, 𝑦⟩ → ran {𝐴} = ran {⟨𝑥, 𝑦⟩})
5 vex 3331 . . . . . . . . . . 11 𝑥 ∈ V
6 vex 3331 . . . . . . . . . . 11 𝑦 ∈ V
75, 6op2nda 5769 . . . . . . . . . 10 ran {⟨𝑥, 𝑦⟩} = 𝑦
84, 7syl6req 2799 . . . . . . . . 9 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝑦 = ran {𝐴})
98pm4.71ri 668 . . . . . . . 8 (𝐴 = ⟨𝑥, 𝑦⟩ ↔ (𝑦 = ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
109anbi1i 733 . . . . . . 7 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ ((𝑦 = ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ∧ (𝑥𝐵𝑦𝐶)))
11 anass 684 . . . . . . 7 (((𝑦 = ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ∧ (𝑥𝐵𝑦𝐶)) ↔ (𝑦 = ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))))
1210, 11bitri 264 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ (𝑦 = ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))))
1312exbii 1911 . . . . 5 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ ∃𝑦(𝑦 = ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))))
14 snex 5045 . . . . . . . 8 {𝐴} ∈ V
1514rnex 7253 . . . . . . 7 ran {𝐴} ∈ V
1615uniex 7106 . . . . . 6 ran {𝐴} ∈ V
17 opeq2 4542 . . . . . . . 8 (𝑦 = ran {𝐴} → ⟨𝑥, 𝑦⟩ = ⟨𝑥, ran {𝐴}⟩)
1817eqeq2d 2758 . . . . . . 7 (𝑦 = ran {𝐴} → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, ran {𝐴}⟩))
19 eleq1 2815 . . . . . . . 8 (𝑦 = ran {𝐴} → (𝑦𝐶 ran {𝐴} ∈ 𝐶))
2019anbi2d 742 . . . . . . 7 (𝑦 = ran {𝐴} → ((𝑥𝐵𝑦𝐶) ↔ (𝑥𝐵 ran {𝐴} ∈ 𝐶)))
2118, 20anbi12d 749 . . . . . 6 (𝑦 = ran {𝐴} → ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))))
2216, 21ceqsexv 3370 . . . . 5 (∃𝑦(𝑦 = ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶))) ↔ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶)))
2313, 22bitri 264 . . . 4 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶)))
24 inteq 4618 . . . . . . . 8 (𝐴 = ⟨𝑥, ran {𝐴}⟩ → 𝐴 = 𝑥, ran {𝐴}⟩)
2524inteqd 4620 . . . . . . 7 (𝐴 = ⟨𝑥, ran {𝐴}⟩ → 𝐴 = 𝑥, ran {𝐴}⟩)
265, 16op1stb 5076 . . . . . . 7 𝑥, ran {𝐴}⟩ = 𝑥
2725, 26syl6req 2799 . . . . . 6 (𝐴 = ⟨𝑥, ran {𝐴}⟩ → 𝑥 = 𝐴)
2827pm4.71ri 668 . . . . 5 (𝐴 = ⟨𝑥, ran {𝐴}⟩ ↔ (𝑥 = 𝐴𝐴 = ⟨𝑥, ran {𝐴}⟩))
2928anbi1i 733 . . . 4 ((𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶)) ↔ ((𝑥 = 𝐴𝐴 = ⟨𝑥, ran {𝐴}⟩) ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶)))
30 anass 684 . . . 4 (((𝑥 = 𝐴𝐴 = ⟨𝑥, ran {𝐴}⟩) ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶)) ↔ (𝑥 = 𝐴 ∧ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))))
3123, 29, 303bitri 286 . . 3 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ (𝑥 = 𝐴 ∧ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))))
3231exbii 1911 . 2 (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐵𝑦𝐶)) ↔ ∃𝑥(𝑥 = 𝐴 ∧ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))))
33 eqvisset 3339 . . . . 5 (𝑥 = 𝐴 𝐴 ∈ V)
3433adantr 472 . . . 4 ((𝑥 = 𝐴 ∧ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))) → 𝐴 ∈ V)
3534exlimiv 1995 . . 3 (∃𝑥(𝑥 = 𝐴 ∧ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))) → 𝐴 ∈ V)
36 elex 3340 . . . 4 ( 𝐴𝐵 𝐴 ∈ V)
3736ad2antrl 766 . . 3 ((𝐴 = ⟨ 𝐴, ran {𝐴}⟩ ∧ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶)) → 𝐴 ∈ V)
38 opeq1 4541 . . . . . 6 (𝑥 = 𝐴 → ⟨𝑥, ran {𝐴}⟩ = ⟨ 𝐴, ran {𝐴}⟩)
3938eqeq2d 2758 . . . . 5 (𝑥 = 𝐴 → (𝐴 = ⟨𝑥, ran {𝐴}⟩ ↔ 𝐴 = ⟨ 𝐴, ran {𝐴}⟩))
40 eleq1 2815 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐵 𝐴𝐵))
4140anbi1d 743 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐵 ran {𝐴} ∈ 𝐶) ↔ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶)))
4239, 41anbi12d 749 . . . 4 (𝑥 = 𝐴 → ((𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶)) ↔ (𝐴 = ⟨ 𝐴, ran {𝐴}⟩ ∧ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶))))
4342ceqsexgv 3462 . . 3 ( 𝐴 ∈ V → (∃𝑥(𝑥 = 𝐴 ∧ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))) ↔ (𝐴 = ⟨ 𝐴, ran {𝐴}⟩ ∧ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶))))
4435, 37, 43pm5.21nii 367 . 2 (∃𝑥(𝑥 = 𝐴 ∧ (𝐴 = ⟨𝑥, ran {𝐴}⟩ ∧ (𝑥𝐵 ran {𝐴} ∈ 𝐶))) ↔ (𝐴 = ⟨ 𝐴, ran {𝐴}⟩ ∧ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶)))
451, 32, 443bitri 286 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ 𝐴, ran {𝐴}⟩ ∧ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 383   = wceq 1620  wex 1841  wcel 2127  Vcvv 3328  {csn 4309  cop 4315   cuni 4576   cint 4615   × cxp 5252  ran crn 5255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1859  ax-4 1874  ax-5 1976  ax-6 2042  ax-7 2078  ax-8 2129  ax-9 2136  ax-10 2156  ax-11 2171  ax-12 2184  ax-13 2379  ax-ext 2728  ax-sep 4921  ax-nul 4929  ax-pr 5043  ax-un 7102
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1623  df-ex 1842  df-nf 1847  df-sb 2035  df-eu 2599  df-mo 2600  df-clab 2735  df-cleq 2741  df-clel 2744  df-nfc 2879  df-ral 3043  df-rex 3044  df-rab 3047  df-v 3330  df-dif 3706  df-un 3708  df-in 3710  df-ss 3717  df-nul 4047  df-if 4219  df-sn 4310  df-pr 4312  df-op 4316  df-uni 4577  df-int 4616  df-br 4793  df-opab 4853  df-xp 5260  df-rel 5261  df-cnv 5262  df-dm 5264  df-rn 5265
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator