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

Theorem suppssov1 6265
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 2827 . . . . . . . 8 (𝐴𝑉𝐴 ∈ V)
31, 2syl 14 . . . . . . 7 ((𝜑𝑥𝐷) → 𝐴 ∈ V)
43adantr 276 . . . . . 6 (((𝜑𝑥𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴 ∈ V)
5 eldifsni 3824 . . . . . . . 8 ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → (𝐴𝑂𝐵) ≠ 𝑍)
6 oveq2 6060 . . . . . . . . . . . 12 (𝑣 = 𝐵 → (𝑌𝑂𝑣) = (𝑌𝑂𝐵))
76eqeq1d 2243 . . . . . . . . . . 11 (𝑣 = 𝐵 → ((𝑌𝑂𝑣) = 𝑍 ↔ (𝑌𝑂𝐵) = 𝑍))
8 suppssov1.o . . . . . . . . . . . . 13 ((𝜑𝑣𝑅) → (𝑌𝑂𝑣) = 𝑍)
98ralrimiva 2617 . . . . . . . . . . . 12 (𝜑 → ∀𝑣𝑅 (𝑌𝑂𝑣) = 𝑍)
109adantr 276 . . . . . . . . . . 11 ((𝜑𝑥𝐷) → ∀𝑣𝑅 (𝑌𝑂𝑣) = 𝑍)
11 suppssov1.b . . . . . . . . . . 11 ((𝜑𝑥𝐷) → 𝐵𝑅)
127, 10, 11rspcdva 2928 . . . . . . . . . 10 ((𝜑𝑥𝐷) → (𝑌𝑂𝐵) = 𝑍)
13 oveq1 6059 . . . . . . . . . . 11 (𝐴 = 𝑌 → (𝐴𝑂𝐵) = (𝑌𝑂𝐵))
1413eqeq1d 2243 . . . . . . . . . 10 (𝐴 = 𝑌 → ((𝐴𝑂𝐵) = 𝑍 ↔ (𝑌𝑂𝐵) = 𝑍))
1512, 14syl5ibrcom 157 . . . . . . . . 9 ((𝜑𝑥𝐷) → (𝐴 = 𝑌 → (𝐴𝑂𝐵) = 𝑍))
1615necon3d 2458 . . . . . . . 8 ((𝜑𝑥𝐷) → ((𝐴𝑂𝐵) ≠ 𝑍𝐴𝑌))
175, 16syl5 32 . . . . . . 7 ((𝜑𝑥𝐷) → ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → 𝐴𝑌))
1817imp 124 . . . . . 6 (((𝜑𝑥𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴𝑌)
19 eldifsn 3822 . . . . . 6 (𝐴 ∈ (V ∖ {𝑌}) ↔ (𝐴 ∈ V ∧ 𝐴𝑌))
204, 18, 19sylanbrc 417 . . . . 5 (((𝜑𝑥𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴 ∈ (V ∖ {𝑌}))
2120ex 115 . . . 4 ((𝜑𝑥𝐷) → ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → 𝐴 ∈ (V ∖ {𝑌})))
2221ss2rabdv 3321 . . 3 (𝜑 → {𝑥𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})} ⊆ {𝑥𝐷𝐴 ∈ (V ∖ {𝑌})})
23 eqid 2234 . . . 4 (𝑥𝐷 ↦ (𝐴𝑂𝐵)) = (𝑥𝐷 ↦ (𝐴𝑂𝐵))
2423mptpreima 5258 . . 3 ((𝑥𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) = {𝑥𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})}
25 eqid 2234 . . . 4 (𝑥𝐷𝐴) = (𝑥𝐷𝐴)
2625mptpreima 5258 . . 3 ((𝑥𝐷𝐴) “ (V ∖ {𝑌})) = {𝑥𝐷𝐴 ∈ (V ∖ {𝑌})}
2722, 24, 263sstr4g 3283 . 2 (𝜑 → ((𝑥𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) ⊆ ((𝑥𝐷𝐴) “ (V ∖ {𝑌})))
28 suppssov1.s . 2 (𝜑 → ((𝑥𝐷𝐴) “ (V ∖ {𝑌})) ⊆ 𝐿)
2927, 28sstrd 3250 1 (𝜑 → ((𝑥𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) ⊆ 𝐿)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  wne 2414  wral 2522  {crab 2526  Vcvv 2815  cdif 3210  wss 3213  {csn 3691  cmpt 4173  ccnv 4750  cima 4754  (class class class)co 6052
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-opab 4174  df-mpt 4175  df-xp 4757  df-rel 4758  df-cnv 4759  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fv 5362  df-ov 6055
This theorem is referenced by:  suppssof1  6286
  Copyright terms: Public domain W3C validator