Metamath Proof Explorer


Theorem ressbas

Description: Base set of a structure restriction. (Contributed by Stefan O'Rear, 26-Nov-2014) (Proof shortened by AV, 7-Nov-2024)

Ref Expression
Hypotheses ressbas.r ⊢ R = W ↾ 𝑠 A
ressbas.b ⊢ B = Base W
Assertion ressbas ⊢ A ∈ V → A ∩ B = Base R

Proof

Step Hyp Ref Expression
1 ressbas.r ⊢ R = W ↾ 𝑠 A
2 ressbas.b ⊢ B = Base W
3 simp1 ⊢ B ⊆ A ∧ W ∈ V ∧ A ∈ V → B ⊆ A
4 sseqin2 ⊢ B ⊆ A ↔ A ∩ B = B
5 3 4 sylib ⊢ B ⊆ A ∧ W ∈ V ∧ A ∈ V → A ∩ B = B
6 1 2 ressid2 ⊢ B ⊆ A ∧ W ∈ V ∧ A ∈ V → R = W
7 6 fveq2d ⊢ B ⊆ A ∧ W ∈ V ∧ A ∈ V → Base R = Base W
8 2 5 7 3eqtr4a ⊢ B ⊆ A ∧ W ∈ V ∧ A ∈ V → A ∩ B = Base R
9 8 3expib ⊢ B ⊆ A → W ∈ V ∧ A ∈ V → A ∩ B = Base R
10 simp2 ⊢ ¬ B ⊆ A ∧ W ∈ V ∧ A ∈ V → W ∈ V
11 2 fvexi ⊢ B ∈ V
12 11 inex2 ⊢ A ∩ B ∈ V
13 baseid ⊢ Base = Slot Base ndx
14 13 setsid ⊢ W ∈ V ∧ A ∩ B ∈ V → A ∩ B = Base W sSet Base ndx A ∩ B
15 10 12 14 sylancl ⊢ ¬ B ⊆ A ∧ W ∈ V ∧ A ∈ V → A ∩ B = Base W sSet Base ndx A ∩ B
16 1 2 ressval2 ⊢ ¬ B ⊆ A ∧ W ∈ V ∧ A ∈ V → R = W sSet Base ndx A ∩ B
17 16 fveq2d ⊢ ¬ B ⊆ A ∧ W ∈ V ∧ A ∈ V → Base R = Base W sSet Base ndx A ∩ B
18 15 17 eqtr4d ⊢ ¬ B ⊆ A ∧ W ∈ V ∧ A ∈ V → A ∩ B = Base R
19 18 3expib ⊢ ¬ B ⊆ A → W ∈ V ∧ A ∈ V → A ∩ B = Base R
20 9 19 pm2.61i ⊢ W ∈ V ∧ A ∈ V → A ∩ B = Base R
21 in0 ⊢ A ∩ ∅ = ∅
22 fvprc ⊢ ¬ W ∈ V → Base W = ∅
23 2 22 eqtrid ⊢ ¬ W ∈ V → B = ∅
24 23 ineq2d ⊢ ¬ W ∈ V → A ∩ B = A ∩ ∅
25 21 24 22 3eqtr4a ⊢ ¬ W ∈ V → A ∩ B = Base W
26 base0 ⊢ ∅ = Base ∅
27 26 eqcomi ⊢ Base ∅ = ∅
28 reldmress ⊢ Rel ⁡ dom ⁡ ↾ 𝑠
29 27 1 28 oveqprc ⊢ ¬ W ∈ V → Base W = Base R
30 25 29 eqtrd ⊢ ¬ W ∈ V → A ∩ B = Base R
31 30 adantr ⊢ ¬ W ∈ V ∧ A ∈ V → A ∩ B = Base R
32 20 31 pm2.61ian ⊢ A ∈ V → A ∩ B = Base R