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

Theorem sbthlem1 9082
Description: Lemma for sbth 9092. (Contributed by NM, 22-Mar-1998.)
Hypotheses
Ref Expression
sbthlem.1 𝐴 ∈ V
sbthlem.2 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
Assertion
Ref Expression
sbthlem1 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓   𝑥,𝑔
Allowed substitution hints:   𝐴(𝑓, 𝑔)   𝐵(𝑓, 𝑔)   𝐷(𝑓, 𝑔)

Proof of Theorem sbthlem1
StepHypRef Expression
1 unissb 4908 . 2 ( 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))) ↔ ∀𝑥𝐷 𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
2 sbthlem.2 . . . . 5 𝐷 = {𝑥 ∣ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥))}
32eqabri 2907 . . . 4 (𝑥𝐷 ↔ (𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥)))
4 difss2 4092 . . . . . . 7 ((𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥) → (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ 𝐴)
5 ssconb 4096 . . . . . . . 8 ((𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ 𝐴) → (𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥)))) ↔ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥)))
65exbiri 823 . . . . . . 7 (𝑥𝐴 → ((𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ 𝐴 → ((𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥) → 𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥)))))))
74, 6syl5 35 . . . . . 6 (𝑥𝐴 → ((𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥) → ((𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥) → 𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥)))))))
87pm2.43d 54 . . . . 5 (𝑥𝐴 → ((𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥) → 𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥))))))
98imp 412 . . . 4 ((𝑥𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) ⊆ (𝐴𝑥)) → 𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥)))))
103, 9sylbi 220 . . 3 (𝑥𝐷𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥)))))
11 elssuni 4906 . . . . 5 (𝑥𝐷𝑥 𝐷)
12 imass2 6106 . . . . 5 (𝑥 𝐷 → (𝑓𝑥) ⊆ (𝑓 𝐷))
13 sscon 4097 . . . . 5 ((𝑓𝑥) ⊆ (𝑓 𝐷) → (𝐵 ∖ (𝑓 𝐷)) ⊆ (𝐵 ∖ (𝑓𝑥)))
1411, 12, 133syl 19 . . . 4 (𝑥𝐷 → (𝐵 ∖ (𝑓 𝐷)) ⊆ (𝐵 ∖ (𝑓𝑥)))
15 imass2 6106 . . . 4 ((𝐵 ∖ (𝑓 𝐷)) ⊆ (𝐵 ∖ (𝑓𝑥)) → (𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ (𝑔 “ (𝐵 ∖ (𝑓𝑥))))
16 sscon 4097 . . . 4 ((𝑔 “ (𝐵 ∖ (𝑓 𝐷))) ⊆ (𝑔 “ (𝐵 ∖ (𝑓𝑥))) → (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥)))) ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
1714, 15, 163syl 19 . . 3 (𝑥𝐷 → (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓𝑥)))) ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
1810, 17sstrd 3948 . 2 (𝑥𝐷𝑥 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷)))))
191, 18mprgbir 3088 1 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 𝐷))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  {cab 2743  Vcvv 3457  cdif 3903  wss 3906   cuni 4874  cima 5666
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-cnv 5671  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676
This theorem is used by:  sbthlem2  9083  sbthlem3  9084  sbthlem5  9086
  Copyright terms: Public domain W3C validator