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

Theorem bnj1124 33428
Description: Property of trCl. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1124.4 (𝜃 ↔ (𝑅 FrSe 𝐴𝑋𝐴))
bnj1124.5 (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
Assertion
Ref Expression
bnj1124 ((𝜃𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵)

Proof of Theorem bnj1124
Dummy variables 𝑓 𝑖 𝑗 𝑛 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 biid 260 . 2 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 biid 260 . 2 (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 biid 260 . 2 ((𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
4 bnj1124.4 . 2 (𝜃 ↔ (𝑅 FrSe 𝐴𝑋𝐴))
5 bnj1124.5 . 2 (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
6 biid 260 . 2 ((𝑖𝑛𝑧 ∈ (𝑓𝑖)) ↔ (𝑖𝑛𝑧 ∈ (𝑓𝑖)))
7 eqid 2736 . 2 (ω ∖ {∅}) = (ω ∖ {∅})
8 eqid 2736 . 2 {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))}
9 biid 260 . 2 (((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵) ↔ ((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵))
10 biid 260 . 2 (∀𝑗𝑛 (𝑗 E 𝑖[𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)) ↔ ∀𝑗𝑛 (𝑗 E 𝑖[𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)))
11 biid 260 . 2 ([𝑗 / 𝑖](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ [𝑗 / 𝑖](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
12 biid 260 . 2 ([𝑗 / 𝑖]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [𝑗 / 𝑖]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
13 biid 260 . 2 ([𝑗 / 𝑖](𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ [𝑗 / 𝑖](𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
14 biid 260 . 2 ([𝑗 / 𝑖]𝜃[𝑗 / 𝑖]𝜃)
15 biid 260 . 2 ([𝑗 / 𝑖]𝜏[𝑗 / 𝑖]𝜏)
16 biid 260 . 2 ([𝑗 / 𝑖](𝑖𝑛𝑧 ∈ (𝑓𝑖)) ↔ [𝑗 / 𝑖](𝑖𝑛𝑧 ∈ (𝑓𝑖)))
17 biid 260 . 2 ([𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵) ↔ [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵))
18 biid 260 . 2 (((𝑗𝑛𝑗 E 𝑖) → [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)) ↔ ((𝑗𝑛𝑗 E 𝑖) → [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)))
19 biid 260 . 2 ((𝑖𝑛 ∧ ((𝑗𝑛𝑗 E 𝑖) → [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)) ∧ 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) ↔ (𝑖𝑛 ∧ ((𝑗𝑛𝑗 E 𝑖) → [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)) ∧ 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓))
201, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19bnj1030 33427 1 ((𝜃𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  {cab 2713  wral 3062  wrex 3071  Vcvv 3443  [wsbc 3737  cdif 3905  wss 3908  c0 4280  {csn 4584   ciun 4952   class class class wbr 5103   E cep 5534  dom cdm 5631  suc csuc 6317   Fn wfn 6488  cfv 6493  ωcom 7794  w-bnj17 33126   predc-bnj14 33128   FrSe w-bnj15 33132   trClc-bnj18 33134   TrFow-bnj19 33136
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5254  ax-nul 5261  ax-pr 5382  ax-un 7664
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3406  df-v 3445  df-sbc 3738  df-csb 3854  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-iun 4954  df-br 5104  df-opab 5166  df-tr 5221  df-eprel 5535  df-po 5543  df-so 5544  df-fr 5586  df-we 5588  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6445  df-fn 6496  df-fv 6501  df-om 7795  df-bnj17 33127  df-bnj18 33135  df-bnj19 33137
This theorem is referenced by:  bnj1125  33432  bnj1136  33437  bnj1408  33476
  Copyright terms: Public domain W3C validator