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

Theorem fpwwelem 10657
Description: Lemma for fpwwe 10658. (Contributed by Mario Carneiro, 15-May-2015.) (Revised by AV, 20-Jul-2024.)
Hypotheses
Ref Expression
fpwwe.1 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦))}
fpwwe.2 (𝜑𝐴𝑉)
Assertion
Ref Expression
fpwwelem (𝜑 → (𝑋𝑊𝑅 ↔ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))))
Distinct variable groups:   𝑥,𝑟,𝐴   𝑦,𝑟,𝐹,𝑥   𝜑,𝑟,𝑥,𝑦   𝑅,𝑟,𝑥,𝑦   𝑋,𝑟,𝑥,𝑦   𝑊,𝑟,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑦)   𝑉(𝑥, 𝑦, 𝑟)

Proof of Theorem fpwwelem
StepHypRef Expression
1 fpwwe.1 . . . . 5 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦))}
21relopabiv 5801 . . . 4 Rel 𝑊
32a1i 11 . . 3 (𝜑 → Rel 𝑊)
4 brrelex12 5707 . . 3 ((Rel 𝑊𝑋𝑊𝑅) → (𝑋 ∈ V ∧ 𝑅 ∈ V))
53, 4sylan 592 . 2 ((𝜑𝑋𝑊𝑅) → (𝑋 ∈ V ∧ 𝑅 ∈ V))
6 fpwwe.2 . . . . 5 (𝜑𝐴𝑉)
76adantr 486 . . . 4 ((𝜑 ∧ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))) → 𝐴𝑉)
8 simprll 791 . . . 4 ((𝜑 ∧ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))) → 𝑋𝐴)
97, 8ssexd 5289 . . 3 ((𝜑 ∧ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))) → 𝑋 ∈ V)
109, 9xpexd 7751 . . . 4 ((𝜑 ∧ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))) → (𝑋 × 𝑋) ∈ V)
11 simprlr 792 . . . 4 ((𝜑 ∧ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))) → 𝑅 ⊆ (𝑋 × 𝑋))
1210, 11ssexd 5289 . . 3 ((𝜑 ∧ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))) → 𝑅 ∈ V)
139, 12jca 521 . 2 ((𝜑 ∧ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))) → (𝑋 ∈ V ∧ 𝑅 ∈ V))
14 simpl 488 . . . . . 6 ((𝑥 = 𝑋𝑟 = 𝑅) → 𝑥 = 𝑋)
1514sseq1d 3962 . . . . 5 ((𝑥 = 𝑋𝑟 = 𝑅) → (𝑥𝐴𝑋𝐴))
16 simpr 490 . . . . . 6 ((𝑥 = 𝑋𝑟 = 𝑅) → 𝑟 = 𝑅)
1714sqxpeqd 5687 . . . . . 6 ((𝑥 = 𝑋𝑟 = 𝑅) → (𝑥 × 𝑥) = (𝑋 × 𝑋))
1816, 17sseq12d 3964 . . . . 5 ((𝑥 = 𝑋𝑟 = 𝑅) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑅 ⊆ (𝑋 × 𝑋)))
1915, 18anbi12d 644 . . . 4 ((𝑥 = 𝑋𝑟 = 𝑅) → ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ↔ (𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋))))
2016, 14weeq12d 5644 . . . . 5 ((𝑥 = 𝑋𝑟 = 𝑅) → (𝑟 We 𝑥𝑅 We 𝑋))
2116cnveqd 5855 . . . . . . . 8 ((𝑥 = 𝑋𝑟 = 𝑅) → 𝑟 = 𝑅)
2221imaeq1d 6055 . . . . . . 7 ((𝑥 = 𝑋𝑟 = 𝑅) → (𝑟 “ {𝑦}) = (𝑅 “ {𝑦}))
2322fveqeq2d 6887 . . . . . 6 ((𝑥 = 𝑋𝑟 = 𝑅) → ((𝐹‘(𝑟 “ {𝑦})) = 𝑦 ↔ (𝐹‘(𝑅 “ {𝑦})) = 𝑦))
2414, 23raleqbidv 3334 . . . . 5 ((𝑥 = 𝑋𝑟 = 𝑅) → (∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦 ↔ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))
2520, 24anbi12d 644 . . . 4 ((𝑥 = 𝑋𝑟 = 𝑅) → ((𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦) ↔ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦)))
2619, 25anbi12d 644 . . 3 ((𝑥 = 𝑋𝑟 = 𝑅) → (((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦)) ↔ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))))
2726, 1brabga 5512 . 2 ((𝑋 ∈ V ∧ 𝑅 ∈ V) → (𝑋𝑊𝑅 ↔ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))))
285, 13, 27pm5.21nd 814 1 (𝜑 → (𝑋𝑊𝑅 ↔ ((𝑋𝐴𝑅 ⊆ (𝑋 × 𝑋)) ∧ (𝑅 We 𝑋 ∧ ∀𝑦𝑋 (𝐹‘(𝑅 “ {𝑦})) = 𝑦))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wral 3076  Vcvv 3450  wss 3899  {csn 4584   class class class wbr 5103  {copab 5167   We wwe 5607   × cxp 5653  ccnv 5654  cima 5658  Rel wrel 5660  cfv 6533
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 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fv 6541
This theorem is used by:  canth4  10659  canthnumlem  10660  canthp1lem2  10665
  Copyright terms: Public domain W3C validator