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

Theorem ressbasd 13272
Description: Base set of a structure restriction. (Contributed by Stefan O'Rear, 26-Nov-2014.) (Proof shortened by AV, 7-Nov-2024.)
Hypotheses
Ref Expression
ressbasd.r (𝜑𝑅 = (𝑊s 𝐴))
ressbasd.b (𝜑𝐵 = (Base‘𝑊))
ressbasd.w (𝜑𝑊𝑋)
ressbasd.a (𝜑𝐴𝑉)
Assertion
Ref Expression
ressbasd (𝜑 → (𝐴𝐵) = (Base‘𝑅))

Proof of Theorem ressbasd
StepHypRef Expression
1 ressbasd.w . . 3 (𝜑𝑊𝑋)
2 ressbasd.a . . . 4 (𝜑𝐴𝑉)
3 inex1g 4245 . . . 4 (𝐴𝑉 → (𝐴 ∩ (Base‘𝑊)) ∈ V)
42, 3syl 14 . . 3 (𝜑 → (𝐴 ∩ (Base‘𝑊)) ∈ V)
5 baseslid 13262 . . . 4 (Base = Slot (Base‘ndx) ∧ (Base‘ndx) ∈ ℕ)
65setsslid 13255 . . 3 ((𝑊𝑋 ∧ (𝐴 ∩ (Base‘𝑊)) ∈ V) → (𝐴 ∩ (Base‘𝑊)) = (Base‘(𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩)))
71, 4, 6syl2anc 411 . 2 (𝜑 → (𝐴 ∩ (Base‘𝑊)) = (Base‘(𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩)))
8 ressbasd.b . . 3 (𝜑𝐵 = (Base‘𝑊))
98ineq2d 3421 . 2 (𝜑 → (𝐴𝐵) = (𝐴 ∩ (Base‘𝑊)))
10 ressbasd.r . . . 4 (𝜑𝑅 = (𝑊s 𝐴))
11 ressvalsets 13269 . . . . 5 ((𝑊𝑋𝐴𝑉) → (𝑊s 𝐴) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
121, 2, 11syl2anc 411 . . . 4 (𝜑 → (𝑊s 𝐴) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
1310, 12eqtrd 2265 . . 3 (𝜑𝑅 = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
1413fveq2d 5673 . 2 (𝜑 → (Base‘𝑅) = (Base‘(𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩)))
157, 9, 143eqtr4d 2275 1 (𝜑 → (𝐴𝐵) = (Base‘𝑅))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2203  Vcvv 2812  cin 3209  cop 3691  cfv 5351  (class class class)co 6049  ndxcnx 13201   sSet csts 13202  Basecbs 13204  s cress 13205
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-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8217  ax-resscn 8218  ax-1re 8220  ax-addrcl 8223
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2814  df-sbc 3042  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-iota 5311  df-fun 5353  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-inn 9237  df-ndx 13207  df-slot 13208  df-base 13210  df-sets 13211  df-iress 13212
This theorem is referenced by:  ressbas2d  13273  ressbasssd  13274  ressbasid  13275  ressressg  13280  grpressid  13766  opprsubgg  14220  subrngpropd  14353  subrgpropd  14390  sralmod  14590  lidlbas  14618
  Copyright terms: Public domain W3C validator