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

Theorem bnj893 30252
 Description: Property of trCl. Under certain conditions, the transitive closure of 𝑋 in 𝐴 by 𝑅 is a set. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Assertion
Ref Expression
bnj893 ((𝑅 FrSe 𝐴𝑋𝐴) → trCl(𝑋, 𝐴, 𝑅) ∈ V)

Proof of Theorem bnj893
Dummy variables 𝑓 𝑔 𝑖 𝑛 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 biid 250 . . 3 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 biid 250 . . 3 (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 eqid 2610 . . 3 (ω ∖ {∅}) = (ω ∖ {∅})
4 eqid 2610 . . 3 {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))}
51, 2, 3, 4bnj882 30250 . 2 trCl(𝑋, 𝐴, 𝑅) = 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖)
6 vex 3176 . . . . . . . . . . 11 𝑔 ∈ V
7 fveq1 6102 . . . . . . . . . . . 12 (𝑓 = 𝑔 → (𝑓‘∅) = (𝑔‘∅))
87eqeq1d 2612 . . . . . . . . . . 11 (𝑓 = 𝑔 → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅)))
96, 8sbcie 3437 . . . . . . . . . 10 ([𝑔 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅))
109bicomi 213 . . . . . . . . 9 ((𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ [𝑔 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
11 fveq1 6102 . . . . . . . . . . . . . 14 (𝑓 = 𝑔 → (𝑓‘suc 𝑖) = (𝑔‘suc 𝑖))
12 fveq1 6102 . . . . . . . . . . . . . . 15 (𝑓 = 𝑔 → (𝑓𝑖) = (𝑔𝑖))
1312iuneq1d 4481 . . . . . . . . . . . . . 14 (𝑓 = 𝑔 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))
1411, 13eqeq12d 2625 . . . . . . . . . . . . 13 (𝑓 = 𝑔 → ((𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
1514imbi2d 329 . . . . . . . . . . . 12 (𝑓 = 𝑔 → ((suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
1615ralbidv 2969 . . . . . . . . . . 11 (𝑓 = 𝑔 → (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
176, 16sbcie 3437 . . . . . . . . . 10 ([𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
1817bicomi 213 . . . . . . . . 9 (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
194, 10, 18bnj873 30248 . . . . . . . 8 {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))}
2019eleq2i 2680 . . . . . . 7 (𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ↔ 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))})
2120anbi1i 727 . . . . . 6 ((𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖)) ↔ (𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} ∧ 𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖)))
2221rexbii2 3021 . . . . 5 (∃𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖) ↔ ∃𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖))
2322abbii 2726 . . . 4 {𝑤 ∣ ∃𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖)} = {𝑤 ∣ ∃𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖)}
24 df-iun 4457 . . . 4 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) = {𝑤 ∣ ∃𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖)}
25 df-iun 4457 . . . 4 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) = {𝑤 ∣ ∃𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))}𝑤 𝑖 ∈ dom 𝑓(𝑓𝑖)}
2623, 24, 253eqtr4i 2642 . . 3 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) = 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖)
27 biid 250 . . . . 5 ((𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅))
28 biid 250 . . . . 5 (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
29 eqid 2610 . . . . 5 {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} = {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))}
30 biid 250 . . . . 5 ((𝑅 FrSe 𝐴𝑋𝐴𝑛 ∈ (ω ∖ {∅})) ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛 ∈ (ω ∖ {∅})))
31 biid 250 . . . . 5 ((𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
32 biid 250 . . . . 5 ([𝑧 / 𝑔](𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ [𝑧 / 𝑔](𝑔‘∅) = pred(𝑋, 𝐴, 𝑅))
33 biid 250 . . . . 5 ([𝑧 / 𝑔]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [𝑧 / 𝑔]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
34 biid 250 . . . . 5 ([𝑧 / 𝑔](𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ [𝑧 / 𝑔](𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
35 biid 250 . . . . 5 ((𝑅 FrSe 𝐴𝑋𝐴) ↔ (𝑅 FrSe 𝐴𝑋𝐴))
3627, 28, 3, 29, 30, 31, 32, 33, 34, 35bnj849 30249 . . . 4 ((𝑅 FrSe 𝐴𝑋𝐴) → {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} ∈ V)
37 vex 3176 . . . . . . 7 𝑓 ∈ V
3837dmex 6991 . . . . . 6 dom 𝑓 ∈ V
39 fvex 6113 . . . . . 6 (𝑓𝑖) ∈ V
4038, 39iunex 7039 . . . . 5 𝑖 ∈ dom 𝑓(𝑓𝑖) ∈ V
4140rgenw 2908 . . . 4 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) ∈ V
42 iunexg 7035 . . . 4 (({𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} ∈ V ∧ ∀𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) ∈ V) → 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) ∈ V)
4336, 41, 42sylancl 693 . . 3 ((𝑅 FrSe 𝐴𝑋𝐴) → 𝑓 ∈ {𝑔 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑔 Fn 𝑛 ∧ (𝑔‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) ∈ V)
4426, 43syl5eqel 2692 . 2 ((𝑅 FrSe 𝐴𝑋𝐴) → 𝑓 ∈ {𝑓 ∣ ∃𝑛 ∈ (ω ∖ {∅})(𝑓 Fn 𝑛 ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))} 𝑖 ∈ dom 𝑓(𝑓𝑖) ∈ V)
455, 44syl5eqel 2692 1 ((𝑅 FrSe 𝐴𝑋𝐴) → trCl(𝑋, 𝐴, 𝑅) ∈ V)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  {cab 2596  ∀wral 2896  ∃wrex 2897  Vcvv 3173  [wsbc 3402   ∖ cdif 3537  ∅c0 3874  {csn 4125  ∪ ciun 4455  dom cdm 5038  suc csuc 5642   Fn wfn 5799  ‘cfv 5804  ωcom 6957   predc-bnj14 30007   FrSe w-bnj15 30011   trClc-bnj18 30013 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-reg 8380  ax-inf2 8421 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-om 6958  df-1o 7447  df-bnj17 30006  df-bnj14 30008  df-bnj13 30010  df-bnj15 30012  df-bnj18 30014 This theorem is referenced by:  bnj1125  30314  bnj1136  30319  bnj1177  30328  bnj1413  30357  bnj1452  30374
 Copyright terms: Public domain W3C validator