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

Theorem sess2 5007
 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 3629 . . 3 (𝐴𝐵 → (∀𝑥𝐵 {𝑦𝐵𝑦𝑅𝑥} ∈ V → ∀𝑥𝐴 {𝑦𝐵𝑦𝑅𝑥} ∈ V))
2 rabss2 3648 . . . . 5 (𝐴𝐵 → {𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐵𝑦𝑅𝑥})
3 ssexg 4732 . . . . . 6 (({𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐵𝑦𝑅𝑥} ∧ {𝑦𝐵𝑦𝑅𝑥} ∈ V) → {𝑦𝐴𝑦𝑅𝑥} ∈ V)
43ex 449 . . . . 5 ({𝑦𝐴𝑦𝑅𝑥} ⊆ {𝑦𝐵𝑦𝑅𝑥} → ({𝑦𝐵𝑦𝑅𝑥} ∈ V → {𝑦𝐴𝑦𝑅𝑥} ∈ V))
52, 4syl 17 . . . 4 (𝐴𝐵 → ({𝑦𝐵𝑦𝑅𝑥} ∈ V → {𝑦𝐴𝑦𝑅𝑥} ∈ V))
65ralimdv 2946 . . 3 (𝐴𝐵 → (∀𝑥𝐴 {𝑦𝐵𝑦𝑅𝑥} ∈ V → ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V))
71, 6syld 46 . 2 (𝐴𝐵 → (∀𝑥𝐵 {𝑦𝐵𝑦𝑅𝑥} ∈ V → ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V))
8 df-se 4998 . 2 (𝑅 Se 𝐵 ↔ ∀𝑥𝐵 {𝑦𝐵𝑦𝑅𝑥} ∈ V)
9 df-se 4998 . 2 (𝑅 Se 𝐴 ↔ ∀𝑥𝐴 {𝑦𝐴𝑦𝑅𝑥} ∈ V)
107, 8, 93imtr4g 284 1 (𝐴𝐵 → (𝑅 Se 𝐵𝑅 Se 𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∈ wcel 1977  ∀wral 2896  {crab 2900  Vcvv 3173   ⊆ wss 3540   class class class wbr 4583   Se wse 4995 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rab 2905  df-v 3175  df-in 3547  df-ss 3554  df-se 4998 This theorem is referenced by:  seeq2  5011  wereu2  5035  wfrlem5  7306  frmin  30983  frrlem5  31028
 Copyright terms: Public domain W3C validator