Theorem harwdom 9350

Description: The value of the Hartogs function at a set 𝑋 is weakly dominated by 𝒫 (𝑋 × 𝑋). This follows from a more precise analysis of the bound used in hartogs 9303 to prove that (har‘𝑋) is an ordinal. (Contributed by Mario Carneiro, 15-May-2015.)

Assertion

Ref	Expression
harwdom	⊢ (𝑋 ∈ 𝑉 → (har‘𝑋) ≼* 𝒫 (𝑋 × 𝑋))

Proof of Theorem harwdom

Dummy variables 𝑦 𝑟 𝑓 𝑠 𝑡 𝑤 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2738	. . . . . 6 ⊢ {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} = {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}
2		eqid 2738	. . . . . 6 ⊢ {⟨𝑠, 𝑡⟩ ∣ ∃𝑤 ∈ 𝑦 ∃𝑧 ∈ 𝑦 ((𝑠 = (𝑓‘𝑤) ∧ 𝑡 = (𝑓‘𝑧)) ∧ 𝑤 E 𝑧)} = {⟨𝑠, 𝑡⟩ ∣ ∃𝑤 ∈ 𝑦 ∃𝑧 ∈ 𝑦 ((𝑠 = (𝑓‘𝑤) ∧ 𝑡 = (𝑓‘𝑧)) ∧ 𝑤 E 𝑧)}
3	1, 2	hartogslem1 9301	. . . . 5 ⊢ (dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ⊆ 𝒫 (𝑋 × 𝑋) ∧ Fun {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∧ (𝑋 ∈ 𝑉 → ran {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} = {𝑥 ∈ On ∣ 𝑥 ≼ 𝑋}))
4	3	simp2i 1139	. . . 4 ⊢ Fun {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}
5	3	simp1i 1138	. . . . 5 ⊢ dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ⊆ 𝒫 (𝑋 × 𝑋)
6		sqxpexg 7605	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (𝑋 × 𝑋) ∈ V)
7	6	pwexd 5302	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝒫 (𝑋 × 𝑋) ∈ V)
8		ssexg 5247	. . . . 5 ⊢ ((dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ⊆ 𝒫 (𝑋 × 𝑋) ∧ 𝒫 (𝑋 × 𝑋) ∈ V) → dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∈ V)
9	5, 7, 8	sylancr 587	. . . 4 ⊢ (𝑋 ∈ 𝑉 → dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∈ V)
10		funex 7095	. . . 4 ⊢ ((Fun {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∧ dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∈ V) → {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∈ V)
11	4, 9, 10	sylancr 587	. . 3 ⊢ (𝑋 ∈ 𝑉 → {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∈ V)
12		funfn 6464	. . . . . 6 ⊢ (Fun {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ↔ {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} Fn dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))})
13	4, 12	mpbi 229	. . . . 5 ⊢ {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} Fn dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}
14	13	a1i 11	. . . 4 ⊢ (𝑋 ∈ 𝑉 → {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} Fn dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))})
15	3	simp3i 1140	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → ran {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} = {𝑥 ∈ On ∣ 𝑥 ≼ 𝑋})
16		harval 9319	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (har‘𝑋) = {𝑥 ∈ On ∣ 𝑥 ≼ 𝑋})
17	15, 16	eqtr4d 2781	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ran {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} = (har‘𝑋))
18		df-fo 6439	. . . 4 ⊢ ({⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}:dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}–onto→(har‘𝑋) ↔ ({⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} Fn dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∧ ran {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} = (har‘𝑋)))
19	14, 17, 18	sylanbrc 583	. . 3 ⊢ (𝑋 ∈ 𝑉 → {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}:dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}–onto→(har‘𝑋))
20		fowdom 9330	. . 3 ⊢ (({⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∈ V ∧ {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}:dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))}–onto→(har‘𝑋)) → (har‘𝑋) ≼* dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))})
21	11, 19, 20	syl2anc 584	. 2 ⊢ (𝑋 ∈ 𝑉 → (har‘𝑋) ≼* dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))})
22		ssdomg 8786	. . . 4 ⊢ (𝒫 (𝑋 × 𝑋) ∈ V → (dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ⊆ 𝒫 (𝑋 × 𝑋) → dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ≼ 𝒫 (𝑋 × 𝑋)))
23	7, 5, 22	mpisyl 21	. . 3 ⊢ (𝑋 ∈ 𝑉 → dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ≼ 𝒫 (𝑋 × 𝑋))
24		domwdom 9333	. . 3 ⊢ (dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ≼ 𝒫 (𝑋 × 𝑋) → dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ≼* 𝒫 (𝑋 × 𝑋))
25	23, 24	syl 17	. 2 ⊢ (𝑋 ∈ 𝑉 → dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ≼* 𝒫 (𝑋 × 𝑋))
26		wdomtr 9334	. 2 ⊢ (((har‘𝑋) ≼* dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ∧ dom {⟨𝑟, 𝑦⟩ ∣ (((dom 𝑟 ⊆ 𝑋 ∧ ( I ↾ dom 𝑟) ⊆ 𝑟 ∧ 𝑟 ⊆ (dom 𝑟 × dom 𝑟)) ∧ (𝑟 ∖ I ) We dom 𝑟) ∧ 𝑦 = dom OrdIso((𝑟 ∖ I ), dom 𝑟))} ≼* 𝒫 (𝑋 × 𝑋)) → (har‘𝑋) ≼* 𝒫 (𝑋 × 𝑋))
27	21, 25, 26	syl2anc 584	1 ⊢ (𝑋 ∈ 𝑉 → (har‘𝑋) ≼* 𝒫 (𝑋 × 𝑋))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∃wrex 3065  {crab 3068  Vcvv 3432   ∖ cdif 3884   ⊆ wss 3887  𝒫 cpw 4533   class class class wbr 5074  {copab 5136   I cid 5488   E cep 5494   We wwe 5543   × cxp 5587  dom cdm 5589  ran crn 5590   ↾ cres 5591  Oncon0 6266  Fun wfun 6427   Fn wfn 6428  –onto→wfo 6431  ‘cfv 6433   ≼ cdom 8731  OrdIsocoi 9268  harchar 9315   ≼^* cwdom 9323

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-en 8734  df-dom 8735  df-sdom 8736  df-oi 9269  df-har 9316  df-wdom 9324

This theorem is referenced by:  gchhar  10435