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

Theorem elima4 33132
Description: Quantifier-free expression saying that a class is a member of an image. (Contributed by Scott Fenton, 8-May-2018.)
Assertion
Ref Expression
elima4 (𝐴 ∈ (𝑅𝐵) ↔ (𝑅 ∩ (𝐵 × {𝐴})) ≠ ∅)

Proof of Theorem elima4
Dummy variables 𝑥 𝑝 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3459 . 2 (𝐴 ∈ (𝑅𝐵) → 𝐴 ∈ V)
2 xpeq2 5540 . . . . . . 7 ({𝐴} = ∅ → (𝐵 × {𝐴}) = (𝐵 × ∅))
3 xp0 5982 . . . . . . 7 (𝐵 × ∅) = ∅
42, 3eqtrdi 2849 . . . . . 6 ({𝐴} = ∅ → (𝐵 × {𝐴}) = ∅)
54ineq2d 4139 . . . . 5 ({𝐴} = ∅ → (𝑅 ∩ (𝐵 × {𝐴})) = (𝑅 ∩ ∅))
6 in0 4299 . . . . 5 (𝑅 ∩ ∅) = ∅
75, 6eqtrdi 2849 . . . 4 ({𝐴} = ∅ → (𝑅 ∩ (𝐵 × {𝐴})) = ∅)
87necon3i 3019 . . 3 ((𝑅 ∩ (𝐵 × {𝐴})) ≠ ∅ → {𝐴} ≠ ∅)
9 snnzb 4614 . . 3 (𝐴 ∈ V ↔ {𝐴} ≠ ∅)
108, 9sylibr 237 . 2 ((𝑅 ∩ (𝐵 × {𝐴})) ≠ ∅ → 𝐴 ∈ V)
11 eleq1 2877 . . 3 (𝑥 = 𝐴 → (𝑥 ∈ (𝑅𝐵) ↔ 𝐴 ∈ (𝑅𝐵)))
12 sneq 4535 . . . . . 6 (𝑥 = 𝐴 → {𝑥} = {𝐴})
1312xpeq2d 5549 . . . . 5 (𝑥 = 𝐴 → (𝐵 × {𝑥}) = (𝐵 × {𝐴}))
1413ineq2d 4139 . . . 4 (𝑥 = 𝐴 → (𝑅 ∩ (𝐵 × {𝑥})) = (𝑅 ∩ (𝐵 × {𝐴})))
1514neeq1d 3046 . . 3 (𝑥 = 𝐴 → ((𝑅 ∩ (𝐵 × {𝑥})) ≠ ∅ ↔ (𝑅 ∩ (𝐵 × {𝐴})) ≠ ∅))
16 elin 3897 . . . . . . 7 (𝑝 ∈ (𝑅 ∩ (𝐵 × {𝑥})) ↔ (𝑝𝑅𝑝 ∈ (𝐵 × {𝑥})))
17 ancom 464 . . . . . . 7 ((𝑝𝑅𝑝 ∈ (𝐵 × {𝑥})) ↔ (𝑝 ∈ (𝐵 × {𝑥}) ∧ 𝑝𝑅))
18 elxp 5542 . . . . . . . 8 (𝑝 ∈ (𝐵 × {𝑥}) ↔ ∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})))
1918anbi1i 626 . . . . . . 7 ((𝑝 ∈ (𝐵 × {𝑥}) ∧ 𝑝𝑅) ↔ (∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅))
2016, 17, 193bitri 300 . . . . . 6 (𝑝 ∈ (𝑅 ∩ (𝐵 × {𝑥})) ↔ (∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅))
2120exbii 1849 . . . . 5 (∃𝑝 𝑝 ∈ (𝑅 ∩ (𝐵 × {𝑥})) ↔ ∃𝑝(∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅))
22 anass 472 . . . . . . . . 9 (((𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅) ↔ (𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)))
23222exbii 1850 . . . . . . . 8 (∃𝑦𝑧((𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅) ↔ ∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)))
24 19.41vv 1951 . . . . . . . 8 (∃𝑦𝑧((𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅) ↔ (∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅))
2523, 24bitr3i 280 . . . . . . 7 (∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)) ↔ (∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅))
2625exbii 1849 . . . . . 6 (∃𝑝𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)) ↔ ∃𝑝(∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅))
27 exrot3 2169 . . . . . 6 (∃𝑝𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)) ↔ ∃𝑦𝑧𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)))
2826, 27bitr3i 280 . . . . 5 (∃𝑝(∃𝑦𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ {𝑥})) ∧ 𝑝𝑅) ↔ ∃𝑦𝑧𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)))
29 opex 5321 . . . . . . . . 9 𝑦, 𝑧⟩ ∈ V
30 eleq1 2877 . . . . . . . . . 10 (𝑝 = ⟨𝑦, 𝑧⟩ → (𝑝𝑅 ↔ ⟨𝑦, 𝑧⟩ ∈ 𝑅))
3130anbi2d 631 . . . . . . . . 9 (𝑝 = ⟨𝑦, 𝑧⟩ → (((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅) ↔ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)))
3229, 31ceqsexv 3489 . . . . . . . 8 (∃𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)) ↔ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅))
3332exbii 1849 . . . . . . 7 (∃𝑧𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)) ↔ ∃𝑧((𝑦𝐵𝑧 ∈ {𝑥}) ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅))
34 anass 472 . . . . . . . . 9 (((𝑦𝐵𝑧 ∈ {𝑥}) ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅) ↔ (𝑦𝐵 ∧ (𝑧 ∈ {𝑥} ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)))
35 an12 644 . . . . . . . . 9 ((𝑦𝐵 ∧ (𝑧 ∈ {𝑥} ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)) ↔ (𝑧 ∈ {𝑥} ∧ (𝑦𝐵 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)))
36 velsn 4541 . . . . . . . . . 10 (𝑧 ∈ {𝑥} ↔ 𝑧 = 𝑥)
3736anbi1i 626 . . . . . . . . 9 ((𝑧 ∈ {𝑥} ∧ (𝑦𝐵 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)) ↔ (𝑧 = 𝑥 ∧ (𝑦𝐵 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)))
3834, 35, 373bitri 300 . . . . . . . 8 (((𝑦𝐵𝑧 ∈ {𝑥}) ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅) ↔ (𝑧 = 𝑥 ∧ (𝑦𝐵 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)))
3938exbii 1849 . . . . . . 7 (∃𝑧((𝑦𝐵𝑧 ∈ {𝑥}) ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅) ↔ ∃𝑧(𝑧 = 𝑥 ∧ (𝑦𝐵 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)))
40 vex 3444 . . . . . . . 8 𝑥 ∈ V
41 opeq2 4765 . . . . . . . . . 10 (𝑧 = 𝑥 → ⟨𝑦, 𝑧⟩ = ⟨𝑦, 𝑥⟩)
4241eleq1d 2874 . . . . . . . . 9 (𝑧 = 𝑥 → (⟨𝑦, 𝑧⟩ ∈ 𝑅 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝑅))
4342anbi2d 631 . . . . . . . 8 (𝑧 = 𝑥 → ((𝑦𝐵 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅) ↔ (𝑦𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ 𝑅)))
4440, 43ceqsexv 3489 . . . . . . 7 (∃𝑧(𝑧 = 𝑥 ∧ (𝑦𝐵 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝑅)) ↔ (𝑦𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ 𝑅))
4533, 39, 443bitri 300 . . . . . 6 (∃𝑧𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)) ↔ (𝑦𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ 𝑅))
4645exbii 1849 . . . . 5 (∃𝑦𝑧𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐵𝑧 ∈ {𝑥}) ∧ 𝑝𝑅)) ↔ ∃𝑦(𝑦𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ 𝑅))
4721, 28, 463bitri 300 . . . 4 (∃𝑝 𝑝 ∈ (𝑅 ∩ (𝐵 × {𝑥})) ↔ ∃𝑦(𝑦𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ 𝑅))
48 n0 4260 . . . 4 ((𝑅 ∩ (𝐵 × {𝑥})) ≠ ∅ ↔ ∃𝑝 𝑝 ∈ (𝑅 ∩ (𝐵 × {𝑥})))
4940elima3 5903 . . . 4 (𝑥 ∈ (𝑅𝐵) ↔ ∃𝑦(𝑦𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ 𝑅))
5047, 48, 493bitr4ri 307 . . 3 (𝑥 ∈ (𝑅𝐵) ↔ (𝑅 ∩ (𝐵 × {𝑥})) ≠ ∅)
5111, 15, 50vtoclbg 3517 . 2 (𝐴 ∈ V → (𝐴 ∈ (𝑅𝐵) ↔ (𝑅 ∩ (𝐵 × {𝐴})) ≠ ∅))
521, 10, 51pm5.21nii 383 1 (𝐴 ∈ (𝑅𝐵) ↔ (𝑅 ∩ (𝐵 × {𝐴})) ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399   = wceq 1538  wex 1781  wcel 2111  wne 2987  Vcvv 3441  cin 3880  c0 4243  {csn 4525  cop 4531   × cxp 5517  cima 5522
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-br 5031  df-opab 5093  df-xp 5525  df-rel 5526  df-cnv 5527  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator