Theorem isomuspgr 44073

Description: The isomorphy relation for two simple pseudographs. This corresponds to the definition in [Bollobas] p. 3. (Contributed by AV, 1-Dec-2022.)

Hypotheses

Ref	Expression
isomushgr.v	⊢ 𝑉 = (Vtx‘𝐴)
isomushgr.w	⊢ 𝑊 = (Vtx‘𝐵)
isomushgr.e	⊢ 𝐸 = (Edg‘𝐴)
isomushgr.k	⊢ 𝐾 = (Edg‘𝐵)

Assertion

Ref	Expression
isomuspgr	⊢ ((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) → (𝐴 IsomGr 𝐵 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))))

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓   𝑎,𝑏,𝑓   𝐸,𝑎,𝑏   𝐾,𝑎,𝑏   𝑉,𝑎,𝑏   𝐴,𝑎,𝑏   𝐵,𝑎,𝑏   𝑊,𝑎,𝑏

Allowed substitution hints:   𝐸(𝑓)   𝐾(𝑓)   𝑉(𝑓)   𝑊(𝑓)

Proof of Theorem isomuspgr

Dummy variables 𝑒 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uspgrushgr 26958	. . 3 ⊢ (𝐴 ∈ USPGraph → 𝐴 ∈ USHGraph)
2		uspgrushgr 26958	. . 3 ⊢ (𝐵 ∈ USPGraph → 𝐵 ∈ USHGraph)
3		isomushgr.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐴)
4		isomushgr.w	. . . 4 ⊢ 𝑊 = (Vtx‘𝐵)
5		isomushgr.e	. . . 4 ⊢ 𝐸 = (Edg‘𝐴)
6		isomushgr.k	. . . 4 ⊢ 𝐾 = (Edg‘𝐵)
7	3, 4, 5, 6	isomushgr 44065	. . 3 ⊢ ((𝐴 ∈ USHGraph ∧ 𝐵 ∈ USHGraph) → (𝐴 IsomGr 𝐵 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∃𝑔(𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)))))
8	1, 2, 7	syl2an 597	. 2 ⊢ ((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) → (𝐴 IsomGr 𝐵 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∃𝑔(𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)))))
9		imaeq2 5918	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑒 = {𝑎, 𝑏} → (𝑓 “ 𝑒) = (𝑓 “ {𝑎, 𝑏}))
10		fveq2 6663	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑒 = {𝑎, 𝑏} → (𝑔‘𝑒) = (𝑔‘{𝑎, 𝑏}))
11	9, 10	eqeq12d 2836	. . . . . . . . . . . . . . . . 17 ⊢ (𝑒 = {𝑎, 𝑏} → ((𝑓 “ 𝑒) = (𝑔‘𝑒) ↔ (𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏})))
12	11	rspccv 3617	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒) → ({𝑎, 𝑏} ∈ 𝐸 → (𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏})))
13	12	adantl 484	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) → ({𝑎, 𝑏} ∈ 𝐸 → (𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏})))
14	13	imp 409	. . . . . . . . . . . . . 14 ⊢ (((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) ∧ {𝑎, 𝑏} ∈ 𝐸) → (𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏}))
15		f1ofn 6609	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓:𝑉–1-1-onto→𝑊 → 𝑓 Fn 𝑉)
16	15	ad3antlr 729	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → 𝑓 Fn 𝑉)
17		simprl 769	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → 𝑎 ∈ 𝑉)
18		simprr 771	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → 𝑏 ∈ 𝑉)
19		fnimapr 6740	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓 Fn 𝑉 ∧ 𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → (𝑓 “ {𝑎, 𝑏}) = {(𝑓‘𝑎), (𝑓‘𝑏)})
20	16, 17, 18, 19	syl3anc 1366	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑓 “ {𝑎, 𝑏}) = {(𝑓‘𝑎), (𝑓‘𝑏)})
21	20	eqeq1d 2822	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ((𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏}) ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} = (𝑔‘{𝑎, 𝑏})))
22	21	adantr 483	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) → ((𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏}) ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} = (𝑔‘{𝑎, 𝑏})))
23	22	adantr 483	. . . . . . . . . . . . . . 15 ⊢ (((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) ∧ {𝑎, 𝑏} ∈ 𝐸) → ((𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏}) ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} = (𝑔‘{𝑎, 𝑏})))
24		f1of 6608	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑔:𝐸–1-1-onto→𝐾 → 𝑔:𝐸⟶𝐾)
25	24	ad3antlr 729	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) → 𝑔:𝐸⟶𝐾)
26	25	ffvelrnda 6844	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) ∧ {𝑎, 𝑏} ∈ 𝐸) → (𝑔‘{𝑎, 𝑏}) ∈ 𝐾)
27		eleq1 2899	. . . . . . . . . . . . . . . 16 ⊢ ({(𝑓‘𝑎), (𝑓‘𝑏)} = (𝑔‘{𝑎, 𝑏}) → ({(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾 ↔ (𝑔‘{𝑎, 𝑏}) ∈ 𝐾))
28	26, 27	syl5ibrcom 249	. . . . . . . . . . . . . . 15 ⊢ (((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) ∧ {𝑎, 𝑏} ∈ 𝐸) → ({(𝑓‘𝑎), (𝑓‘𝑏)} = (𝑔‘{𝑎, 𝑏}) → {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))
29	23, 28	sylbid 242	. . . . . . . . . . . . . 14 ⊢ (((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) ∧ {𝑎, 𝑏} ∈ 𝐸) → ((𝑓 “ {𝑎, 𝑏}) = (𝑔‘{𝑎, 𝑏}) → {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))
30	14, 29	mpd 15	. . . . . . . . . . . . 13 ⊢ (((((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) ∧ {𝑎, 𝑏} ∈ 𝐸) → {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾)
31	30	exp41 437	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) → ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → (∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒) → ({𝑎, 𝑏} ∈ 𝐸 → {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))))
32	31	com23 86	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ 𝑔:𝐸–1-1-onto→𝐾) → (∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒) → ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → ({𝑎, 𝑏} ∈ 𝐸 → {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))))
33	32	impr 457	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ (𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))) → ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → ({𝑎, 𝑏} ∈ 𝐸 → {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾)))
34	33	imp 409	. . . . . . . . 9 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ (𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ({𝑎, 𝑏} ∈ 𝐸 → {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))
35	3, 4, 5, 6	isomuspgrlem1 44066	. . . . . . . . 9 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ (𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ({(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾 → {𝑎, 𝑏} ∈ 𝐸))
36	34, 35	impbid 214	. . . . . . . 8 ⊢ (((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ (𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))
37	36	ralrimivva 3190	. . . . . . 7 ⊢ ((((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) ∧ (𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))) → ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))
38	37	ex 415	. . . . . 6 ⊢ (((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) → ((𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) → ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾)))
39	38	exlimdv 1933	. . . . 5 ⊢ (((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) → (∃𝑔(𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) → ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾)))
40	3, 4, 5, 6	isomuspgrlem2 44072	. . . . 5 ⊢ (((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) → (∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾) → ∃𝑔(𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))))
41	39, 40	impbid 214	. . . 4 ⊢ (((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) ∧ 𝑓:𝑉–1-1-onto→𝑊) → (∃𝑔(𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒)) ↔ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾)))
42	41	pm5.32da 581	. . 3 ⊢ ((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) → ((𝑓:𝑉–1-1-onto→𝑊 ∧ ∃𝑔(𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ↔ (𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))))
43	42	exbidv 1921	. 2 ⊢ ((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) → (∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∃𝑔(𝑔:𝐸–1-1-onto→𝐾 ∧ ∀𝑒 ∈ 𝐸 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))))
44	8, 43	bitrd 281	1 ⊢ ((𝐴 ∈ USPGraph ∧ 𝐵 ∈ USPGraph) → (𝐴 IsomGr 𝐵 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝑓‘𝑎), (𝑓‘𝑏)} ∈ 𝐾))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1536  ∃wex 1779   ∈ wcel 2113  ∀wral 3137  {cpr 4562   class class class wbr 5059   “ cima 5551   Fn wfn 6343  ⟶wf 6344  –1-1-onto→wf1o 6347  ‘cfv 6348  Vtxcvtx 26779  Edgcedg 26830  USHGraphcushgr 26840  USPGraphcuspgr 26931   IsomGr cisomgr 44058

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323  ax-un 7454  ax-cnex 10586  ax-resscn 10587  ax-1cn 10588  ax-icn 10589  ax-addcl 10590  ax-addrcl 10591  ax-mulcl 10592  ax-mulrcl 10593  ax-mulcom 10594  ax-addass 10595  ax-mulass 10596  ax-distr 10597  ax-i2m1 10598  ax-1ne0 10599  ax-1rid 10600  ax-rnegex 10601  ax-rrecex 10602  ax-cnre 10603  ax-pre-lttri 10604  ax-pre-lttrn 10605  ax-pre-ltadd 10606  ax-pre-mulgt0 10607

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-nel 3123  df-ral 3142  df-rex 3143  df-reu 3144  df-rmo 3145  df-rab 3146  df-v 3493  df-sbc 3769  df-csb 3877  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-pss 3947  df-nul 4285  df-if 4461  df-pw 4534  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4870  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7107  df-ov 7152  df-oprab 7153  df-mpo 7154  df-om 7574  df-1st 7682  df-2nd 7683  df-wrecs 7940  df-recs 8001  df-rdg 8039  df-1o 8095  df-2o 8096  df-oadd 8099  df-er 8282  df-en 8503  df-dom 8504  df-sdom 8505  df-fin 8506  df-dju 9323  df-card 9361  df-pnf 10670  df-mnf 10671  df-xr 10672  df-ltxr 10673  df-le 10674  df-sub 10865  df-neg 10866  df-nn 11632  df-2 11694  df-n0 11892  df-xnn0 11962  df-z 11976  df-uz 12238  df-fz 12890  df-hash 13688  df-edg 26831  df-uhgr 26841  df-ushgr 26842  df-upgr 26865  df-uspgr 26933  df-isomgr 44060

This theorem is referenced by: (None)