Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cllem0 Structured version   Visualization version   GIF version

Theorem cllem0 44525
Description: The class of all sets with property 𝜑(𝑧) is closed under the binary operation on sets defined in 𝑅(𝑥, 𝑦). (Contributed by RP, 3-Jan-2020.)
Hypotheses
Ref Expression
cllem0.v 𝑉 = {𝑧 ∣ 𝜑}
cllem0.rex 𝑅 ∈ 𝑈
cllem0.r (𝑧 = 𝑅 → (𝜑 ↔ 𝜓))
cllem0.x (𝑧 = 𝑥 → (𝜑 ↔ 𝜒))
cllem0.y (𝑧 = 𝑦 → (𝜑 ↔ 𝜃))
cllem0.closed ((𝜒 ∧ 𝜃) → 𝜓)
Assertion
Ref Expression
cllem0 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 𝑅 ∈ 𝑉
Distinct variable groups:   𝜓,𝑧   𝜒,𝑧   𝜃,𝑧   𝑥,𝑦,𝑧   𝑦,𝑉   𝑧,𝑅
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)   𝜓(𝑥, 𝑦)   𝜒(𝑥, 𝑦)   𝜃(𝑥, 𝑦)   𝑅(𝑥, 𝑦)   𝑈(𝑥, 𝑦, 𝑧)   𝑉(𝑥, 𝑧)

Proof of Theorem cllem0
StepHypRef Expression
1 cllem0.rex . . . . . . 7 𝑅 ∈ 𝑈
21elexi 3473 . . . . . 6 𝑅 ∈ V
3 cllem0.r . . . . . 6 (𝑧 = 𝑅 → (𝜑 ↔ 𝜓))
4 cllem0.v . . . . . 6 𝑉 = {𝑧 ∣ 𝜑}
52, 3, 4elab2 3636 . . . . 5 (𝑅 ∈ 𝑉 ↔ 𝜓)
65ralbii 3109 . . . 4 (∀𝑦 ∈ 𝑉 𝑅 ∈ 𝑉 ↔ ∀𝑦 ∈ 𝑉 𝜓)
76ralbii 3109 . . 3 (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 𝑅 ∈ 𝑉 ↔ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 𝜓)
8 df-ral 3078 . . . 4 (∀𝑦 ∈ 𝑉 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝑉 → 𝜓))
98ralbii 3109 . . 3 (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 𝜓 ↔ ∀𝑥 ∈ 𝑉 ∀𝑦(𝑦 ∈ 𝑉 → 𝜓))
10 df-ral 3078 . . 3 (∀𝑥 ∈ 𝑉 ∀𝑦(𝑦 ∈ 𝑉 → 𝜓) ↔ ∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑉 → 𝜓)))
117, 9, 103bitri 300 . 2 (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 𝑅 ∈ 𝑉 ↔ ∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑉 → 𝜓)))
12 vex 3455 . . . . . 6 𝑥 ∈ V
13 cllem0.x . . . . . 6 (𝑧 = 𝑥 → (𝜑 ↔ 𝜒))
1412, 13, 4elab2 3636 . . . . 5 (𝑥 ∈ 𝑉 ↔ 𝜒)
15 vex 3455 . . . . . 6 𝑦 ∈ V
16 cllem0.y . . . . . 6 (𝑧 = 𝑦 → (𝜑 ↔ 𝜃))
1715, 16, 4elab2 3636 . . . . 5 (𝑦 ∈ 𝑉 ↔ 𝜃)
18 cllem0.closed . . . . 5 ((𝜒 ∧ 𝜃) → 𝜓)
1914, 17, 18syl2anb 610 . . . 4 ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → 𝜓)
2019ex 418 . . 3 (𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑉 → 𝜓))
2120alrimiv 1960 . 2 (𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑉 → 𝜓))
2211, 21mpgbir 1832 1 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 𝑅 ∈ 𝑉
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077
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 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-v 3453
This theorem is used by:  superficl  44526  superuncl  44527  ssficl  44528  ssuncl  44529  ssdifcl  44530  sssymdifcl  44531  trficl  44628
  Copyright terms: Public domain W3C validator