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 34971
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 261 . 2 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 biid 261 . 2 (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 biid 261 . 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 261 . 2 ((𝑖𝑛𝑧 ∈ (𝑓𝑖)) ↔ (𝑖𝑛𝑧 ∈ (𝑓𝑖)))
7 eqid 2729 . 2 (ω ∖ {∅}) = (ω ∖ {∅})
8 eqid 2729 . 2 {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))}
9 biid 261 . 2 (((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵) ↔ ((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵))
10 biid 261 . 2 (∀𝑗𝑛 (𝑗 E 𝑖[𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)) ↔ ∀𝑗𝑛 (𝑗 E 𝑖[𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)))
11 biid 261 . 2 ([𝑗 / 𝑖](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ [𝑗 / 𝑖](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
12 biid 261 . 2 ([𝑗 / 𝑖]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [𝑗 / 𝑖]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
13 biid 261 . 2 ([𝑗 / 𝑖](𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ [𝑗 / 𝑖](𝑛 ∈ (ω ∖ {∅}) ∧ 𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
14 biid 261 . 2 ([𝑗 / 𝑖]𝜃[𝑗 / 𝑖]𝜃)
15 biid 261 . 2 ([𝑗 / 𝑖]𝜏[𝑗 / 𝑖]𝜏)
16 biid 261 . 2 ([𝑗 / 𝑖](𝑖𝑛𝑧 ∈ (𝑓𝑖)) ↔ [𝑗 / 𝑖](𝑖𝑛𝑧 ∈ (𝑓𝑖)))
17 biid 261 . 2 ([𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵) ↔ [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵))
18 biid 261 . 2 (((𝑗𝑛𝑗 E 𝑖) → [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)) ↔ ((𝑗𝑛𝑗 E 𝑖) → [𝑗 / 𝑖]((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ 𝐵)))
19 biid 261 . 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 34970 1 ((𝜃𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  {cab 2707  wral 3044  wrex 3053  Vcvv 3436  [wsbc 3742  cdif 3900  wss 3903  c0 4284  {csn 4577   ciun 4941   class class class wbr 5092   E cep 5518  dom cdm 5619  suc csuc 6309   Fn wfn 6477  cfv 6482  ωcom 7799  w-bnj17 34669   predc-bnj14 34671   FrSe w-bnj15 34675   trClc-bnj18 34677   TrFow-bnj19 34679
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371  ax-un 7671
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-tr 5200  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fn 6485  df-fv 6490  df-om 7800  df-bnj17 34670  df-bnj18 34678  df-bnj19 34680
This theorem is referenced by:  bnj1125  34975  bnj1136  34980  bnj1408  35019
  Copyright terms: Public domain W3C validator