Theorem suppssov1 6075

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

Step	Hyp	Ref	Expression
1		suppssov1.a	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐴 ∈ 𝑉)
2		elex 2748	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
3	1, 2	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐴 ∈ V)
4	3	adantr 276	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴 ∈ V)
5		eldifsni 3721	. . . . . . . 8 ⊢ ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → (𝐴𝑂𝐵) ≠ 𝑍)
6		oveq2 5878	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝐵 → (𝑌𝑂𝑣) = (𝑌𝑂𝐵))
7	6	eqeq1d 2186	. . . . . . . . . . 11 ⊢ (𝑣 = 𝐵 → ((𝑌𝑂𝑣) = 𝑍 ↔ (𝑌𝑂𝐵) = 𝑍))
8		suppssov1.o	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑌𝑂𝑣) = 𝑍)
9	8	ralrimiva 2550	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑣 ∈ 𝑅 (𝑌𝑂𝑣) = 𝑍)
10	9	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ∀𝑣 ∈ 𝑅 (𝑌𝑂𝑣) = 𝑍)
11		suppssov1.b	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐵 ∈ 𝑅)
12	7, 10, 11	rspcdva 2846	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑌𝑂𝐵) = 𝑍)
13		oveq1 5877	. . . . . . . . . . 11 ⊢ (𝐴 = 𝑌 → (𝐴𝑂𝐵) = (𝑌𝑂𝐵))
14	13	eqeq1d 2186	. . . . . . . . . 10 ⊢ (𝐴 = 𝑌 → ((𝐴𝑂𝐵) = 𝑍 ↔ (𝑌𝑂𝐵) = 𝑍))
15	12, 14	syl5ibrcom 157	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴 = 𝑌 → (𝐴𝑂𝐵) = 𝑍))
16	15	necon3d 2391	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝐴𝑂𝐵) ≠ 𝑍 → 𝐴 ≠ 𝑌))
17	5, 16	syl5 32	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → 𝐴 ≠ 𝑌))
18	17	imp 124	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴 ≠ 𝑌)
19		eldifsn 3719	. . . . . 6 ⊢ (𝐴 ∈ (V ∖ {𝑌}) ↔ (𝐴 ∈ V ∧ 𝐴 ≠ 𝑌))
20	4, 18, 19	sylanbrc 417	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐴 ∈ (V ∖ {𝑌}))
21	20	ex 115	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → 𝐴 ∈ (V ∖ {𝑌})))
22	21	ss2rabdv 3236	. . 3 ⊢ (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})} ⊆ {𝑥 ∈ 𝐷 ∣ 𝐴 ∈ (V ∖ {𝑌})})
23		eqid 2177	. . . 4 ⊢ (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) = (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵))
24	23	mptpreima 5119	. . 3 ⊢ (◡(𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) = {𝑥 ∈ 𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})}
25		eqid 2177	. . . 4 ⊢ (𝑥 ∈ 𝐷 ↦ 𝐴) = (𝑥 ∈ 𝐷 ↦ 𝐴)
26	25	mptpreima 5119	. . 3 ⊢ (◡(𝑥 ∈ 𝐷 ↦ 𝐴) “ (V ∖ {𝑌})) = {𝑥 ∈ 𝐷 ∣ 𝐴 ∈ (V ∖ {𝑌})}
27	22, 24, 26	3sstr4g 3198	. 2 ⊢ (𝜑 → (◡(𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) ⊆ (◡(𝑥 ∈ 𝐷 ↦ 𝐴) “ (V ∖ {𝑌})))
28		suppssov1.s	. 2 ⊢ (𝜑 → (◡(𝑥 ∈ 𝐷 ↦ 𝐴) “ (V ∖ {𝑌})) ⊆ 𝐿)
29	27, 28	sstrd 3165	1 ⊢ (𝜑 → (◡(𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) “ (V ∖ {𝑍})) ⊆ 𝐿)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353   ∈ wcel 2148   ≠ wne 2347  ∀wral 2455  {crab 2459  Vcvv 2737   ∖ cdif 3126   ⊆ wss 3129  {csn 3592   ↦ cmpt 4062  ^◡ccnv 4623   “ cima 4627  (class class class)co 5870

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4119  ax-pow 4172  ax-pr 4207

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3809  df-br 4002  df-opab 4063  df-mpt 4064  df-xp 4630  df-rel 4631  df-cnv 4632  df-dm 4634  df-rn 4635  df-res 4636  df-ima 4637  df-iota 5175  df-fv 5221  df-ov 5873

This theorem is referenced by:  suppssof1  6095