Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  setsnidel Structured version   Visualization version   GIF version

Theorem setsnidel 48793
Description: The injected slot is an element of the structure with replacement. (Contributed by AV, 10-Nov-2021.)
Hypotheses
Ref Expression
setsidel.s (𝜑 → 𝑆 ∈ 𝑉)
setsidel.b (𝜑 → 𝐵 ∈ 𝑊)
setsidel.r 𝑅 = (𝑆 sSet ⟨𝐴, 𝐵⟩)
setsnidel.c (𝜑 → 𝐶 ∈ 𝑋)
setsnidel.d (𝜑 → 𝐷 ∈ 𝑌)
setsnidel.s (𝜑 → ⟨𝐶, 𝐷⟩ ∈ 𝑆)
setsnidel.n (𝜑 → 𝐴 ≠ 𝐶)
Assertion
Ref Expression
setsnidel (𝜑 → ⟨𝐶, 𝐷⟩ ∈ 𝑅)

Proof of Theorem setsnidel
StepHypRef Expression
1 setsnidel.c . . . . . 6 (𝜑 → 𝐶 ∈ 𝑋)
21elexd 3477 . . . . 5 (𝜑 → 𝐶 ∈ V)
3 setsnidel.n . . . . . 6 (𝜑 → 𝐴 ≠ 𝐶)
43necomd 3014 . . . . 5 (𝜑 → 𝐶 ≠ 𝐴)
5 eldifsn 4750 . . . . 5 (𝐶 ∈ (V ∖ {𝐴}) ↔ (𝐶 ∈ V ∧ 𝐶 ≠ 𝐴))
62, 4, 5sylanbrc 595 . . . 4 (𝜑 → 𝐶 ∈ (V ∖ {𝐴}))
7 setsnidel.s . . . 4 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ 𝑆)
8 setsnidel.d . . . . 5 (𝜑 → 𝐷 ∈ 𝑌)
9 opelres 5992 . . . . 5 (𝐷 ∈ 𝑌 → (⟨𝐶, 𝐷⟩ ∈ (𝑆 ↾ (V ∖ {𝐴})) ↔ (𝐶 ∈ (V ∖ {𝐴}) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑆)))
108, 9syl 18 . . . 4 (𝜑 → (⟨𝐶, 𝐷⟩ ∈ (𝑆 ↾ (V ∖ {𝐴})) ↔ (𝐶 ∈ (V ∖ {𝐴}) ∧ ⟨𝐶, 𝐷⟩ ∈ 𝑆)))
116, 7, 10mpbir2and 726 . . 3 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (𝑆 ↾ (V ∖ {𝐴})))
12 elun1 4183 . . 3 (⟨𝐶, 𝐷⟩ ∈ (𝑆 ↾ (V ∖ {𝐴})) → ⟨𝐶, 𝐷⟩ ∈ ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐵⟩}))
1311, 12syl 18 . 2 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐵⟩}))
14 setsidel.r . . 3 𝑅 = (𝑆 sSet ⟨𝐴, 𝐵⟩)
15 setsidel.s . . . 4 (𝜑 → 𝑆 ∈ 𝑉)
16 setsidel.b . . . 4 (𝜑 → 𝐵 ∈ 𝑊)
17 setsval 17389 . . . 4 ((𝑆 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑆 sSet ⟨𝐴, 𝐵⟩) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐵⟩}))
1815, 16, 17syl2anc 596 . . 3 (𝜑 → (𝑆 sSet ⟨𝐴, 𝐵⟩) = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐵⟩}))
1914, 18eqtrid 2810 . 2 (𝜑 → 𝑅 = ((𝑆 ↾ (V ∖ {𝐴})) ∪ {⟨𝐴, 𝐵⟩}))
2013, 19eleqtrrd 2867 1 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ 𝑅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ∖ cdif 4048   ∪ cun 4152  {csn 4588  ⟨cop 4840   ↾ cres 5660  (class class class)co 7451   sSet csts 17385
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-sets 17386
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator