ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  suppssov1 GIF version

Theorem suppssov1 6047
Description: Formula building theorem for support restrictions: operator with left annihilator. (Contributed by Stefan O'Rear, 9-Mar-2015.)
Hypotheses
Ref Expression
suppssov1.s (𝜑 → ((𝑥𝐷𝐴) “ (V ∖ {𝑌})) ⊆ 𝐿)
suppssov1.o ((𝜑𝑣𝑅) → (𝑌𝑂𝑣) = 𝑍)
suppssov1.a ((𝜑𝑥𝐷) → 𝐴𝑉)
suppssov1.b ((𝜑𝑥𝐷) → 𝐵𝑅)
Assertion
Ref Expression
suppssov1 (𝜑 → ((𝑥𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) ⊆ 𝐿)
Distinct variable groups:   𝜑,𝑣   𝜑,𝑥   𝑣,𝐵   𝑣,𝑂   𝑣,𝑅   𝑣,𝑌   𝑥,𝑌   𝑣,𝑍   𝑥,𝑍
Allowed substitution hints:   𝐴(𝑥,𝑣)   𝐵(𝑥)   𝐷(𝑥,𝑣)   𝑅(𝑥)   𝐿(𝑥,𝑣)   𝑂(𝑥)   𝑉(𝑥,𝑣)

Proof of Theorem suppssov1
StepHypRef Expression
1 suppssov1.a . . . . . . . 8 ((𝜑𝑥𝐷) → 𝐴𝑉)
2 elex 2737 . . . . . . . 8 (𝐴𝑉𝐴 ∈ V)
31, 2syl 14 . . . . . . 7 ((𝜑𝑥𝐷) → 𝐴 ∈ V)
43adantr 274 . . . . . 6 (((𝜑𝑥𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴 ∈ V)
5 eldifsni 3705 . . . . . . . 8 ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → (𝐴𝑂𝐵) ≠ 𝑍)
6 oveq2 5850 . . . . . . . . . . . 12 (𝑣 = 𝐵 → (𝑌𝑂𝑣) = (𝑌𝑂𝐵))
76eqeq1d 2174 . . . . . . . . . . 11 (𝑣 = 𝐵 → ((𝑌𝑂𝑣) = 𝑍 ↔ (𝑌𝑂𝐵) = 𝑍))
8 suppssov1.o . . . . . . . . . . . . 13 ((𝜑𝑣𝑅) → (𝑌𝑂𝑣) = 𝑍)
98ralrimiva 2539 . . . . . . . . . . . 12 (𝜑 → ∀𝑣𝑅 (𝑌𝑂𝑣) = 𝑍)
109adantr 274 . . . . . . . . . . 11 ((𝜑𝑥𝐷) → ∀𝑣𝑅 (𝑌𝑂𝑣) = 𝑍)
11 suppssov1.b . . . . . . . . . . 11 ((𝜑𝑥𝐷) → 𝐵𝑅)
127, 10, 11rspcdva 2835 . . . . . . . . . 10 ((𝜑𝑥𝐷) → (𝑌𝑂𝐵) = 𝑍)
13 oveq1 5849 . . . . . . . . . . 11 (𝐴 = 𝑌 → (𝐴𝑂𝐵) = (𝑌𝑂𝐵))
1413eqeq1d 2174 . . . . . . . . . 10 (𝐴 = 𝑌 → ((𝐴𝑂𝐵) = 𝑍 ↔ (𝑌𝑂𝐵) = 𝑍))
1512, 14syl5ibrcom 156 . . . . . . . . 9 ((𝜑𝑥𝐷) → (𝐴 = 𝑌 → (𝐴𝑂𝐵) = 𝑍))
1615necon3d 2380 . . . . . . . 8 ((𝜑𝑥𝐷) → ((𝐴𝑂𝐵) ≠ 𝑍𝐴𝑌))
175, 16syl5 32 . . . . . . 7 ((𝜑𝑥𝐷) → ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → 𝐴𝑌))
1817imp 123 . . . . . 6 (((𝜑𝑥𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴𝑌)
19 eldifsn 3703 . . . . . 6 (𝐴 ∈ (V ∖ {𝑌}) ↔ (𝐴 ∈ V ∧ 𝐴𝑌))
204, 18, 19sylanbrc 414 . . . . 5 (((𝜑𝑥𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴 ∈ (V ∖ {𝑌}))
2120ex 114 . . . 4 ((𝜑𝑥𝐷) → ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → 𝐴 ∈ (V ∖ {𝑌})))
2221ss2rabdv 3223 . . 3 (𝜑 → {𝑥𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})} ⊆ {𝑥𝐷𝐴 ∈ (V ∖ {𝑌})})
23 eqid 2165 . . . 4 (𝑥𝐷 ↦ (𝐴𝑂𝐵)) = (𝑥𝐷 ↦ (𝐴𝑂𝐵))
2423mptpreima 5097 . . 3 ((𝑥𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) = {𝑥𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})}
25 eqid 2165 . . . 4 (𝑥𝐷𝐴) = (𝑥𝐷𝐴)
2625mptpreima 5097 . . 3 ((𝑥𝐷𝐴) “ (V ∖ {𝑌})) = {𝑥𝐷𝐴 ∈ (V ∖ {𝑌})}
2722, 24, 263sstr4g 3185 . 2 (𝜑 → ((𝑥𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) ⊆ ((𝑥𝐷𝐴) “ (V ∖ {𝑌})))
28 suppssov1.s . 2 (𝜑 → ((𝑥𝐷𝐴) “ (V ∖ {𝑌})) ⊆ 𝐿)
2927, 28sstrd 3152 1 (𝜑 → ((𝑥𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) ⊆ 𝐿)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1343  wcel 2136  wne 2336  wral 2444  {crab 2448  Vcvv 2726  cdif 3113  wss 3116  {csn 3576  cmpt 4043  ccnv 4603  cima 4607  (class class class)co 5842
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-mpt 4045  df-xp 4610  df-rel 4611  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fv 5196  df-ov 5845
This theorem is referenced by:  suppssof1  6067
  Copyright terms: Public domain W3C validator