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

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

Proof of Theorem sess2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssralv 4011 . . 3 (𝐴𝐵 → (∀𝑥𝐵 {𝑦𝐵𝑦𝑅𝑥} ∈ V → ∀𝑥𝐴 {𝑦𝐵𝑦𝑅𝑥} ∈ V))
2 rabss2 4036 . . . . 5 (𝐴𝐵 → {𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐵𝑦𝑅𝑥})
3 ssexg 5281 . . . . . 6 (({𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐵𝑦𝑅𝑥} ∧ {𝑦𝐵𝑦𝑅𝑥} ∈ V) → {𝑦𝐴𝑦𝑅𝑥} ∈ V)
43ex 414 . . . . 5 ({𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐵𝑦𝑅𝑥} → ({𝑦𝐵𝑦𝑅𝑥} ∈ V → {𝑦𝐴𝑦𝑅𝑥} ∈ V))
52, 4syl 17 . . . 4 (𝐴𝐵 → ({𝑦𝐵𝑦𝑅𝑥} ∈ V → {𝑦𝐴𝑦𝑅𝑥} ∈ V))
65ralimdv 3167 . . 3 (𝐴𝐵 → (∀𝑥𝐴 {𝑦𝐵𝑦𝑅𝑥} ∈ V → ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V))
71, 6syld 47 . 2 (𝐴𝐵 → (∀𝑥𝐵 {𝑦𝐵𝑦𝑅𝑥} ∈ V → ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V))
8 df-se 5590 . 2 (𝑅 Se 𝐵 ↔ ∀𝑥𝐵 {𝑦𝐵𝑦𝑅𝑥} ∈ V)
9 df-se 5590 . 2 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V)
107, 8, 93imtr4g 296 1 (𝐴𝐵 → (𝑅 Se 𝐵𝑅 Se 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2107  wral 3065  {crab 3408  Vcvv 3446  wss 3911   class class class wbr 5106   Se wse 5587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2708  ax-sep 5257
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2890  df-ral 3066  df-rab 3409  df-v 3448  df-in 3918  df-ss 3928  df-se 5590
This theorem is referenced by:  seeq2  5607  wereu2  5631  frpomin  6295  fprlem1  8232  wfrlem5OLD  8260  frmin  9686  frrlem15  9694
  Copyright terms: Public domain W3C validator