Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1147 Structured version   Visualization version   GIF version

Theorem bnj1147 35191
Description: Property of trCl. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Assertion
Ref Expression
bnj1147 trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐴

Proof of Theorem bnj1147
Dummy variables 𝑓 𝑖 𝑗 𝑛 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 biid 263 . 2 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 biid 263 . 2 (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 eqid 2741 . 2 (ω ∖ {∅}) = (ω ∖ {∅})
4 eqid 2741 . 2 {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))}
5 biid 263 . 2 ((𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
6 biid 263 . 2 (((𝑖 ≠ ∅ ∧ 𝑖𝑛 ∧ (𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))) ∧ (𝑗𝑛𝑖 = suc 𝑗)) ↔ ((𝑖 ≠ ∅ ∧ 𝑖𝑛 ∧ (𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))) ∧ (𝑗𝑛𝑖 = suc 𝑗)))
71, 2, 3, 4, 5, 6bnj1145 35190 1 trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐴
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1093   = wceq 1548  wcel 2121  {cab 2719  wne 2936  wral 3055  wrex 3065  cdif 3882  wss 3885  c0 4264  {csn 4558   ciun 4924  suc csuc 6316   Fn wfn 6484  cfv 6489  ωcom 7810  w-bnj17 34884   predc-bnj14 34886   trClc-bnj18 34892
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-tr 5183  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fn 6492  df-fv 6497  df-om 7811  df-bnj17 34885  df-bnj14 34887  df-bnj18 34893
This theorem is referenced by:  bnj1137  35192  bnj1173  35199  bnj1177  35203  bnj1408  35233  bnj1417  35238  bnj1452  35249
  Copyright terms: Public domain W3C validator