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

Theorem bnj1145 35623
Description: Technical lemma for bnj69 35640. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1145.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1145.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1145.3 𝐷 = (ω ∖ {∅})
bnj1145.4 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
bnj1145.5 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1145.6 (𝜃 ↔ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗)))
Assertion
Ref Expression
bnj1145 trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐴
Distinct variable groups:   𝐴,𝑓,𝑖,𝑗,𝑛,𝑦   𝐷,𝑖,𝑗   𝑅,𝑓,𝑖,𝑗,𝑛,𝑦   𝑓,𝑋,𝑖,𝑛,𝑦   𝜒,𝑗   𝜑,𝑖
Allowed substitution hints:   𝜑(𝑦, 𝑓, 𝑗, 𝑛)   𝜓(𝑦, 𝑓, 𝑖, 𝑗, 𝑛)   𝜒(𝑦, 𝑓, 𝑖, 𝑛)   𝜃(𝑦, 𝑓, 𝑖, 𝑗, 𝑛)   𝐵(𝑦, 𝑓, 𝑖, 𝑗, 𝑛)   𝐷(𝑦, 𝑓, 𝑛)   𝑋(𝑗)

Proof of Theorem bnj1145
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 bnj1145.1 . . 3 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 bnj1145.2 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj1145.3 . . 3 𝐷 = (ω ∖ {∅})
4 bnj1145.4 . . 3 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
51, 2, 3, 4bnj882 35556 . 2 trCl(𝑋, 𝐴, 𝑅) = ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)
6 ss2iun 4969 . . . 4 (∀𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴 → ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ ∪ 𝑓 ∈ 𝐵 𝐴)
7 bnj1145.5 . . . . . . 7 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
87, 4bnj1083 35608 . . . . . 6 (𝑓 ∈ 𝐵 ↔ ∃𝑛𝜒)
92bnj1095 35412 . . . . . . . . 9 (𝜓 → ∀𝑖𝜓)
109, 7bnj1096 35413 . . . . . . . 8 (𝜒 → ∀𝑖𝜒)
113bnj1098 35414 . . . . . . . . . . . . . . . . 17 ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))
127bnj1232 35433 . . . . . . . . . . . . . . . . . 18 (𝜒 → 𝑛 ∈ 𝐷)
13123anim3i 1172 . . . . . . . . . . . . . . . . 17 ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷))
1411, 13bnj1101 35415 . . . . . . . . . . . . . . . 16 ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))
15 ancl 554 . . . . . . . . . . . . . . . 16 (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗)) → ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))))
1614, 15bnj101 35354 . . . . . . . . . . . . . . 15 ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗)))
17 bnj1145.6 . . . . . . . . . . . . . . . . 17 (𝜃 ↔ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗)))
1817imbi2i 339 . . . . . . . . . . . . . . . 16 (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → 𝜃) ↔ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))))
1918exbii 1880 . . . . . . . . . . . . . . 15 (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → 𝜃) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))))
2016, 19mpbir 234 . . . . . . . . . . . . . 14 ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → 𝜃)
21 bnj213 35512 . . . . . . . . . . . . . . . 16 pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
2221bnj226 35365 . . . . . . . . . . . . . . 15 ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
23 simpr 490 . . . . . . . . . . . . . . . . . . 19 ((𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗) → 𝑖 = suc 𝑗)
2417, 23simplbiim 514 . . . . . . . . . . . . . . . . . 18 (𝜃 → 𝑖 = suc 𝑗)
25 simp2 1155 . . . . . . . . . . . . . . . . . . . 20 ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → 𝑖 ∈ 𝑛)
26123ad2ant3 1153 . . . . . . . . . . . . . . . . . . . 20 ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → 𝑛 ∈ 𝐷)
273bnj923 35399 . . . . . . . . . . . . . . . . . . . . 21 (𝑛 ∈ 𝐷 → 𝑛 ∈ ω)
28 elnn 7888 . . . . . . . . . . . . . . . . . . . . 21 ((𝑖 ∈ 𝑛 ∧ 𝑛 ∈ ω) → 𝑖 ∈ ω)
2927, 28sylan2 605 . . . . . . . . . . . . . . . . . . . 20 ((𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → 𝑖 ∈ ω)
3025, 26, 29syl2anc 596 . . . . . . . . . . . . . . . . . . 19 ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → 𝑖 ∈ ω)
3117, 30bnj832 35389 . . . . . . . . . . . . . . . . . 18 (𝜃 → 𝑖 ∈ ω)
32 vex 3454 . . . . . . . . . . . . . . . . . . . 20 𝑗 ∈ V
3332bnj216 35363 . . . . . . . . . . . . . . . . . . 19 (𝑖 = suc 𝑗 → 𝑗 ∈ 𝑖)
34 elnn 7888 . . . . . . . . . . . . . . . . . . 19 ((𝑗 ∈ 𝑖 ∧ 𝑖 ∈ ω) → 𝑗 ∈ ω)
3533, 34sylan 592 . . . . . . . . . . . . . . . . . 18 ((𝑖 = suc 𝑗 ∧ 𝑖 ∈ ω) → 𝑗 ∈ ω)
3624, 31, 35syl2anc 596 . . . . . . . . . . . . . . . . 17 (𝜃 → 𝑗 ∈ ω)
3717, 25bnj832 35389 . . . . . . . . . . . . . . . . . 18 (𝜃 → 𝑖 ∈ 𝑛)
3824, 37eqeltrrd 2861 . . . . . . . . . . . . . . . . 17 (𝜃 → suc 𝑗 ∈ 𝑛)
392bnj589 35539 . . . . . . . . . . . . . . . . . . . . . . 23 (𝜓 ↔ ∀𝑗 ∈ ω (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
4039biimpi 219 . . . . . . . . . . . . . . . . . . . . . 22 (𝜓 → ∀𝑗 ∈ ω (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
4140bnj708 35387 . . . . . . . . . . . . . . . . . . . . 21 ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) → ∀𝑗 ∈ ω (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
42 rsp 3250 . . . . . . . . . . . . . . . . . . . . 21 (∀𝑗 ∈ ω (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)) → (𝑗 ∈ ω → (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
4341, 42syl 18 . . . . . . . . . . . . . . . . . . . 20 ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) → (𝑗 ∈ ω → (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
447, 43sylbi 220 . . . . . . . . . . . . . . . . . . 19 (𝜒 → (𝑗 ∈ ω → (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
45443ad2ant3 1153 . . . . . . . . . . . . . . . . . 18 ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑗 ∈ ω → (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
4617, 45bnj832 35389 . . . . . . . . . . . . . . . . 17 (𝜃 → (𝑗 ∈ ω → (suc 𝑗 ∈ 𝑛 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
4736, 38, 46mp2d 50 . . . . . . . . . . . . . . . 16 (𝜃 → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))
48 fveqeq2 6894 . . . . . . . . . . . . . . . . 17 (𝑖 = suc 𝑗 → ((𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
4924, 48syl 18 . . . . . . . . . . . . . . . 16 (𝜃 → ((𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
5047, 49mpbird 260 . . . . . . . . . . . . . . 15 (𝜃 → (𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))
5122, 50bnj1262 35440 . . . . . . . . . . . . . 14 (𝜃 → (𝑓‘𝑖) ⊆ 𝐴)
5220, 51bnj1023 35411 . . . . . . . . . . . . 13 ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴)
53 3anass 1111 . . . . . . . . . . . . . . 15 ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) ↔ (𝑖 ≠ ∅ ∧ (𝑖 ∈ 𝑛 ∧ 𝜒)))
5453imbi1i 352 . . . . . . . . . . . . . 14 (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴) ↔ ((𝑖 ≠ ∅ ∧ (𝑖 ∈ 𝑛 ∧ 𝜒)) → (𝑓‘𝑖) ⊆ 𝐴))
5554exbii 1880 . . . . . . . . . . . . 13 (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ (𝑖 ∈ 𝑛 ∧ 𝜒)) → (𝑓‘𝑖) ⊆ 𝐴))
5652, 55mpbi 233 . . . . . . . . . . . 12 ∃𝑗((𝑖 ≠ ∅ ∧ (𝑖 ∈ 𝑛 ∧ 𝜒)) → (𝑓‘𝑖) ⊆ 𝐴)
571biimpi 219 . . . . . . . . . . . . . . 15 (𝜑 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
587, 57bnj771 35395 . . . . . . . . . . . . . 14 (𝜒 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
59 fveq2 6885 . . . . . . . . . . . . . . 15 (𝑖 = ∅ → (𝑓‘𝑖) = (𝑓‘∅))
60 bnj213 35512 . . . . . . . . . . . . . . . 16 pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴
61 sseq1 3933 . . . . . . . . . . . . . . . 16 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) → ((𝑓‘∅) ⊆ 𝐴 ↔ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴))
6260, 61mpbiri 261 . . . . . . . . . . . . . . 15 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) → (𝑓‘∅) ⊆ 𝐴)
63 sseq1 3933 . . . . . . . . . . . . . . . 16 ((𝑓‘𝑖) = (𝑓‘∅) → ((𝑓‘𝑖) ⊆ 𝐴 ↔ (𝑓‘∅) ⊆ 𝐴))
6463biimpar 483 . . . . . . . . . . . . . . 15 (((𝑓‘𝑖) = (𝑓‘∅) ∧ (𝑓‘∅) ⊆ 𝐴) → (𝑓‘𝑖) ⊆ 𝐴)
6559, 62, 64syl2an 608 . . . . . . . . . . . . . 14 ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) → (𝑓‘𝑖) ⊆ 𝐴)
6658, 65sylan2 605 . . . . . . . . . . . . 13 ((𝑖 = ∅ ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴)
6766adantrl 729 . . . . . . . . . . . 12 ((𝑖 = ∅ ∧ (𝑖 ∈ 𝑛 ∧ 𝜒)) → (𝑓‘𝑖) ⊆ 𝐴)
6856, 67bnj1109 35417 . . . . . . . . . . 11 ∃𝑗((𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴)
69 19.9v 2016 . . . . . . . . . . 11 (∃𝑗((𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴) ↔ ((𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴))
7068, 69mpbi 233 . . . . . . . . . 10 ((𝑖 ∈ 𝑛 ∧ 𝜒) → (𝑓‘𝑖) ⊆ 𝐴)
7170expcom 419 . . . . . . . . 9 (𝜒 → (𝑖 ∈ 𝑛 → (𝑓‘𝑖) ⊆ 𝐴))
72 fndm 6642 . . . . . . . . . . 11 (𝑓 Fn 𝑛 → dom 𝑓 = 𝑛)
737, 72bnj770 35394 . . . . . . . . . 10 (𝜒 → dom 𝑓 = 𝑛)
74 eleq2 2849 . . . . . . . . . . 11 (dom 𝑓 = 𝑛 → (𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ 𝑛))
7574imbi1d 344 . . . . . . . . . 10 (dom 𝑓 = 𝑛 → ((𝑖 ∈ dom 𝑓 → (𝑓‘𝑖) ⊆ 𝐴) ↔ (𝑖 ∈ 𝑛 → (𝑓‘𝑖) ⊆ 𝐴)))
7673, 75syl 18 . . . . . . . . 9 (𝜒 → ((𝑖 ∈ dom 𝑓 → (𝑓‘𝑖) ⊆ 𝐴) ↔ (𝑖 ∈ 𝑛 → (𝑓‘𝑖) ⊆ 𝐴)))
7771, 76mpbird 260 . . . . . . . 8 (𝜒 → (𝑖 ∈ dom 𝑓 → (𝑓‘𝑖) ⊆ 𝐴))
7810, 77hbralrimi 3152 . . . . . . 7 (𝜒 → ∀𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴)
7978exlimiv 1962 . . . . . 6 (∃𝑛𝜒 → ∀𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴)
808, 79sylbi 220 . . . . 5 (𝑓 ∈ 𝐵 → ∀𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴)
81 ss2iun 4969 . . . . . 6 (∀𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴 → ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ ∪ 𝑖 ∈ dom 𝑓 𝐴)
82 bnj1143 35420 . . . . . 6 ∪ 𝑖 ∈ dom 𝑓 𝐴 ⊆ 𝐴
8381, 82sstrdi 3920 . . . . 5 (∀𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴 → ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴)
8480, 83syl 18 . . . 4 (𝑓 ∈ 𝐵 → ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴)
856, 84mprg 3082 . . 3 ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ ∪ 𝑓 ∈ 𝐵 𝐴
864bnj1317 35451 . . . 4 (𝑤 ∈ 𝐵 → ∀𝑓 𝑤 ∈ 𝐵)
8786bnj1146 35421 . . 3 ∪ 𝑓 ∈ 𝐵 𝐴 ⊆ 𝐴
8885, 87sstri 3917 . 2 ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ 𝐴
895, 88eqsstri 3954 1 trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ≠ wne 2955  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   ∖ cdif 4045  ∅c0 4278  {csn 4583  ∪ ciun 4950  dom cdm 5650  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877   ∧ w-bnj17 35317   predc-bnj14 35319   trClc-bnj18 35325
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fn 6541  df-fv 6546  df-om 7878  df-bnj17 35318  df-bnj14 35320  df-bnj18 35326
This theorem is used by:  bnj1147  35624
  Copyright terms: Public domain W3C validator