Theorem isomin 7286

Description: Isomorphisms preserve minimal elements. Note that (^◡𝑅 “ {𝐷}) is Takeuti and Zaring's idiom for the initial segment {𝑥 ∣ 𝑥𝑅𝐷}. Proposition 6.31(1) of [TakeutiZaring] p. 33. (Contributed by NM, 19-Apr-2004.)

Assertion

Ref	Expression
isomin	⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))

Proof of Theorem isomin

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		neq0 4293	. . . 4 ⊢ (¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅ ↔ ∃𝑦 𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})))
2		vex 3434	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
3	2	elima 6025	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝐻 “ 𝐶) ↔ ∃𝑥 ∈ 𝐶 𝑥𝐻𝑦)
4		ssel 3916	. . . . . . . . . . . . . 14 ⊢ (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴))
5		isof1o 7272	. . . . . . . . . . . . . . 15 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻:𝐴–1-1-onto→𝐵)
6		f1ofn 6776	. . . . . . . . . . . . . . 15 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → 𝐻 Fn 𝐴)
7		fnbrfvb 6885	. . . . . . . . . . . . . . . 16 ⊢ ((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦))
8	7	ex 412	. . . . . . . . . . . . . . 15 ⊢ (𝐻 Fn 𝐴 → (𝑥 ∈ 𝐴 → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦)))
9	5, 6, 8	3syl 18	. . . . . . . . . . . . . 14 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥 ∈ 𝐴 → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦)))
10	4, 9	syl9r 78	. . . . . . . . . . . . 13 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦))))
11	10	imp31 417	. . . . . . . . . . . 12 ⊢ (((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) ∧ 𝑥 ∈ 𝐶) → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦))
12	11	rexbidva 3160	. . . . . . . . . . 11 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦 ↔ ∃𝑥 ∈ 𝐶 𝑥𝐻𝑦))
13	3, 12	bitr4id 290	. . . . . . . . . 10 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (𝑦 ∈ (𝐻 “ 𝐶) ↔ ∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦))
14		fvex 6848	. . . . . . . . . . 11 ⊢ (𝐻‘𝐷) ∈ V
15	2	eliniseg 6054	. . . . . . . . . . 11 ⊢ ((𝐻‘𝐷) ∈ V → (𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ 𝑦𝑆(𝐻‘𝐷)))
16	14, 15	mp1i 13	. . . . . . . . . 10 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ 𝑦𝑆(𝐻‘𝐷)))
17	13, 16	anbi12d 633	. . . . . . . . 9 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → ((𝑦 ∈ (𝐻 “ 𝐶) ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ (∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
18		elin 3906	. . . . . . . . 9 ⊢ (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ (𝑦 ∈ (𝐻 “ 𝐶) ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
19		r19.41v 3168	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) ↔ (∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))
20	17, 18, 19	3bitr4g 314	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
21	20	adantrr 718	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
22		breq1 5089	. . . . . . . . . . . . . 14 ⊢ ((𝐻‘𝑥) = 𝑦 → ((𝐻‘𝑥)𝑆(𝐻‘𝐷) ↔ 𝑦𝑆(𝐻‘𝐷)))
23	22	biimpar 477	. . . . . . . . . . . . 13 ⊢ (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → (𝐻‘𝑥)𝑆(𝐻‘𝐷))
24		vex 3434	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
25	24	eliniseg 6054	. . . . . . . . . . . . . . 15 ⊢ (𝐷 ∈ 𝐴 → (𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ 𝑥𝑅𝐷))
26	25	ad2antll 730	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ 𝑥𝑅𝐷))
27		isorel 7275	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝑅𝐷 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
28	26, 27	bitrd 279	. . . . . . . . . . . . 13 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
29	23, 28	imbitrrid 246	. . . . . . . . . . . 12 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷})))
30	29	exp32 420	. . . . . . . . . . 11 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥 ∈ 𝐴 → (𝐷 ∈ 𝐴 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷})))))
31	4, 30	syl9r 78	. . . . . . . . . 10 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → (𝐷 ∈ 𝐴 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷}))))))
32	31	com34 91	. . . . . . . . 9 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝐷 ∈ 𝐴 → (𝑥 ∈ 𝐶 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷}))))))
33	32	imp32 418	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷}))))
34	33	reximdvai 3149	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → ∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷})))
35	21, 34	sylbid 240	. . . . . 6 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷})))
36		elin 3906	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) ↔ (𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})))
37	36	exbii 1850	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) ↔ ∃𝑥(𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})))
38		neq0 4293	. . . . . . 7 ⊢ (¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ∃𝑥 𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})))
39		df-rex 3063	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ ∃𝑥(𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})))
40	37, 38, 39	3bitr4i 303	. . . . . 6 ⊢ (¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷}))
41	35, 40	imbitrrdi 252	. . . . 5 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅))
42	41	exlimdv 1935	. . . 4 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∃𝑦 𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅))
43	1, 42	biimtrid 242	. . 3 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅ → ¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅))
44	43	con4d 115	. 2 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ → ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
45	5, 6	syl 17	. . . . . . . . 9 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Fn 𝐴)
46		fnfvima 7182	. . . . . . . . . . 11 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴 ∧ 𝑥 ∈ 𝐶) → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶))
47	46	3expia 1122	. . . . . . . . . 10 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴) → (𝑥 ∈ 𝐶 → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
48	47	adantrr 718	. . . . . . . . 9 ⊢ ((𝐻 Fn 𝐴 ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
49	45, 48	sylan 581	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
50	49	adantrd 491	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})) → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
51	27	biimpd 229	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝑅𝐷 → (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
52		fvex 6848	. . . . . . . . . . . . . . . 16 ⊢ (𝐻‘𝑥) ∈ V
53	52	eliniseg 6054	. . . . . . . . . . . . . . 15 ⊢ ((𝐻‘𝐷) ∈ V → ((𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
54	14, 53	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷))
55	51, 54	imbitrrdi 252	. . . . . . . . . . . . 13 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝑅𝐷 → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
56	26, 55	sylbid 240	. . . . . . . . . . . 12 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
57	56	exp32 420	. . . . . . . . . . 11 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥 ∈ 𝐴 → (𝐷 ∈ 𝐴 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))))
58	4, 57	syl9r 78	. . . . . . . . . 10 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → (𝐷 ∈ 𝐴 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))))
59	58	com34 91	. . . . . . . . 9 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝐷 ∈ 𝐴 → (𝑥 ∈ 𝐶 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))))
60	59	imp32 418	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))
61	60	impd 410	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
62	50, 61	jcad 512	. . . . . 6 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})) → ((𝐻‘𝑥) ∈ (𝐻 “ 𝐶) ∧ (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))
63		elin 3906	. . . . . 6 ⊢ ((𝐻‘𝑥) ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ((𝐻‘𝑥) ∈ (𝐻 “ 𝐶) ∧ (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
64	62, 36, 63	3imtr4g 296	. . . . 5 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) → (𝐻‘𝑥) ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)}))))
65		n0i 4281	. . . . 5 ⊢ ((𝐻‘𝑥) ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅)
66	64, 65	syl6 35	. . . 4 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
67	66	exlimdv 1935	. . 3 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∃𝑥 𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
68	38, 67	biimtrid 242	. 2 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
69	44, 68	impcon4bid 227	1 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∃wrex 3062  Vcvv 3430   ∩ cin 3889   ⊆ wss 3890  ∅c0 4274  {csn 4568   class class class wbr 5086  ^◡ccnv 5624   “ cima 5628   Fn wfn 6488  –1-1-onto→wf1o 6492  ‘cfv 6493   Isom wiso 6494

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-f1o 6500  df-fv 6501  df-isom 6502

This theorem is referenced by:  isofrlem  7289