Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  sess1 Structured version   Visualization version   GIF version

Theorem sess1 5042
 Description: Subset theorem for the set-like predicate. (Contributed by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
sess1 (𝑅𝑆 → (𝑆 Se 𝐴𝑅 Se 𝐴))

Proof of Theorem sess1
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 473 . . . . . 6 ((𝑅𝑆𝑦𝐴) → 𝑅𝑆)
21ssbrd 4656 . . . . 5 ((𝑅𝑆𝑦𝐴) → (𝑦𝑅𝑥𝑦𝑆𝑥))
32ss2rabdv 3662 . . . 4 (𝑅𝑆 → {𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐴𝑦𝑆𝑥})
4 ssexg 4764 . . . . 5 (({𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐴𝑦𝑆𝑥} ∧ {𝑦𝐴𝑦𝑆𝑥} ∈ V) → {𝑦𝐴𝑦𝑅𝑥} ∈ V)
54ex 450 . . . 4 ({𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐴𝑦𝑆𝑥} → ({𝑦𝐴𝑦𝑆𝑥} ∈ V → {𝑦𝐴𝑦𝑅𝑥} ∈ V))
63, 5syl 17 . . 3 (𝑅𝑆 → ({𝑦𝐴𝑦𝑆𝑥} ∈ V → {𝑦𝐴𝑦𝑅𝑥} ∈ V))
76ralimdv 2957 . 2 (𝑅𝑆 → (∀𝑥𝐴 {𝑦𝐴𝑦𝑆𝑥} ∈ V → ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V))
8 df-se 5034 . 2 (𝑆 Se 𝐴 ↔ ∀𝑥𝐴 {𝑦𝐴𝑦𝑆𝑥} ∈ V)
9 df-se 5034 . 2 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V)
107, 8, 93imtr4g 285 1 (𝑅𝑆 → (𝑆 Se 𝐴𝑅 Se 𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   ∈ wcel 1987  ∀wral 2907  {crab 2911  Vcvv 3186   ⊆ wss 3555   class class class wbr 4613   Se wse 5031 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rab 2916  df-v 3188  df-in 3562  df-ss 3569  df-br 4614  df-se 5034 This theorem is referenced by:  seeq1  5046
 Copyright terms: Public domain W3C validator