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

Theorem fpwwe2lem1 10740
Description: Lemma for fpwwe2 10752. (Contributed by Mario Carneiro, 15-May-2015.)
Hypothesis
Ref Expression
fpwwe2.1 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))}
Assertion
Ref Expression
fpwwe2lem1 𝑊 ⊆ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴))
Distinct variable groups:   𝑦,𝑢,𝑟,𝑥,𝐹   𝐴,𝑟,𝑥   𝑊,𝑟,𝑢,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑦, 𝑢)

Proof of Theorem fpwwe2lem1
StepHypRef Expression
1 simpll 779 . . . . 5 (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) → 𝑥 ⊆ 𝐴)
2 velpw 4565 . . . . 5 (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
31, 2sylibr 237 . . . 4 (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) → 𝑥 ∈ 𝒫 𝐴)
4 simplr 781 . . . . . 6 (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) → 𝑟 ⊆ (𝑥 × 𝑥))
5 xpss12 5670 . . . . . . 7 ((𝑥 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝐴) → (𝑥 × 𝑥) ⊆ (𝐴 × 𝐴))
61, 1, 5syl2anc 596 . . . . . 6 (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) → (𝑥 × 𝑥) ⊆ (𝐴 × 𝐴))
74, 6sstrd 3923 . . . . 5 (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) → 𝑟 ⊆ (𝐴 × 𝐴))
8 velpw 4565 . . . . 5 (𝑟 ∈ 𝒫 (𝐴 × 𝐴) ↔ 𝑟 ⊆ (𝐴 × 𝐴))
97, 8sylibr 237 . . . 4 (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) → 𝑟 ∈ 𝒫 (𝐴 × 𝐴))
103, 9jca 521 . . 3 (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) → (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴)))
1110ssopab2i 5529 . 2 {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} ⊆ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴))}
12 fpwwe2.1 . 2 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))}
13 df-xp 5661 . 2 (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴)) = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑟 ∈ 𝒫 (𝐴 × 𝐴))}
1411, 12, 133sstr4i 3964 1 𝑊 ⊆ (𝒫 𝐴 × 𝒫 (𝐴 × 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  [wsbc 3742   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  {csn 4588  {copab 5170   We wwe 5607   × cxp 5653  ◡ccnv 5654   “ cima 5658  (class class class)co 7440
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-pw 4562  df-opab 5171  df-xp 5661
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator